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

Holevo极限下的量子密钥分发

Quantum key distribution in the Holevo limit

Adan Cabello

摘要:

Shannon的定理和Holevo定理规定,用于量子密钥分发的任何协议的效率,$\cal E$,定义为秘密的数量(即,允许窃听检测)比特加上量子比特,是${\cal E} \le 1$。这里要解决的问题是能否达到极限${\cal E} =1$。它表明,它可以通过分裂几个量子位之间的秘密位,并迫使夏娃只有一个顺序访问量子位,如Goldenberg和Vaidman提出的。提出了一种基于偏振光子的${\cal E} =1$协议,其中Bob的状态鉴别可以用线性光学元件实现。

英文摘要:

A theorem by Shannon and the Holevo theorem impose that the efficiency of any protocol for quantum key distribution, $\cal E$, defined as the number of secret (i.e., allowing eavesdropping detection) bits per transmitted bit plus qubit, is ${\cal E} \le 1$. The problem addressed here is whether the limit ${\cal E} =1$ can be achieved. It is showed that it can be done by splitting the secret bits between several qubits and forcing Eve to have only a sequential access to the qubits, as proposed by Goldenberg and Vaidman. A protocol with ${\cal E} =1$ based on polarized photons and in which Bob's state discrimination can be implemented with linear optical elements is presented.

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

↑