{
  "abstract": "Classical simulation of magic state factories, including distillation, cultivation, and code switching, is challenging because of their substantial non-Clifford content. We introduce $\\texttt{magna}$ (magic-state-factory assessment via global network algebra), a classical simulator that simulates such protocols as cheaply as Clifford circuits. $\\texttt{magna}$ expresses the figures of merit of a protocol, namely the acceptance rate and the fidelity of the accepted states, as tensor networks, which it reduces globally by exploiting a structural correspondence with transversal gates on quantum codes. $\\texttt{magna}$ further supports feedforward conditioned on arbitrary functions of mid-circuit measurement outcomes, including decoder outputs. We simulate Bravyi--Haah distillation with up to 100 output magic states at a cost that does not grow exponentially in the number of outputs, and achieve state-of-the-art sampling times for distance-5 magic state cultivation on both color codes and RP$^2$ surface codes. Finally, we validate nonlinear feedforward on a logical-level distillation protocol with 15 rounds of decoder-dependent feedforward. $\\texttt{magna}$ aims to contribute to the key infrastructure for the large-scale evaluation and optimization of magic state factories.",
  "abstract_shown": true,
  "affiliations": [],
  "article_type": null,
  "arxiv": "2610.22315",
  "author_total": 2,
  "authors": [
    {
      "name": "Yifei Wang"
    },
    {
      "name": "Yingfei Gu"
    }
  ],
  "bibtex": "https://research.draconitic.com/paper/0mm273rg4kd0s.bib",
  "cited_by": 0,
  "doi": "10.48550/arxiv.2610.22315",
  "fulltext_url": null,
  "id": "0mm273rg4kd0s",
  "issns": [],
  "landing_url": "https://arxiv.org/abs/2610.22315",
  "language": null,
  "licence": "LicenseRef-arXiv-nonexclusive-1.0",
  "licence_label": "arXiv licence",
  "licence_source": "article",
  "licence_url": "http://arxiv.org/licenses/nonexclusive-distrib/1.0/",
  "metadata_licence": "CC0-1.0",
  "native_subjects": [
    [
      "arxiv",
      "quant-ph"
    ],
    [
      "openalex",
      "1702|Quantum Computing Algorithms and Architecture"
    ]
  ],
  "openalex": "W7222637516",
  "pdf_url": "https://arxiv.org/pdf/2610.22315",
  "pmcid": null,
  "pmid": null,
  "published": "2026-10-15",
  "publisher": null,
  "ris": "https://research.draconitic.com/paper/0mm273rg4kd0s.ris",
  "sources": [
    {
      "first_seen": "2026-10-30T12:29:50Z",
      "native_id": "2610.22315",
      "source": "arxiv",
      "url": "https://arxiv.org/abs/2610.22315"
    }
  ],
  "subjects": [
    {
      "field": "physics",
      "origin": "arxiv:quant-ph",
      "subfield": "quantum"
    }
  ],
  "title": "Magna: simulating magic state factories as cheaply as Clifford circuits",
  "title_text": "Magna: simulating magic state factories as cheaply as Clifford circuits",
  "type": "preprint",
  "updated_at": "2026-11-09T00:20:16Z",
  "url": "https://research.draconitic.com/paper/0mm273rg4kd0s",
  "venue": "arXiv",
  "versions": []
}