论文标题
低噪声交互式量子通信的能力接近编码，第一部分：大型字母
Capacity Approaching Coding for Low Noise Interactive Quantum Communication, Part I: Large Alphabets
论文作者
论文摘要
我们考虑在嘈杂的渠道上实施两党互动量子通信的问题，如果我们希望完全获得量子的优势，这是必要的努力。对于带有$ n $消息的任意协议，该协议是为$ \ mathrm {poly}（n）$ size alphabet设计的无噪声Qudit频道的设计，我们的主要结果是一种模拟方法，概率不到$ 2^{ - θ（nε）} $，并且使用QUDIT通道，并使用Qudit通道。 $ n \ left（1+θ\ left（\sqrtε\ right）\右）$ times，其中$ε$分数可以在对抗性上损坏。因此，模拟的能力达到了领先顺序，我们猜想它是最佳的，直至$ \sqrtε$项中的恒定因素。此外，模拟是在一个模型中，该模型不需要前共享的资源，例如随机性或交流方之间的纠缠。我们的工作改善了最佳以前已知的量子结果，而低$ε$的开销是一个不明确的大常数[Brassard等，focs'14]。
We consider the problem of implementing two-party interactive quantum communication over noisy channels, a necessary endeavor if we wish to fully reap quantum advantages for communication. For an arbitrary protocol with $n$ messages, designed for a noiseless qudit channel over a $\mathrm{poly}(n)$ size alphabet, our main result is a simulation method that fails with probability less than $2^{-Θ(nε)}$ and uses a qudit channel over the same alphabet $n\left(1+Θ\left(\sqrtε\right)\right)$ times, of which an $ε$ fraction can be corrupted adversarially. The simulation is thus capacity achieving to leading order, and we conjecture that it is optimal up to a constant factor in the $\sqrtε$ term. Furthermore, the simulation is in a model that does not require pre-shared resources such as randomness or entanglement between the communicating parties. Our work improves over the best previously known quantum result where the overhead is a non-explicit large constant [Brassard et al., FOCS'14] for low $ε$.
