分布式量子计算的通信链路
Communication Links for Distributed Quantum Computation
摘要：
分布式量子计算需要在一定距离上作用于逻辑量子比特的纠错编码状态的量子操作，例如通过隐形传态传输量子比特。我们评估了几种量子纠错码的性能，发现当使用两个级别的[[23，1，7]]码时，1%或更高的隐形传态失败率是可以容忍的。我们提出了一个分析执行量子纠错（QEC）的QEC编码的状态，跨越两个量子计算机，包括分布式逻辑零的创建。逻辑状态的各个量子位的传输可以在时间或空间上多路复用，跨单个链路串行移动，或跨多个链路并行移动。我们表明，使用串行链路的性能和可靠性的惩罚是小的物理参数范围很广，使串行链路更适合于一个大型的分布式量子多计算机时，工程上的困难被考虑。这样的多计算机将能够使用Shor算法以高成功率分解1，024位数。
英文摘要：
Distributed quantum computation requires quantum operations that act over a distance on error-correction encoded states of logical qubits, such as the transfer of qubits via teleportation. We evaluate the performance of several quantum error correction codes, and find that teleportation failure rates of one percent or more are tolerable when two levels of the [[23,1,7]] code are used. We present an analysis of performing quantum error correction (QEC) on QEC-encoded states that span two quantum computers, including the creation of distributed logical zeroes. The transfer of the individual qubits of a logical state may be multiplexed in time or space, moving serially across a single link, or in parallel across multiple links. We show that the performance and reliability penalty for using serial links is small for a broad range of physical parameters, making serial links preferable for a large, distributed quantum multicomputer when engineering difficulties are considered. Such a multicomputer will be able to factor a 1,024-bit number using Shor's algorithm with a high probability of success.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
