arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2303.01293quant-ph
收藏

简单的量子性测试也能认证量子比特

Simple Tests of Quantumness Also Certify Qubits

Zvika Brakerski, Alexandru Gheorghiu, Gregory D. Kahanamoku-Meyer, Eitan Porat, Thomas Vidick

AI总结:

本文证明遵循特定模板的量子性测试协议也可用于认证量子比特,该认证可仅基于后量子陷门无爪函数或量子全同态加密实现,并通过将量子合理性归约为“同时回答两个挑战”的算法任务,证明了0.853的紧致成功概率界限。

摘要:

量子性测试是一种允许经典验证者认证证明者(仅)非经典性的协议。我们表明,遵循特定模板的量子性测试(该模板涵盖了诸如(Kalai et al., 2022)等近期提案)实际上能做更多事情。即,相同的协议可用于认证量子比特,这一基础构件是可认证随机性和量子计算的经典委托等应用的核心。此前,仅知基于Learning with Errors问题的困难性和使用自适应硬核(Brakerski et al., 2018)才可能实现量子比特认证。我们的框架允许仅基于后量子陷门无爪函数的存在,或基于量子全同态加密来认证量子比特。例如,这些可以从Ring Learning with Errors实例化。在技术方面,我们表明任何此类协议的量子合理性都可归约为证明一个简单算法任务的界限:非正式地说,即在协议中“同时回答两个挑战”。我们的归约形式化了这种直觉:这些协议通过利用无法对一般量子证明者进行回退的不可能性来展示量子性。这使我们能够证明(Kahanamoku-Meyer et al., 2021)和(Kalai et al., 2022)量子合理性的严格界限,表明没有任何量子多项式时间证明者能以大于$\cos^2 \fracπ{8}\approx 0.853$的概率成功。此前,仅知经典证明者成功概率的上界和量子证明者成功概率的下界。随后我们将此量子合理性证明扩展,表明接近量子合理性界限的证明者必须执行几乎反交换的测量。这便证明了证明者持有量子比特。

英文摘要:

A test of quantumness is a protocol that allows a classical verifier to certify (only) that a prover is not classical. We show that tests of quantumness that follow a certain template, which captures recent proposals such as (Kalai et al., 2022), can in fact do much more. Namely, the same protocols can be used for certifying a qubit, a building-block that stands at the heart of applications such as certifiable randomness and classical delegation of quantum computation. Certifying qubits was previously only known to be possible based on the hardness of the Learning with Errors problem and the use of adaptive hardcore (Brakerski et al., 2018). Our framework allows certification of qubits based only on the existence of post-quantum trapdoor claw-free functions, or on quantum fully homomorphic encryption. These can be instantiated, for example, from Ring Learning with Errors. On the technical side, we show that the quantum soundness of any such protocol can be reduced to proving a bound on a simple algorithmic task: informally, answering ``two challenges simultaneously'' in the protocol. Our reduction formalizes the intuition that these protocols demonstrate quantumness by leveraging the impossibility of rewinding a general quantum prover. This allows us to prove tight bounds on the quantum soundness of (Kahanamoku-Meyer et al., 2021) and (Kalai et al., 2022), showing that no quantum polynomial-time prover can succeed with probability larger than $\cos^2 \fracπ{8}\approx 0.853$. Previously, only an upper bound on the success probability of classical provers, and a lower bound on the success probability of quantum provers, were known. We then extend this proof of quantum soundness to show that provers that approach the quantum soundness bound must perform almost anti-commuting measurements. This certifies that the prover holds a qubit.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑