{
  "abstract": "Quantum low-density parity-check (QLDPC) codes are promising candidates for practical low-overhead quantum memories. For large-scale fault-tolerant quantum computation, we further need logical processing methods for QLDPC codes. In this work, we construct full extractors---surgery systems capable of measuring arbitrary logical Pauli operators on a code block---for several hypergraph product (HGP) codes. These extractors enable logical processing via Pauli-based computation (PBC) without the compilation overhead observed in prior works. Moreover, our extractors have sizes between $47\\%$ and $80\\%$ of the base HGP codes, and the extractor-augmented codes can be supported on fixed-connectivity hardware with maximum qubit degree ten. Our approach involves assembling many partial extractors with verifiable fault tolerance into a single full extractor. For a distance $10$ HGP code, circuit-level noise simulations yield logical measurement error rates of approximately $10^{-6}$ at a physical error rate of $0.1\\%$. These results demonstrate that extractor architectures, when designed in the fixed-connectivity setting, can achieve the space efficiency of QLDPC codes without introducing compilation overhead compared to surface-code PBC architectures.",
  "abstract_shown": true,
  "affiliations": [],
  "article_type": null,
  "arxiv": "2606.03507",
  "author_total": 4,
  "authors": [
    {
      "name": "John Blue"
    },
    {
      "name": "Zhiyang He"
    },
    {
      "name": "Hengyun Zhou"
    },
    {
      "name": "Isaac L. Chuang"
    }
  ],
  "bibtex": "https://research.draconitic.com/paper/epnmya0ahnvq0.bib",
  "cited_by": 0,
  "doi": "10.48550/arxiv.2606.03507",
  "fulltext_url": null,
  "id": "epnmya0ahnvq0",
  "issns": [],
  "landing_url": "https://arxiv.org/abs/2606.03507",
  "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": "W7163335244",
  "pdf_url": "https://arxiv.org/pdf/2606.03507",
  "pmcid": null,
  "pmid": null,
  "published": "2026-08-30",
  "publisher": null,
  "ris": "https://research.draconitic.com/paper/epnmya0ahnvq0.ris",
  "sources": [
    {
      "first_seen": "2026-10-30T12:17:41Z",
      "native_id": "2606.03507",
      "source": "arxiv",
      "url": "https://arxiv.org/abs/2606.03507"
    }
  ],
  "subjects": [
    {
      "field": "physics",
      "origin": "arxiv:quant-ph",
      "subfield": "quantum"
    }
  ],
  "title": "Full Extractors for Logical Processing in Hypergraph Product Codes",
  "title_text": "Full Extractors for Logical Processing in Hypergraph Product Codes",
  "type": "preprint",
  "updated_at": "2026-10-30T12:17:41Z",
  "url": "https://research.draconitic.com/paper/epnmya0ahnvq0",
  "venue": "arXiv",
  "versions": []
}