Skip to content
DraconiticResearch
Search Sources API
203,234 studies31 sourcesUpdated 24 min ago
PreprintCC BY 4.0arXiv

Magic Quantum Code Surgery

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.

Related

  1. Early Fault-Tolerant Magic State Synthesis and Spacetime Efficient Analog Rotations with Color Code on a Superconducting Quantum Processor
    Sean Garner, Aaron Hoyt, Shuwen Kan +3
    arXivPreprintCC BY 4.0Full textQuantum physics & quantum informationarXiv
  2. The resource cost of magic in a code block
    Jiachen Shen, Hui Zhong
    arXivPreprintCC BY 4.0Full textQuantum physics & quantum informationarXiv
  3. The quantum magic of top quarks
    Chris D. White
    arXivPreprintCC BY 4.0Full textHigh-energy & particle physicsarXiv
  4. A Syndrome-Extraction Framework for Distributed Lattice Surgery on Arbitrary Rotated Surface-Code Layouts
    Pritesh Thakur, Daniel Dilley, Zain Saleem
    arXivPreprintCC BY 4.0Full textQuantum physics & quantum informationarXiv
  5. Universal entanglement embezzlement and divergent nonlocal magic from generic local chaotic quantum evolution
    Matias Karjula, Teemu Ojanen, Kim Pöyhönen +2
    arXivPreprintCC BY 4.0Full textCondensed matterQuantum physics & quantum informationarXiv
BibTeX
@misc{chang2026magic,
  title = {{Magic Quantum Code Surgery}},
  author = {Kathleen Chang and Anasuya Lyons and Yuanjie Ren and Harald Putterman and Nathanan Tantivasadakarn and Victor V. Albert and Benjamin J. Brown and Dominic J. Williamson},
  howpublished = {arXiv},
  year = {2026},
  month = oct,
  doi = {10.48550/arxiv.2610.03920},
  eprint = {2610.03920},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2610.03920},
  note = {CC BY 4.0},
}
RIS
TY  - UNPB
TI  - Magic Quantum Code Surgery
AU  - Kathleen Chang
AU  - Anasuya Lyons
AU  - Yuanjie Ren
AU  - Harald Putterman
AU  - Nathanan Tantivasadakarn
AU  - Victor V. Albert
AU  - Benjamin J. Brown
AU  - Dominic J. Williamson
PY  - 2026
DA  - 2026/10/02
PB  - arXiv
DO  - 10.48550/arxiv.2610.03920
UR  - https://arxiv.org/abs/2610.03920
AB  - 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.
ER  -