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

针对位置验证的自然函数的线性门限界

Linear gate bounds against natural functions for position-verification

Institute for Quantum Computing, University of Waterloo(滑铁卢大学量子计算研究所);Perimeter Institute for Theoretical Physics(理论物理前沿研究所)

Vahid Asadi, Richard Cleve, Eric Culf, Alex May

AI总结:

研究量子位置验证方案,针对$f$-路由和$f$-BB84方案,证明实现函数$f$所需的量子门及单比特测量数量由其在特定模型中的通信复杂度线性下界,以内积函数为例得到$\Omega(n)$下界,该方案对特定资源证明者可行且安全。

摘要:

量子位置验证方案旨在验证证明者的空间位置。证明者会收到包含量子和经典输入的挑战,并必须在适当的时间做出响应。我们考虑两种经过充分研究的位置验证方案,即$f$-路由和$f$-BB84。这两种方案都要求诚实的证明者对长度为$n$的输入局部计算经典函数$f$,并操纵$O(1)$大小的量子系统。我们证明,在具有共享纠缠的同时消息传递模型中,实现函数$f$所需的量子门数量加上单比特测量数量,由$f$的通信复杂度线性下界。以$f(x,y)=\sum_i x_i y_i$作为内积函数,我们得到了量子门加上单比特测量的$\Omega(n)$下界。该方案对于具有线性经典资源和$O(1)$量子资源的证明者是可行的,并且对次线性量子资源是安全的。

英文摘要:

A quantum position-verification scheme attempts to verify the spatial location of a prover. The prover is issued a challenge with quantum and classical inputs and must respond with appropriate timings. We consider two well-studied position-verification schemes known as $f$-routing and $f$-BB84. Both schemes require an honest prover to locally compute a classical function $f$ of inputs of length $n$, and manipulate $O(1)$ size quantum systems. We prove the number of quantum gates plus single qubit measurements needed to implement a function $f$ is lower bounded linearly by the communication complexity of $f$ in the simultaneous message passing model with shared entanglement. Taking $f(x,y)=\sum_i x_i y_i$ to be the inner product function, we obtain a $Ω(n)$ lower bound on quantum gates plus single qubit measurements. The scheme is feasible for a prover with linear classical resources and $O(1)$ quantum resources, and secure against sub-linear quantum resources.

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

↑