发表机构
Yale University; Harvard University; Massachusetts Institute of Technology; Stony Brook University; University of Maryland; IBM Quantum, T. J. Watson Research Center; IBM Denmark; University of Sydney（耶鲁大学; 哈佛大学; 麻省理工学院; 石溪大学; 马里兰大学; IBM量子，T.J.沃森研究中心; IBM丹麦; 悉尼大学）
机构由 AI 辅助整理，请以论文原文为准。AI 中文总结
提出一种在QLDPC码中容错测量横向克利福德逻辑算子的广义框架，通过变形码结构实现非克利福德门和魔法态制备，保持LDPC性质并线性保持距离。
AI 中文摘要
通用量子计算所需的非克利福德操作可以通过测量逻辑克利福德算子来实现。我们提出了一个广义框架，用于在量子低密度奇偶校验（QLDPC）码中容错地测量横向克利福德逻辑算子。我们的协议采用任意QLDPC码，并在额外的辅助量子比特上变形该码，使得稳定子乘积能够测量所需的逻辑克利福德算子。我们证明了变形后的克利福德稳定子码仍然是LDPC码，并且其距离保持在一个与物理量子比特数量无关的常数因子内。我们进一步证明了克利福德测量的容错距离针对数据量子比特和测量误差随原始码的距离线性增长。我们将我们的方法应用于实现算法相关子程序中的逻辑非克利福德门，并在量子稳定子码中制备魔法态。
英文摘要
Non-Clifford operations required for universal quantum computation can be implemented by measuring logical Clifford operators. We present a generalized framework to fault-tolerantly measure transversal Clifford logical operators in quantum low-density parity check (QLDPC) codes. Our protocol takes any QLDPC code and deforms the code across additional ancillary qubits such that a product of stabilizers measures the desired logical Clifford operator. We prove that the deformed, Clifford-stabilized code remains LDPC and that its distance is preserved up to a constant factor independent of the number of physical qubits. We further prove that the Clifford measurement has a fault distance against data qubit and measurement errors that grows linearly with the distance of the original code. We apply our methods to implement logical non-Clifford gates in algorithmically relevant subroutines and to prepare magic states in quantum stabilizer codes.
Comments105 pages, 9 figures
