Normal-Form Characterization of Adaptivity and Entanglement in Pauli-Based Computation
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.
Related
- Verified Pauli-Product Measurement Compilation for Fault-Tolerant Quantum Computation
- Sharp universal death of entanglement threshold for Pauli Hamiltonians
- Computation of Turing bifurcation normal form for n-component reaction-diffusion systems
- Entanglement cost in non-local quantum computation
- Testing holographic computation of entanglement pseudo-entropy in dS3/ICFT2
BibTeX
@misc{peres2026normalform,
title = {{Normal-Form Characterization of Adaptivity and Entanglement in Pauli-Based Computation}},
author = {Filipa C. R. Peres and Selman Ipek and Daniel Lovsted and Joshua Nevin and Anne Broadbent},
howpublished = {arXiv},
year = {2026},
month = oct,
doi = {10.48550/arxiv.2610.30315},
eprint = {2610.30315},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2610.30315},
}
RIS
TY - UNPB
TI - Normal-Form Characterization of Adaptivity and Entanglement in Pauli-Based Computation
AU - Filipa C. R. Peres
AU - Selman Ipek
AU - Daniel Lovsted
AU - Joshua Nevin
AU - Anne Broadbent
PY - 2026
DA - 2026/10/21
PB - arXiv
DO - 10.48550/arxiv.2610.30315
UR - https://arxiv.org/abs/2610.30315
AB - 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.
ER -