通过连续测量获得Holevo界
Achieving the Holevo bound via sequential measurements
摘要：
我们提出了一种新的解码过程来传输经典信息的量子信道，渐近饱和的Holevo界，实现最佳的通信线路的速率。与先前的提议不同，它基于执行一系列（投射的）是/否测量，其在N个步骤中确定发送器发送了哪个码字（N是码字的数量）。我们的分析表明，只要N是低于由Holevo界施加的限制的错误概率可以被发送到零的码字的长度渐近。
英文摘要：
We present a new decoding procedure to transmit classical information in a quantum channel which, saturating asymptotically the Holevo bound, achieves the optimal rate of the communication line. Differently from previous proposals, it is based on performing a sequence of (projective) YES/NO measurements which in N steps determines which codeword was sent by the sender (N being the number of the codewords). Our analysis shows that as long as N is below the limit imposed by the Holevo bound the error probability can be sent to zero asymptotically in the length of the codewords.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
