论文标题
盲目分解21量子
Blindly Factorizing 21 Quantumly
论文作者
论文摘要
我们为不信任远程量子服务器的经典客户端盲目地分解了一个经典的可验证方案，以盲目地分解半ipemime 21。 Our scheme advances state of the art, which achieves blind factorization of 15 quantumly, by increasing the problem to factorizing the next semiprime, choosing a harder base, executing a non-Clifford gate, and showing that the security check for 15 also works for 21. Our algorithmic approach to incorporating non-Clifford operations sets the stage for scaling blind quantum factorization, whereas our five-EPR-pair scheme motivates a photonic experiment that取代了盲人分解的当前证明。
We develop a classically verifiable scheme for blindly factorizing the semiprime 21 quantumly for a classical client who does not trust the remote quantum servers. Our scheme advances state of the art, which achieves blind factorization of 15 quantumly, by increasing the problem to factorizing the next semiprime, choosing a harder base, executing a non-Clifford gate, and showing that the security check for 15 also works for 21. Our algorithmic approach to incorporating non-Clifford operations sets the stage for scaling blind quantum factorization, whereas our five-EPR-pair scheme motivates a photonic experiment that supplants current demonstrations of blind factorization.
