AI 中文总结
研究分布式量子计算中逻辑量子比特在有损光链路传输问题，利用基于测量的量子中继器结构不对称特性，采用矩形Bacon-Shor子系统码提高传输效率，扩展框架实现无解码器客户端的分布式量子计算，降低中继器密度。
AI 中文摘要
分布式量子计算需要在有损光链路上移动逻辑量子比特，但其传输层通常与所服务的计算分开设计。我们将两者结合起来，因为基于测量的量子中继器是沿传输轴分层的二维码，使得主要信道损耗集中在传输扇区，而本地测量的量子比特大多得以幸免。通过使码距与这种结构不对称相匹配，我们表明矩形Bacon-Shor子系统码传输逻辑量子比特的效率明显高于无传输意识的编码。在大陆距离上，其成本最优的中继器密度比近期具有可比传输速率的$[[48,6,8]]$基准低约一个数量级，且约为同等大小对称码的一半。此外，我们将该框架扩展到中心到客户端的往返过程，其中码级、保距码切换连接传输支路与客户端计算，并且中心节点对异构校验子记录的联合解码使分布式量子计算能够在无解码器客户端的情况下进行。
英文摘要
Distributed quantum computation needs to move logical qubits across lossy optical links, yet this transmission layer is usually designed separately from the computation it serves. We treat the two together by recognizing that a measurement-based quantum repeater is a two-dimensional code foliated along the transmission axis, so that the dominant channel loss is concentrated on the transmitted sector while the locally measured qubits are largely spared. Matching a code's distance to this structural asymmetry, we show that a rectangular Bacon-Shor subsystem code transmits a logical qubit markedly more efficiently than transmission-unaware encodings. Over continental distances, its cost-optimal repeater density is about an order of magnitude lower than that of a recent $[[48,6,8]]$ benchmark at comparable transmission rate, and roughly half that of a symmetric code of equal size. Moreover, we extend the framework to a central-to-client round trip in which a code-level, distance-preserving code switch joins the transmission legs to the client's computation, and joint decoding of the heterogeneous syndrome record at the central node lets distributed quantum computation proceed with a decoder-free client.
Comments15 pages, 8 figures, 4 tables
