The cost of Pauli propagation depends on the local basis in which the evolving operator is expanded. We show that its Pauli complexity splits into an occupation part, invariant under local rotations and bounded from below by the operator mass and length distributions, and a flavour part that a suitable basis can remove. We introduce frame-adaptive Pauli propagation (FAPP), which rotates the basis of every qubit, gate by gate, to the principal axes of the operator's local polarisation, exactly and within the memory structure of Pauli propagation. This simple rule achieves most of what the best local frame can, and the polarisation predicts how much any local frame can gain. In the Ising chain in transverse and longitudinal fields, FAPP lowers the truncation error at fixed memory by up to an order of magnitude and the memory by a size-independent factor of three; on the infinite two-dimensional lattice it needs up to seven times fewer strings for a given certified accuracy, and in Clifford circuits doped with T gates two to eight times fewer.
We extend the Pauli Propagation framework to imaginary-time evolution and introduce imaginary-time Pauli Propagation (ITPP), an operator-based algorithm for approximating thermal and ground-state properties directly in the Pauli basis. We derive explicit imaginary-time propagation rules for Pauli strings and analyze the main approximation errors arising from Trotterization and Pauli-space truncation, including bounds that account for the non-unitary nature of the evolution. Benchmarking ITPP on the one-dimensional transverse field Ising model, we find that the method performs best in the high-temperature regime, where thermal states admit a compressed Pauli-basis approximation, while the required number of Pauli terms grows rapidly as the system approaches the ground-state limit. We further compare with tensor network simulations and study finite-temperature scalability through the number of retained Pauli terms required to reach a fixed target accuracy. These results establish ITPP as a complementary framework for imaginary-time simulation and suggest that combining imaginary-time and real-time Pauli Propagation could provide a pathway toward simulating more general non-unitary and open quantum system dynamics within a unified Pauli-based framework.
Variational quantum algorithms utilize parameterized circuits many times during training, at new parameter values, over batches of data, and with gradients. Pauli propagation approximates the expectation values of such circuits classically by evolving the observable in the Heisenberg picture as a truncated sum of Pauli strings. We present PADO-Pauli, a GPU engine for Pauli propagation that compiles a circuit and its observables once into sparse matrices in which each rotation angle contributes only a cosine and a sine factor, so every later evaluation reuses the compiled program. It evaluates batches of parameters and data inputs embedded as rotation angles. By default its gradients come from a vector-Jacobian product registered with PyTorch's automatic differentiation, so they flow through the angles to any classical layer that produces them. PADO-Pauli also provides truncation by Pauli weight and coefficient size, and noise channels. Zero-filtering removes terms that do not contribute to an expectation value in the all-zero reference state and makes the batched forward pass about 1.5 times faster. Compared to cuPauliProp on an NVIDIA A100, PADO-Pauli evaluates up to 10 times faster on 4 to 12 qubits and uses up to 3.1 times less memory on 16 qubits. We check its accuracy against exact statevector simulation up to 28 qubits. These features make PADO-Pauli a practical toolkit for training variational quantum algorithms, including quantum machine learning models.
We introduce monoprop, an open-source, massively parallel operator-propagation framework for fermion and qubit bases. For
N qubits or modes, existing codes represent each of the
K tracked operator terms (Pauli strings or products of Majorana operators) as a
2N-bit string, testing each for anticommutation with the gate at
O(KN) cost per gate. Here, we introduce the anticommutation index which rapidly looks up the terms anticommuting with a gate. A local gate changes only the terms that touch its sites, and when terms are truncated to act on few sites, only a fraction
∼1/N touch any given qubit or mode, and we use this to prove the time per gate scales as
O(K/N). This counterintuitive result tells us that for a fixed number of terms, increasing the number of sites can make things faster. We demonstrate this numerically, and show monoprop scales almost ideally to 8192 cores, tracking
9.5×1010 terms. Beyond propagation, we present memory-efficient surrogate graphs, which record one propagation and replay it at new angles, for fast energy re-estimation and parameter gradients, and an efficient method for finding energy-minimising gates and optimal angles for simulating adaptive quantum-chemistry circuits.
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). 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.
We determine which representation sectors control the slowest convergence of random Pauli rotations and several local random quantum circuits. For
d=2n, the continuous Pauli walk has exact all-representation gaps
ΔSU(d)=8(d−1)d−8(n≥4),ΔPU(d)=8(d2−1)d(d−3)(n≥3). The special-unitary gap is attained in
⋀8Cd and is invisible to balanced moments, while the projective gap is already attained in a balanced fourth-moment representation. We obtain exact discrete and orthogonal Pauli analogues, exact finite-Clifford chain/path gaps, and dimension-independent all-representation Haar brickwork lower bounds; on three qubits every weighted Haar-
SU(4) edge walk reduces to one universal principal-angle constant. For real complete-graph models, the entire ordinary fourth-tensor gap reduces to a quadratic-size occupation operator, is simple for every
n≥4, and has an expansion beginning
Δn(4)=9n10−105n288+O(n−3), with competing branches separated only beyond all algebraic orders. For the two finite real Clifford complete-graph walks, this fourth-tensor mode is the exact all-representation group gap for every
n≥144; in the same range it simultaneously governs every ordinary even tensor degree
k≥4. Thus different representation scopes can have genuinely different slow modes.
We develop a backpropagation algorithm for evaluating parameter gradients in quantum circuits using Pauli propagation simulation. The method has computational complexity comparable to that of standard sparse Pauli simulation techniques, while producing gradients whose accuracy is of the same order as the corresponding observable expectation values. By exploiting the reversibility of quantum circuits, the algorithm reduces the memory cost by a factor of
O(nparam) compared with conventional reverse-mode automatic differentiation, where
nparam denotes the number of parameters in the circuit. Compared with finite difference methods, the algorithm is
O(nparam) more efficient in function evaluations. These features enable efficient and accurate classical optimization of quantum circuits for applications such as state preparation and time-evolution compression, while also allowing operator-complexity measures such as the operator stabilizer Rényi entropy to be monitored and regularized during optimization. We demonstrate the method by optimizing low-energy state-preparation circuits for transverse-field Ising models in one, two, and three dimensions and for the three-dimensional Heisenberg model, and by compressing two-dimensional time-evolution circuits.