{
  "abstract": "Quantum low-density parity-check (qLDPC) codes can substantially reduce the qubit overhead of fault-tolerant quantum computation, but any useful architecture based on such codes also requires an efficient mechanism to implement non-Clifford gates in a fault-tolerant manner. We introduce a space-time-efficient magic state factory for high-rate qLDPC codes by combining the transversal non-Clifford gates of recently developed tricycle codes with single-shot four-dimensional balanced product quadcycle codes. The key ingredient is an efficient \"escape\" mechanism that teleports postselected logical magic states from tricycle codes to larger distance quadcycle codes. Under a standard circuit-level noise model at physical error rate $10^{-3}$, our factories produce $\\mathrm{CCZ}$ states at logical error rates as low as $10^{-9}$ with 10-40 times lower space-time cost than state-of-the-art magic state generation methods. The resulting states are directly encoded in high-rate blocks suitable for computation. We identify the quadcycle codes by an AI-assisted search and show that they can serve as excellent memories capable of single-shot error correction. Finally, we present a concrete implementation of the entire factory with highly efficient atom transport on reconfigurable neutral-atom quantum computers. Together, these results provide an end-to-end, practical protocol for producing and utilizing high-fidelity magic states within a high-rate qLDPC architecture, with the lowest space-time cost to date.",
  "abstract_shown": true,
  "affiliations": [],
  "article_type": null,
  "arxiv": "2610.10731",
  "author_total": 11,
  "authors": [
    {
      "name": "Varun Menon"
    },
    {
      "name": "Rohan Mehta"
    },
    {
      "name": "Andi Gu"
    },
    {
      "name": "Andrei C. Diaconu"
    },
    {
      "name": "Daniel Bochen Tan"
    },
    {
      "name": "Xiao Xiao"
    },
    {
      "name": "Michael J. Gullans"
    },
    {
      "name": "Qian Xu"
    },
    {
      "name": "Hengyun Zhou"
    },
    {
      "name": "Mikhail D. Lukin"
    },
    {
      "name": "J. Pablo Bonilla Ataides"
    }
  ],
  "bibtex": "https://research.draconitic.com/paper/97e45dp0hq4sm.bib",
  "cited_by": 0,
  "doi": "10.48550/arxiv.2610.10731",
  "fulltext_url": null,
  "id": "97e45dp0hq4sm",
  "issns": [],
  "landing_url": "https://arxiv.org/abs/2610.10731",
  "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",
      "quant-ph"
    ],
    [
      "openalex",
      "1702|Quantum Computing Algorithms and Architecture"
    ]
  ],
  "openalex": "W7221190519",
  "pdf_url": "https://arxiv.org/pdf/2610.10731",
  "pmcid": null,
  "pmid": null,
  "published": "2026-10-07",
  "publisher": null,
  "ris": "https://research.draconitic.com/paper/97e45dp0hq4sm.ris",
  "sources": [
    {
      "first_seen": "2026-10-30T12:27:54Z",
      "native_id": "2610.10731",
      "source": "arxiv",
      "url": "https://arxiv.org/abs/2610.10731"
    }
  ],
  "subjects": [
    {
      "field": "physics",
      "origin": "arxiv:quant-ph",
      "subfield": "quantum"
    }
  ],
  "title": "Single-shot magic state factories for quantum LDPC codes",
  "title_text": "Single-shot magic state factories for quantum LDPC codes",
  "type": "preprint",
  "updated_at": "2026-10-30T12:27:54Z",
  "url": "https://research.draconitic.com/paper/97e45dp0hq4sm",
  "venue": "arXiv",
  "versions": []
}