{
  "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.",
  "abstract_shown": true,
  "affiliations": [],
  "article_type": null,
  "arxiv": "2610.03920",
  "author_total": 8,
  "authors": [
    {
      "name": "Kathleen Chang"
    },
    {
      "name": "Anasuya Lyons"
    },
    {
      "name": "Yuanjie Ren"
    },
    {
      "name": "Harald Putterman"
    },
    {
      "name": "Nathanan Tantivasadakarn"
    },
    {
      "name": "Victor V. Albert"
    },
    {
      "name": "Benjamin J. Brown"
    },
    {
      "name": "Dominic J. Williamson"
    }
  ],
  "bibtex": "https://research.draconitic.com/paper/4gw9gvtnb61cj.bib",
  "cited_by": 0,
  "doi": "10.48550/arxiv.2610.03920",
  "fulltext_url": null,
  "id": "4gw9gvtnb61cj",
  "issns": [],
  "landing_url": "https://arxiv.org/abs/2610.03920",
  "language": null,
  "licence": "CC-BY-4.0",
  "licence_label": "CC BY 4.0",
  "licence_source": "article",
  "licence_url": "http://creativecommons.org/licenses/by/4.0/",
  "metadata_licence": "CC0-1.0",
  "native_subjects": [
    [
      "arxiv",
      "cond-mat.str-el"
    ],
    [
      "arxiv",
      "quant-ph"
    ],
    [
      "openalex",
      "1702|Quantum Computing Algorithms and Architecture"
    ]
  ],
  "openalex": "W7220720773",
  "pdf_url": "https://arxiv.org/pdf/2610.03920",
  "pmcid": null,
  "pmid": null,
  "published": "2026-10-02",
  "publisher": null,
  "ris": "https://research.draconitic.com/paper/4gw9gvtnb61cj.ris",
  "sources": [
    {
      "first_seen": "2026-10-30T12:27:01Z",
      "native_id": "2610.03920",
      "source": "arxiv",
      "url": "https://arxiv.org/abs/2610.03920"
    }
  ],
  "subjects": [
    {
      "field": "physics",
      "origin": "arxiv:cond-mat.str-el",
      "subfield": "condensed-matter"
    },
    {
      "field": "physics",
      "origin": "arxiv:quant-ph",
      "subfield": "quantum"
    }
  ],
  "title": "Magic Quantum Code Surgery",
  "title_text": "Magic Quantum Code Surgery",
  "type": "preprint",
  "updated_at": "2026-10-30T12:27:01Z",
  "url": "https://research.draconitic.com/paper/4gw9gvtnb61cj",
  "venue": "arXiv",
  "versions": []
}