arXiv:2610.03920
Magic Quantum Code Surgery
Kathleen Chang, Anasuya Lyons, Yuanjie Ren, Harald Putterman, Nathanan Tantivasadakarn, Victor V. Albert, Benjamin J. Brown, Dominic J. Williamson
Abstract
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.
AI Summary
The paper addresses how to implement fault-tolerant non-Clifford operations in QLDPC codes by measuring transversal logical Clifford operators, rather than requiring transversal non-Clifford gates or magic-state distillation. It develops a gauging-based code-surgery construction: ancillary qudits and sparse measurements deform a stabilizer code into a non-Pauli, Clifford-stabilized code whose stabilizer group contains the operator being measured. For a modular $q$-ary QLDPC code of length $n$ and distance $d$, with a finite-order transversal Clifford symmetry, the construction uses $O(n\log n)$ total qudits. With a suitable gauging graph, the intermediate code remains LDPC and has distance $d_{\mathrm g}\ge d/\nu$, with $\nu$ independent of code size. The static analysis identifies this code with the symmetry-invariant subspace of the original code. For qubit codes and involutory symmetries $U^2=I$, a protocol using $d$ syndrome-extraction rounds before, during, and after gauging has adversarial fault distance $d_{\mathrm f}\ge d/\gamma$ against Pauli data errors and measurement faults. The proof handles nondeterministic detectors using the nilpotent structure of the gauged stabilizer group and locality of fault-induced randomness. Applications include preparing multiple magic resource states through transversal CNOT measurements between identical CSS blocks, converting them into Toffoli states, and implementing controlled-Clifford subroutines through Clifford measurements. Examples cover bicycle, hypergraph-product, and topological codes. Spacetime fault tolerance for higher-order symmetries is left open; a noise threshold and practical decoding performance are not established by the fault-distance bounds.
Generative AI tools (ChatGPT 5.6, GPT-6 Sol, GPT-6 Astra, Claude Fable 5) were used during the final stages of the manuscript preparation to verify proofs, and for language and presentation edits.
Central claim may not hold: The abstract states a general fault-distance guarantee for transversal Clifford measurements, whereas the stated theorem establishes it only for order-two Clifford operators on qubit stabilizer codes and explicitly leaves higher-order measurement-error fault tolerance unresolved. The supplied manuscript contains only the introduction and informal theorem statements, not the referenced constructions and proofs needed to verify the central distance and fault-distance guarantees.
Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.
- Comments
- 105 pages, 9 figures