arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2501.13103quant-ph
收藏

隐变量量子通信的可实现性

Achievability of Covert Quantum Communication

Evan J. D. Anderson, Michael S. Bullock, Filip Rozpędek, Boulat A. Bash

AI总结:

该研究证明了在任意量子信道上,隐变量通信可实现平方根定律,即在n次信道使用中可可靠且隐蔽地传输约√n个量子比特,并给出了有无经典辅助时的下界及所需经典隐变量比特数。

摘要:

我们探讨了在任意量子信道上进行量子比特的隐变量通信。隐变量通信将传输隐藏在信道噪声中,确保对手无法检测到其存在。我们证明了量子隐变量通信的平方根定律(SRL)的可实现性,该定律与经典情形类似:在一般量子信道的n次使用中,可以隐变量且可靠地传输M(n)∝√n个量子比特。我们在有无双向隐变量经典信道辅助的两种情况下,给出了M(n)的下界。在前一种情况下,我们量化了足以支持我们协议所需的经典隐变量比特数。

英文摘要:

We explore covert communication of qubits over an arbitrary quantum channel. Covert communication conceals the transmissions in the channel noise, ensuring that an adversary is unable to detect their presence. We show the achievability of a $\textit{square root law}$ (SRL) for quantum covert communication similar to that for classical: $M(n)\propto\sqrt{n}$ qubits can be transmitted covertly and reliably over $n$ uses of a general quantum channel. We lower bound $M(n)$ with and without assistance from a two-way covert classical channel. In the former case, we quantify the number of classical covert bits sufficient for our protocol.

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

↑