{
  "abstract": "Fault-tolerant preparation of non-Clifford resource states is a major contributor to the overhead of quantum computation, motivating protocols that achieve high output fidelity with minimal qubit and circuit costs. We introduce a low-cost magic-state preparation protocol in which the choice of stabilizer generators is co-designed with the flag gadgets, allowing the syndrome-extraction circuit itself to filter correlated faults across a non-Clifford layer. The protocol prepares a logical plus state in the 15-qubit quantum Reed-Muller code, applies a transversal T gate, and gauge-fixes the same register into the seven-qubit Steane code. By reorganizing equivalent Z-type stabilizer generators into jointly flagged measurement groups, the protocol eliminates all accepted logical-error contributions arising from one or two circuit faults under destructive error detection. Under a uniform circuit-level depolarizing noise model, the postselected infidelity is $210.2p^3+O(p^4)$. At $p=10^{-3}$, exact low-order enumeration combined with stratified sampling bounds the infidelity by $2.2\\times10^{-7}$ at 99.9% joint confidence, while retaining an acceptance probability of 86.9%. The complete circuit requires only 19 qubits and 82 CNOT gates. These results demonstrate that stabilizer-generator design can substantially reduce the cost of postselected magic-state preparation, although corrected operation and the fidelity of an unmeasured output block require separate analysis.",
  "abstract_shown": true,
  "affiliations": [],
  "article_type": null,
  "arxiv": "2609.12698",
  "author_total": 3,
  "authors": [
    {
      "name": "Jianshuo Gao"
    },
    {
      "name": "Xiao Yuan"
    },
    {
      "name": "Yuan Yao"
    }
  ],
  "bibtex": "https://research.draconitic.com/paper/5gfpzzzhc480b.bib",
  "cited_by": 0,
  "doi": "10.48550/arxiv.2609.12698",
  "fulltext_url": null,
  "id": "5gfpzzzhc480b",
  "issns": [],
  "landing_url": "https://arxiv.org/abs/2609.12698",
  "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": "W7212925011",
  "pdf_url": "https://arxiv.org/pdf/2609.12698",
  "pmcid": null,
  "pmid": null,
  "published": "2026-09-11",
  "publisher": null,
  "ris": "https://research.draconitic.com/paper/5gfpzzzhc480b.ris",
  "sources": [
    {
      "first_seen": "2026-10-30T12:21:07Z",
      "native_id": "2609.12698",
      "source": "arxiv",
      "url": "https://arxiv.org/abs/2609.12698"
    }
  ],
  "subjects": [
    {
      "field": "physics",
      "origin": "arxiv:quant-ph",
      "subfield": "quantum"
    }
  ],
  "title": "Extremely Low-Cost Magic State Preparation toward Fault-Tolerant Quantum Computing",
  "title_text": "Extremely Low-Cost Magic State Preparation toward Fault-Tolerant Quantum Computing",
  "type": "preprint",
  "updated_at": "2026-10-30T12:21:07Z",
  "url": "https://research.draconitic.com/paper/5gfpzzzhc480b",
  "venue": "arXiv",
  "versions": []
}