Skip to content
DraconiticResearch
Search Sources API
197,785 studies31 sourcesUpdated 20 min ago
PreprintarXiv licencearXiv

Efficient Pauli Truncation from Operator Stabilizer Rényi Entropy

Abstract

Operator stabilizer Rényi entropy (OSE) quantifies the magic of Heisenberg operators and serves as a diagnostic of their compressibility in the Pauli basis. We establish rigorous bounds showing when an operator can be efficiently approximated by Pauli truncation in terms of the scaling of its OSE. Specifically, we prove that volume-law scaling of OSE for α≥1 prevents efficient Pauli truncation from reproducing expectation values for all states at sufficiently small fixed error. On the other hand, logarithmic growth of OSE for 0<α<1/2 guarantees efficient Pauli truncation approximability uniformly over all states. A counterexample shows that this sufficient range cannot be extended on the basis of OSE scaling alone. If we restrict to correlations over suitable low-average state ensembles, then the sufficient range extends to 0<α<1. We further derive cumulative error bounds for iterative Pauli propagation and approximation guarantees for fixed-order out-of-time-ordered correlators. Moreover, under an independent-sign assumption, we show that logarithmic OSE for 0<α<1 guarantees efficient Pauli truncation with the prescribed accuracy for all input states with high probability. Our results provide a theoretical framework for understanding when operator magic constrains or enables efficient Pauli truncation and for guiding the development of classical simulation methods.

Related

  1. Bounding Fidelity of Non-Stabilizer States from Local Pauli Measurements
    Yi Li, Otfried Gühne, Qiongyi He
    arXivPreprintarXiv licenceFull textQuantum physics & quantum informationarXiv
  2. Majorana-Pauli stabilizer codes and duality webs of fermionic topological phases
    Meng Sun, Zongyuan Wang, Nathanan Tantivasadakarn +1
    arXivPreprintarXiv licenceFull textMathematical physicsCondensed matterarXiv
  3. Rényi Multi-entropy for Stabilizer States: A Finite Field Gauss Sum Problem
    Bartlomiej Czech, Yichen Feng, Jonathan Harper +2
    arXivPreprintarXiv licenceFull textHigh-energy & particle physicsarXiv
  4. Fast and exact approach for stabilizer Rényi entropy via the XOR-FWHT algorithm
    Xuyang Huang, Han-Ze Li, Ching Hua Lee +1
    Physical Review ResearchPeer-reviewedCC BY 4.0Atomic, molecular & optical physicsCrossref
  5. Efficient quantum Gibbs sampling of stabilizer codes using hybrid computation
    Ivan Shum, Ángela Capel
    New Journal of PhysicsPeer-reviewedCC BY 4.0Full textAtomic, molecular & optical physicsCrossref
BibTeX
@misc{wang2026efficient,
  title = {{Efficient Pauli Truncation from Operator Stabilizer Rényi Entropy}},
  author = {Haihui Wang and Yongming Li},
  howpublished = {arXiv},
  year = {2026},
  month = nov,
  doi = {10.48550/arxiv.2611.07545},
  eprint = {2611.07545},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2611.07545},
}
RIS
TY  - UNPB
TI  - Efficient Pauli Truncation from Operator Stabilizer Rényi Entropy
AU  - Haihui Wang
AU  - Yongming Li
PY  - 2026
DA  - 2026/11/05
PB  - arXiv
DO  - 10.48550/arxiv.2611.07545
UR  - https://arxiv.org/abs/2611.07545
AB  - Operator stabilizer Rényi entropy (OSE) quantifies the magic of Heisenberg operators and serves as a diagnostic of their compressibility in the Pauli basis. We establish rigorous bounds showing when an operator can be efficiently approximated by Pauli truncation in terms of the scaling of its OSE. Specifically, we prove that volume-law scaling of OSE for α≥1 prevents efficient Pauli truncation from reproducing expectation values for all states at sufficiently small fixed error. On the other hand, logarithmic growth of OSE for 0<α<1/2 guarantees efficient Pauli truncation approximability uniformly over all states. A counterexample shows that this sufficient range cannot be extended on the basis of OSE scaling alone. If we restrict to correlations over suitable low-average state ensembles, then the sufficient range extends to 0<α<1. We further derive cumulative error bounds for iterative Pauli propagation and approximation guarantees for fixed-order out-of-time-ordered correlators. Moreover, under an independent-sign assumption, we show that logarithmic OSE for 0<α<1 guarantees efficient Pauli truncation with the prescribed accuracy for all input states with high probability. Our results provide a theoretical framework for understanding when operator magic constrains or enables efficient Pauli truncation and for guiding the development of classical simulation methods.
ER  -