{
  "abstract": "Pauli-based computation (PBC) is a measurement-based model of quantum computation that samples from output distributions of universal Clifford+$T$ circuits. Here, we provide a normal form (NF) that completely characterizes its adaptive and entanglement structures. These insights unify PBC with one-way quantum computing as dual or `time-reversed' counterparts. We use the NF to advance strategies for distributed computation and investigate magic-state injection rates. We also demonstrate an exponential improvement in the detection of unnecessary magic-state qubits, allowing their efficient removal. Our NF further enables ahead-of-time circuit compilation using PBC, reducing CNOT gate count and quantum memory of random quantum circuits on average by 50% and 40%, respectively, beating other state-of-the-art compilers.",
  "abstract_shown": true,
  "affiliations": [],
  "article_type": null,
  "arxiv": "2610.30315",
  "author_total": 5,
  "authors": [
    {
      "name": "Filipa C. R. Peres"
    },
    {
      "name": "Selman Ipek"
    },
    {
      "name": "Daniel Lovsted"
    },
    {
      "name": "Joshua Nevin"
    },
    {
      "name": "Anne Broadbent"
    }
  ],
  "bibtex": "https://research.draconitic.com/paper/8aqfr76jmv3qc.bib",
  "cited_by": 0,
  "doi": "10.48550/arxiv.2610.30315",
  "fulltext_url": null,
  "id": "8aqfr76jmv3qc",
  "issns": [],
  "landing_url": "https://arxiv.org/abs/2610.30315",
  "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": "W7223269411",
  "pdf_url": "https://arxiv.org/pdf/2610.30315",
  "pmcid": null,
  "pmid": null,
  "published": "2026-10-21",
  "publisher": null,
  "ris": "https://research.draconitic.com/paper/8aqfr76jmv3qc.ris",
  "sources": [
    {
      "first_seen": "2026-10-30T12:34:34Z",
      "native_id": "2610.30315",
      "source": "arxiv",
      "url": "https://arxiv.org/abs/2610.30315"
    }
  ],
  "subjects": [
    {
      "field": "physics",
      "origin": "arxiv:quant-ph",
      "subfield": "quantum"
    }
  ],
  "title": "Normal-Form Characterization of Adaptivity and Entanglement in Pauli-Based Computation",
  "title_text": "Normal-Form Characterization of Adaptivity and Entanglement in Pauli-Based Computation",
  "type": "preprint",
  "updated_at": "2026-10-30T12:34:34Z",
  "url": "https://research.draconitic.com/paper/8aqfr76jmv3qc",
  "venue": "arXiv",
  "versions": []
}