Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2611.07545

Efficient Pauli Truncation from Operator Stabilizer Rényi Entropy

Haihui Wang, Yongming Li

Published Nov 5, 2026• 0 citations
arXivHTMLPDF

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 $α\geq1$ 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.

DOI
10.48550/arxiv.2611.07545

Related papers

Classical Simulability from Operator Entanglement Scaling

Neil Dowling

Local-operator entanglement (LOE) quantifies the nonlocal structure of Heisenberg operators and serves as a diagnostic of many-body chaos. We provide rigorous bounds showing when an operator can be well-approximated by a matrix-product operator (MPO), given asymptotic scaling of its LOE $α$-Rényi entropies. Specifically, we prove that a volume law scaling for $α\geq 1$ implies that the operator cannot be approximated efficiently as an MPO while faithfully reproducing all expectation values. On the other hand, if we restrict to correlations over a relevant sub-class of (ensembles of) states, then logarithmic scaling of the $α< 1$ entropies implies MPO simulability. This result covers a range of relevant quantities, including infinite temperature autocorrelation functions, out-of-time-ordered correlators, and average-case expectation values over ensembles of computational basis states. Beyond this regime, we provide numerical evidence together with a random matrix model to argue that this simulability result also typically holds for arbitrary states. Our results put on firm footing the heuristic expectation that a low operator entanglement implies efficient tensor network representability, extending celebrated foundational results from the theory of matrix-product states and providing a formal link between quantum chaos and classical simulability.

quant-pharXiv:2603.05656•Physical Review A•Mar 9, 2026•15 citations

Characterizing Pauli propagation via operator complexity

Yuguo Shao, Song Cheng, Zhengwei Liu

Pauli-propagation simulation represents observables in the Pauli basis and evolves their coefficients in the Heisenberg picture. In this work, we bridge operator complexity and the resource cost of Pauli-propagation methods by proving that the truncation error is governed by the Operator Stabilizer Rényi entropy (OSE) $${{{\mathcal{S}}}}^{\alpha }(O)$$. Our bounds quantify how OSE controls the compressibility of the evolving operator and give explicit prescriptions for the Top-K budget required to achieve a target accuracy. As an analytic test case, we prove that for the 1D Heisenberg model at Jz = 0, the number of non-zero Pauli coefficients generated from a local operator grows at most quadratically with the number of Trotter steps. We then benchmark the Top-K Pauli propagation on XXZ Heisenberg chains. The numerical results show high accuracy with a small truncation number K in the free regime (Jz = 0) and competitive performance against tensor-network methods, such as TDVP, in the interacting case (Jz = 0.5). These results position OSE as a resource measure for Pauli-propagation methods. Classical simulations of quantum dynamics are often limited by rapidly growing entanglement, motivating observable-based methods. Here, the authors show that operator stabilizer entropy gives a priori error bounds for Pauli propagation and determines the Pauli-term budget needed to reach a target accuracy.

arXiv:2510.22311•Communications Physics•Jul 27, 2026•11 citations

Amortized Stabilizer Rényi Entropy of Quantum Dynamics

Chengkai Zhu, Yu-Ao Chen, Zhiping Liu +3 more

Magic states are essential resources for fault-tolerant quantum computation. We introduce the amortized stabilizer Rényi entropy (SRE), which quantifies the largest SRE increase generated by a unitary, including arbitrary pure inputs and reference systems. Initial nonstabilizerness can enhance this increase, whereas analogous amortized logarithmic robustness and extent collapse to stabilizer-input optimizations. We establish structural properties and exact amortized 2-SRE values for the $T$ and $CCZ$ gates. We then derive explicit lower bounds on approximate $T$-state cost, with diamond-distance error, allowing stabilizer ancillary states, Pauli measurements, and classical feedforward. A Choi-state witness gives computable bounds for quantum Fourier transforms, controlled rotations, fractional controlled-SWAP gates, and finite Heisenberg-chain evolutions. We distinguish the unrestricted optimization from its Choi witness and specify the access and precision requirements for estimating Pauli moments. An odd-moment variant yields a confidence-qualified cost witness from ordinary copies.

quant-pharXiv:2409.06659•Sep 11, 2024•5 citations

Stabilizer Rényi Entropy Without a Phase Reference

Jinwei Chu, Savan Kharel

Stabilizer Rényi entropy quantifies magic relative to a complete Pauli frame. In settings such as helicity states of massless particles, unsynchronized qubit registers, energy eigenbases, and systems under superselection rules, the computational basis may be fixed while the transverse Pauli axes remain unspecified. The stabilizer Rényi entropy then depends on the choice of those axes. We define a phase-averaged stabilizer Rényi entropy by averaging the Pauli moments before taking the logarithm. It is exactly invariant under independent local rephasings. For pure states, it vanishes precisely when the state is a stabilizer state in every phase convention. For a broad class of sparse supports, it reduces to a closed-form function of the basis-state probabilities alone. Within this class, the ceiling for $n$ channels is $\ln[n^{3}/(6n-5)]$ for $n\geq3$ and $\ln\frac{7}{5}$ for two channels. We apply the invariant to tree-level gluon scattering at four and five points, where the helicity-basis phases are unspecified. It saturates the two- and three-channel ceilings: $\ln\frac{7}{5}$ at four points and $\ln\frac{27}{13}$ in $3\to2$ scattering. In same-helicity $2\to3$ scattering, it lies between a floor of $\ln\frac{8}{7}$ and a ceiling of $\ln\frac{184}{125}$, reached in the resolved soft limit and particular collinear limits, respectively. In every configuration studied, the invariant is independent of the fixed external colors.

quant-pharXiv:2610.18955•Oct 15, 2026

Spectral geometry of nonlocal stabilizer entropy

Piotr Sierant

Magic, or nonstabilizerness, is the resource that promotes stabilizer operations to universal quantum computation. For bipartite pure states, its component intrinsic to the correlations between the subsystems, the nonlocal magic, is obtained by minimizing a magic measure over local unitaries. For the stabilizer Rényi entropy (SRE), the minimum is conjectured to be attained by the computational-basis (CB) representative, the state obtained by assigning the Schmidt coefficients in decreasing order to matching computational-basis labels. We prove this conjecture for two families of states at every system size and bipartition: states with dyadic-staircase Schmidt spectra and states of Schmidt rank at most six. For arbitrary bipartite pure states, we show that the CB value exceeds the nonlocal SRE by at most $4$, fixing the leading term of any divergent scaling of nonlocal SRE. We further show that the nonlocal SRE grows at most logarithmically with the entanglement entropy. Consequently, one-dimensional area-law states have bounded nonlocal SRE, while critical states with logarithmic entanglement entropy permit at most doubly logarithmic growth with system size. We apply these results to the transverse-field Ising chain, where we tightly bound the nonlocal SRE in the gapped phases and identify its double-logarithmic growth at criticality.

quant-pharXiv:2609.13106•Sep 14, 2026•8 citations

Universal Non-stabilizerness Dynamics Across Quantum Phase Transitions

András Grabarits, Adolfo del Campo

Quantum magic, or non-stabilizerness, is an important quantum resource that characterizes computational power beyond classically simulable Clifford operations and is therefore essential for achieving quantum advantage. While previous studies have explored non-stabilizerness dynamics in random circuits and under time-independent generators, here we extend the study of its universal dynamics to time-dependent driving across quantum phase transitions. In particular, we show that the stabilizer Rényi entropies and the cumulants of the Pauli spectrum exhibit universal power-law scaling with the driving rate in slow processes. Moreover, we show that the logarithmic Pauli spectrum is asymptotically Gaussian, implying a lognormal distribution for the Pauli spectrum values. Our results are explicitly demonstrated by exact results in the transverse-field Ising model and by analytical approximations in long-range Kitaev models.

quant-pharXiv:2603.08841•Mar 11, 2026•3 citations
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α\geq1α≥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/20<α<1/20<α<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<α<10<α<10<α<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<α<10<α<10<α<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.
Local-operator entanglement (LOE) quantifies the nonlocal structure of Heisenberg operators and serves as a diagnostic of many-body chaos. We provide rigorous bounds showing when an operator can be well-approximated by a matrix-product operator (MPO), given asymptotic scaling of its LOE ααα-Rényi entropies. Specifically, we prove that a volume law scaling for α≥1α\geq 1α≥1 implies that the operator cannot be approximated efficiently as an MPO while faithfully reproducing all expectation values. On the other hand, if we restrict to correlations over a relevant sub-class of (ensembles of) states, then logarithmic scaling of the α<1α< 1α<1 entropies implies MPO simulability. This result covers a range of relevant quantities, including infinite temperature autocorrelation functions, out-of-time-ordered correlators, and average-case expectation values over ensembles of computational basis states. Beyond this regime, we provide numerical evidence together with a random matrix model to argue that this simulability result also typically holds for arbitrary states. Our results put on firm footing the heuristic expectation that a low operator entanglement implies efficient tensor network representability, extending celebrated foundational results from the theory of matrix-product states and providing a formal link between quantum chaos and classical simulability.
Pauli-propagation simulation represents observables in the Pauli basis and evolves their coefficients in the Heisenberg picture. In this work, we bridge operator complexity and the resource cost of Pauli-propagation methods by proving that the truncation error is governed by the Operator Stabilizer Rényi entropy (OSE) Sα(O){{{\mathcal{S}}}}^{\alpha }(O)Sα(O). Our bounds quantify how OSE controls the compressibility of the evolving operator and give explicit prescriptions for the Top-K budget required to achieve a target accuracy. As an analytic test case, we prove that for the 1D Heisenberg model at Jz = 0, the number of non-zero Pauli coefficients generated from a local operator grows at most quadratically with the number of Trotter steps. We then benchmark the Top-K Pauli propagation on XXZ Heisenberg chains. The numerical results show high accuracy with a small truncation number K in the free regime (Jz = 0) and competitive performance against tensor-network methods, such as TDVP, in the interacting case (Jz = 0.5). These results position OSE as a resource measure for Pauli-propagation methods. Classical simulations of quantum dynamics are often limited by rapidly growing entanglement, motivating observable-based methods. Here, the authors show that operator stabilizer entropy gives a priori error bounds for Pauli propagation and determines the Pauli-term budget needed to reach a target accuracy.
Magic states are essential resources for fault-tolerant quantum computation. We introduce the amortized stabilizer Rényi entropy (SRE), which quantifies the largest SRE increase generated by a unitary, including arbitrary pure inputs and reference systems. Initial nonstabilizerness can enhance this increase, whereas analogous amortized logarithmic robustness and extent collapse to stabilizer-input optimizations. We establish structural properties and exact amortized 2-SRE values for the TTT and CCZCCZCCZ gates. We then derive explicit lower bounds on approximate TTT-state cost, with diamond-distance error, allowing stabilizer ancillary states, Pauli measurements, and classical feedforward. A Choi-state witness gives computable bounds for quantum Fourier transforms, controlled rotations, fractional controlled-SWAP gates, and finite Heisenberg-chain evolutions. We distinguish the unrestricted optimization from its Choi witness and specify the access and precision requirements for estimating Pauli moments. An odd-moment variant yields a confidence-qualified cost witness from ordinary copies.
Stabilizer Rényi entropy quantifies magic relative to a complete Pauli frame. In settings such as helicity states of massless particles, unsynchronized qubit registers, energy eigenbases, and systems under superselection rules, the computational basis may be fixed while the transverse Pauli axes remain unspecified. The stabilizer Rényi entropy then depends on the choice of those axes. We define a phase-averaged stabilizer Rényi entropy by averaging the Pauli moments before taking the logarithm. It is exactly invariant under independent local rephasings. For pure states, it vanishes precisely when the state is a stabilizer state in every phase convention. For a broad class of sparse supports, it reduces to a closed-form function of the basis-state probabilities alone. Within this class, the ceiling for nnn channels is ln⁡[n3/(6n−5)]\ln[n^{3}/(6n-5)]ln[n3/(6n−5)] for n≥3n\geq3n≥3 and ln⁡75\ln\frac{7}{5}ln57​ for two channels. We apply the invariant to tree-level gluon scattering at four and five points, where the helicity-basis phases are unspecified. It saturates the two- and three-channel ceilings: ln⁡75\ln\frac{7}{5}ln57​ at four points and ln⁡2713\ln\frac{27}{13}ln1327​ in 3→23\to23→2 scattering. In same-helicity 2→32\to32→3 scattering, it lies between a floor of ln⁡87\ln\frac{8}{7}ln78​ and a ceiling of ln⁡184125\ln\frac{184}{125}ln125184​, reached in the resolved soft limit and particular collinear limits, respectively. In every configuration studied, the invariant is independent of the fixed external colors.
Magic, or nonstabilizerness, is the resource that promotes stabilizer operations to universal quantum computation. For bipartite pure states, its component intrinsic to the correlations between the subsystems, the nonlocal magic, is obtained by minimizing a magic measure over local unitaries. For the stabilizer Rényi entropy (SRE), the minimum is conjectured to be attained by the computational-basis (CB) representative, the state obtained by assigning the Schmidt coefficients in decreasing order to matching computational-basis labels. We prove this conjecture for two families of states at every system size and bipartition: states with dyadic-staircase Schmidt spectra and states of Schmidt rank at most six. For arbitrary bipartite pure states, we show that the CB value exceeds the nonlocal SRE by at most 444, fixing the leading term of any divergent scaling of nonlocal SRE. We further show that the nonlocal SRE grows at most logarithmically with the entanglement entropy. Consequently, one-dimensional area-law states have bounded nonlocal SRE, while critical states with logarithmic entanglement entropy permit at most doubly logarithmic growth with system size. We apply these results to the transverse-field Ising chain, where we tightly bound the nonlocal SRE in the gapped phases and identify its double-logarithmic growth at criticality.
Quantum magic, or non-stabilizerness, is an important quantum resource that characterizes computational power beyond classically simulable Clifford operations and is therefore essential for achieving quantum advantage. While previous studies have explored non-stabilizerness dynamics in random circuits and under time-independent generators, here we extend the study of its universal dynamics to time-dependent driving across quantum phase transitions. In particular, we show that the stabilizer Rényi entropies and the cumulants of the Pauli spectrum exhibit universal power-law scaling with the driving rate in slow processes. Moreover, we show that the logarithmic Pauli spectrum is asymptotically Gaussian, implying a lognormal distribution for the Pauli spectrum values. Our results are explicitly demonstrated by exact results in the transverse-field Ising model and by analytical approximations in long-range Kitaev models.