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:2610.26222

A Readout-Aware Theory of Approximate Heisenberg Propagation

Yubraj Bhandari, Jakob S. Kottmann, Adelina Bärligea

quant-phmath-phSubmitted Oct 19, 2026• Announced Oct 20, 2026• 0 citations
arXivHTMLPDF

Abstract

Classical methods for computing quantum expectation values often propagate observables in the Heisenberg picture. To remain tractable, these methods rely on approximations that discard operator components during evolution. Yet the magnitude of these components alone does not determine the resulting expectation-value error, which also depends on their subsequent evolution and the input state. We develop \emph{generalized Pauli propagation}, a common algebraic framework encompassing Pauli propagation, Lie-algebraic simulation, and Krylov subspace methods. Using weighted commutator graphs, we derive exact identities that relate approximation errors to the signed contributions of omitted and discarded operator components. Our central result establishes \emph{delayed observability}, identifying conditions under which these contributions vanish at low orders in propagation time. We use this structure to develop finite-order error estimates and state-dependent selection rules. We further prove that retaining the symmetry-preserving part of a weak perturbation eliminates first-order expectation-value errors under suitable symmetry conditions. By revealing how approximation errors affect the desired expectation value, our framework provides a basis for more informative error analysis and the development of readout-aware simulation strategies.

AI Summary

Approximate Heisenberg propagation discards operator components, but their norms alone do not determine the error in a chosen expectation value. This paper formulates Pauli, Lie-algebraic, symmetry-adapted, and fixed-generator Krylov propagation as the bilinear transfer problem $w^\top e^{tA}s$, with a weighted commutator graph connecting observable coefficients to state-dependent readout coordinates. Exact continuous and discrete defect-transfer identities express expectation-value errors as signed contributions from initially omitted components and residuals generated during approximate evolution. The central delayed-observability theorem assumes that positive-grade operators have zero input-state expectation and each commutator lowers grade by at most $\delta$. A defect of minimum grade $g$ then satisfies $r^\top A^m s=0$ for $m<\lceil g/\delta\rceil$. This follows by bounding grade changes along graph walks. Weight-space selection rules extend the construction to Cartan-diagonal and generalized coherent-state inputs. Truncated transfer expansions provide signed error estimates with exponential-series remainder bounds. A separate perturbative result gives $O(\varepsilon^2)$ readout error when source and readout lie in an unperturbed invariant sector and the approximation retains the within-sector perturbation. Small-system numerics test these statements. In a six-qubit Ising circuit, eight additional transfer orders reduce estimation discrepancy to approximately $2.1\times10^{-12}$ for an actual truncation error of $4.2\times10^{-5}$. However, deeper random circuits yield median relative estimation error above one. Including estimator cost, correction beats tested uncorrected alternatives at comparable generated work in only about 21% of Ising and 15% of circuit comparisons. Delayed observability alone guarantees neither efficient propagation nor accurate fixed-order estimates.

Little sign of AI-generated textIncrementalUnclear noveltyMissing comparison

Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.

Comments
14 pages main text, 13 pages appendices, 6 figures, 1 table

Related papers

State-adapted generalized mean-field projections for Pauli propagation of Heisenberg dynamics

Federico Tomás B. Pérez, Gabriela Wójtowicz, Martin B. Plenio

The Heisenberg picture can make quantum many-body simulation efficient when evolved observables admit compact operator representation within low-dimensional structures. Conventional Pauli-string propagation and truncation techniques exploit this structure, but in coherent Hamiltonian dynamics their error control is often heuristic and their stability can be poor. We introduce a state-adapted Krylov framework based on geometric generalized mean-field projections of many-body observables onto low-body operator subspaces. The resulting dynamics approximate expectation values, do not extend spatial support beyond that prescribed by Lieb-Robinson bounds, and compress high-body correlations onto their state-relevant low-body representatives rather than simply discarding them. We derive necessary operator-entanglement obstructions to low-body representation and conditional sufficient bounds on representation and dynamical errors involving nonstabilizerness and controlled high-body tails. Numerical benchmarks show improved, stable finite-$m$ hierarchies and simulations on large three-dimensional lattices, establishing a scalable state-adapted alternative to conventional Heisenberg-picture weight-truncation of Pauli strings.

quant-pharXiv:2609.12840•Sep 14, 2026•3 citations

Generalized $m$-body mean-field projections for classical simulation of $d$-dimensional Heisenberg-picture dynamics

Federico Tomás B. Pérez, Gabriela Wójtowicz, Matthias Kost +1 more

Classical simulation of quantum many-body dynamics is challenged by the rapid growth of operator complexity, particularly in higher dimensions where tensor-network methods become increasingly demanding. We develop state-adapted Pauli-weight propagation based on generalized $m$-body mean-field projections, which compress many-body observables into optimal low-body representations in a covariance geometry induced by the initial state. Combined with adaptive Krylov-like restricted Heisenberg dynamics, this provides an alternative to conventional Hilbert--Schmidt Pauli-weight truncation. We derive necessary and conditional sufficient bounds on low-body approximation accuracy using standard operator complexity measures and characterize possible dynamical failure mechanisms of the state-adapted method. Numerical benchmarks demonstrate substantial state-dependent accuracy gains, while identifying regimes of reduced accuracy or violations of Pauli spectral bounds. For a three-dimensional system of $80$ interacting spins, our method achieves strong body-order convergence, close agreement with independently converging tensor-network simulations, and substantially smaller sparse Pauli representations. These results establish state-adapted Pauli propagation as a promising approach to classical simulation of higher-dimensional coherent many-body dynamics.

quant-pharXiv:2610.22069•Oct 16, 2026•0 citations

Quantum Enhanced Pauli Propagation

S. Majumder, J. R. Garrison, L. Luo +8 more

Accurately estimating observables on noisy quantum devices remains a central challenge for near-term quantum algorithms. While quantum error mitigation techniques can reduce noise-induced bias, they often rely on unverifiable assumptions about the circuit noise, and cannot guarantee the magnitude of residual bias error. Here, rather than using classical resources to mitigate a noisy quantum circuit execution, we propose a hybrid algorithm that uses quantum resources to improve the accuracy of approximate classical Pauli-path simulation. Our protocol, Quantum Enhanced Pauli Propagation (QuEPP), uses Clifford perturbation theory (CPT) to construct a classically simulable ensemble of Clifford circuits from the low-order terms in CPT, which directly provide the approximate classical Pauli-path simulation of the target circuit. Noisy quantum expectation values of this ensemble are then used to infer a global rescaling factor that corrects quantum execution of the target circuit, providing higher-order contributions absent from the truncated low-order classical simulation. This approach requires no noise characterization, applies to arbitrary circuits, and provides a provable route to asymptotically unbiased estimates. Using IBM Heron hardware, we demonstrate QuEPP on 2D random mirror circuits of up to 49 qubits and circuit depth 80, as well as Trotterized Hamiltonian evolution, showing consistent improvements beyond classical CPT and unmitigated quantum results. QuEPP offers a simple, scalable, and model-free framework for enabling accurate quantum computation in the pre-fault-tolerant era.

quant-pharXiv:2603.14485•Mar 17, 2026•5 citations

Computing noise-canceling observables via Pauli propagation

Andrew Eddins, Caleb Johnson, Alberto Baiardi +8 more

The pursuit of quantum advantage is driving the co-evolution of quantum processors and classical simulation methods. Despite advances in scale and quality, the accuracy of quantum simulation is ultimately limited by error rates and sampling overheads. Similarly, while classical simulation methods such as Pauli propagation have made remarkable progress, their accuracy is ultimately limited by the exponential growth of operator paths and the truncations needed to control memory and runtime. Here we show that these complementary limitations can be mitigated by embedding Pauli propagation within a hybrid error-mitigation framework that reduces quantum sampling overhead while achieving lower truncation errors with fewer classical resources than traditional Pauli propagation alone. In this framework, a target observable is classically propagated through noise-canceling inverse channels, producing a modified observable that is measured directly on a quantum processor. We prototype two implementations and benchmark their performance numerically on canonical models that challenge traditional Pauli propagation. We also perform experiments on a quantum processor using 56 superconducting qubits, revealing the tradeoffs of their respective truncation strategies. These results illustrate how classical and quantum resources can be orchestrated to extend observable estimation beyond the limits of either approach alone, providing a foundation for quantum-centric supercomputing and future demonstrations of quantum advantage.

quant-pharXiv:2606.20441•Jun 19, 2026•4 citations

A High-Performance Pauli-Algebra Framework for Large-Scale Quantum Simulations

Xiaopeng Li, Zhijie Sun, Yi Fan +3 more

Efficient manipulation of Pauli-algebraic objects is a key bottleneck in the classical emulation and benchmarking of quantum algorithms for chemistry and many-body physics. This bottleneck appears in Hamiltonian construction, variational ansatz preparation, expectation-value and gradient evaluation, and real-time propagation, all of which require repeated Pauli-algebra operations. Here, we present a high-performance Pauli-algebra framework tailored to quantum many-body and quantum-chemical simulations. The framework combines compact binary symplectic encoding, canonical coefficient reduction, and grouped sparse operator representations that exploit shared bit-flip patterns among Pauli strings. The resulting Julia/C\texttt{++} implementation accelerates Pauli multiplication, Hamiltonian construction, and operator--state multiplication in sparse and symmetry-adapted many-electron spaces. Benchmarks demonstrate efficient Hamiltonian construction, large-active-space VQE and ADAPT-VQE calculations, and real-time variational dynamics on modern multicore CPU and GPU architectures. These results show that structure-aware Pauli-algebra engines provide a scalable classical backend for developing and benchmarking quantum algorithms in quantum chemistry and many-body simulation.

quant-pharXiv:2606.28952•Jun 30, 2026•1 citation

Observable-targeted variational quantum simulation of Hamiltonian dynamics

Leonardo Zambrano, Luciano Pereira, Antonio Acín

Standard variational quantum simulation seeks to reproduce the evolution of the full quantum state, although many applications require only the expectation values of a few observables. We study a variational method for pure-state Hamiltonian dynamics that updates circuit parameters to reproduce the evolution of selected expectation values. An exact error identity guides the choice of observables, motivating a construction based on repeated commutators of the target with the Hamiltonian. For Pauli observables and Pauli-rotation circuits, the update can be estimated without ancillary qubits or controlled operations for overlap estimation. Across six- and ten-qubit spin, fermionic, and molecular benchmarks, the observable-targeted update extends the median time within the target-error tolerance compared with standard variational quantum simulation with equal shot budgets. These results show that directing the variational update toward the target observable can extend accurate simulation without increasing the measurement cost per time step.

quant-pharXiv:2609.24794•Sep 22, 2026•0 citations
Classical methods for computing quantum expectation values often propagate observables in the Heisenberg picture. To remain tractable, these methods rely on approximations that discard operator components during evolution. Yet the magnitude of these components alone does not determine the resulting expectation-value error, which also depends on their subsequent evolution and the input state. We develop \emph{generalized Pauli propagation}, a common algebraic framework encompassing Pauli propagation, Lie-algebraic simulation, and Krylov subspace methods. Using weighted commutator graphs, we derive exact identities that relate approximation errors to the signed contributions of omitted and discarded operator components. Our central result establishes \emph{delayed observability}, identifying conditions under which these contributions vanish at low orders in propagation time. We use this structure to develop finite-order error estimates and state-dependent selection rules. We further prove that retaining the symmetry-preserving part of a weak perturbation eliminates first-order expectation-value errors under suitable symmetry conditions. By revealing how approximation errors affect the desired expectation value, our framework provides a basis for more informative error analysis and the development of readout-aware simulation strategies.
Approximate Heisenberg propagation discards operator components, but their norms alone do not determine the error in a chosen expectation value. This paper formulates Pauli, Lie-algebraic, symmetry-adapted, and fixed-generator Krylov propagation as the bilinear transfer problem w⊤etAsw^\top e^{tA}sw⊤etAs, with a weighted commutator graph connecting observable coefficients to state-dependent readout coordinates.
Exact continuous and discrete defect-transfer identities express expectation-value errors as signed contributions from initially omitted components and residuals generated during approximate evolution. The central delayed-observability theorem assumes that positive-grade operators have zero input-state expectation and each commutator lowers grade by at most δ\deltaδ. A defect of minimum grade ggg then satisfies r⊤Ams=0r^\top A^m s=0r⊤Ams=0 for m<⌈g/δ⌉m<\lceil g/\delta\rceilm<⌈g/δ⌉. This follows by bounding grade changes along graph walks. Weight-space selection rules extend the construction to Cartan-diagonal and generalized coherent-state inputs. Truncated transfer expansions provide signed error estimates with exponential-series remainder bounds. A separate perturbative result gives O(ε2)O(\varepsilon^2)O(ε2) readout error when source and readout lie in an unperturbed invariant sector and the approximation retains the within-sector perturbation.
Small-system numerics test these statements. In a six-qubit Ising circuit, eight additional transfer orders reduce estimation discrepancy to approximately 2.1×10−122.1\times10^{-12}2.1×10−12 for an actual truncation error of 4.2×10−54.2\times10^{-5}4.2×10−5. However, deeper random circuits yield median relative estimation error above one. Including estimator cost, correction beats tested uncorrected alternatives at comparable generated work in only about 21% of Ising and 15% of circuit comparisons. Delayed observability alone guarantees neither efficient propagation nor accurate fixed-order estimates.
The Heisenberg picture can make quantum many-body simulation efficient when evolved observables admit compact operator representation within low-dimensional structures. Conventional Pauli-string propagation and truncation techniques exploit this structure, but in coherent Hamiltonian dynamics their error control is often heuristic and their stability can be poor. We introduce a state-adapted Krylov framework based on geometric generalized mean-field projections of many-body observables onto low-body operator subspaces. The resulting dynamics approximate expectation values, do not extend spatial support beyond that prescribed by Lieb-Robinson bounds, and compress high-body correlations onto their state-relevant low-body representatives rather than simply discarding them. We derive necessary operator-entanglement obstructions to low-body representation and conditional sufficient bounds on representation and dynamical errors involving nonstabilizerness and controlled high-body tails. Numerical benchmarks show improved, stable finite-mmm hierarchies and simulations on large three-dimensional lattices, establishing a scalable state-adapted alternative to conventional Heisenberg-picture weight-truncation of Pauli strings.
Generalized mmm-body mean-field projections for classical simulation of ddd-dimensional Heisenberg-picture dynamics
Classical simulation of quantum many-body dynamics is challenged by the rapid growth of operator complexity, particularly in higher dimensions where tensor-network methods become increasingly demanding. We develop state-adapted Pauli-weight propagation based on generalized mmm-body mean-field projections, which compress many-body observables into optimal low-body representations in a covariance geometry induced by the initial state. Combined with adaptive Krylov-like restricted Heisenberg dynamics, this provides an alternative to conventional Hilbert--Schmidt Pauli-weight truncation. We derive necessary and conditional sufficient bounds on low-body approximation accuracy using standard operator complexity measures and characterize possible dynamical failure mechanisms of the state-adapted method. Numerical benchmarks demonstrate substantial state-dependent accuracy gains, while identifying regimes of reduced accuracy or violations of Pauli spectral bounds. For a three-dimensional system of 808080 interacting spins, our method achieves strong body-order convergence, close agreement with independently converging tensor-network simulations, and substantially smaller sparse Pauli representations. These results establish state-adapted Pauli propagation as a promising approach to classical simulation of higher-dimensional coherent many-body dynamics.
Accurately estimating observables on noisy quantum devices remains a central challenge for near-term quantum algorithms. While quantum error mitigation techniques can reduce noise-induced bias, they often rely on unverifiable assumptions about the circuit noise, and cannot guarantee the magnitude of residual bias error. Here, rather than using classical resources to mitigate a noisy quantum circuit execution, we propose a hybrid algorithm that uses quantum resources to improve the accuracy of approximate classical Pauli-path simulation. Our protocol, Quantum Enhanced Pauli Propagation (QuEPP), uses Clifford perturbation theory (CPT) to construct a classically simulable ensemble of Clifford circuits from the low-order terms in CPT, which directly provide the approximate classical Pauli-path simulation of the target circuit. Noisy quantum expectation values of this ensemble are then used to infer a global rescaling factor that corrects quantum execution of the target circuit, providing higher-order contributions absent from the truncated low-order classical simulation. This approach requires no noise characterization, applies to arbitrary circuits, and provides a provable route to asymptotically unbiased estimates. Using IBM Heron hardware, we demonstrate QuEPP on 2D random mirror circuits of up to 49 qubits and circuit depth 80, as well as Trotterized Hamiltonian evolution, showing consistent improvements beyond classical CPT and unmitigated quantum results. QuEPP offers a simple, scalable, and model-free framework for enabling accurate quantum computation in the pre-fault-tolerant era.
The pursuit of quantum advantage is driving the co-evolution of quantum processors and classical simulation methods. Despite advances in scale and quality, the accuracy of quantum simulation is ultimately limited by error rates and sampling overheads. Similarly, while classical simulation methods such as Pauli propagation have made remarkable progress, their accuracy is ultimately limited by the exponential growth of operator paths and the truncations needed to control memory and runtime. Here we show that these complementary limitations can be mitigated by embedding Pauli propagation within a hybrid error-mitigation framework that reduces quantum sampling overhead while achieving lower truncation errors with fewer classical resources than traditional Pauli propagation alone. In this framework, a target observable is classically propagated through noise-canceling inverse channels, producing a modified observable that is measured directly on a quantum processor. We prototype two implementations and benchmark their performance numerically on canonical models that challenge traditional Pauli propagation. We also perform experiments on a quantum processor using 56 superconducting qubits, revealing the tradeoffs of their respective truncation strategies. These results illustrate how classical and quantum resources can be orchestrated to extend observable estimation beyond the limits of either approach alone, providing a foundation for quantum-centric supercomputing and future demonstrations of quantum advantage.
Efficient manipulation of Pauli-algebraic objects is a key bottleneck in the classical emulation and benchmarking of quantum algorithms for chemistry and many-body physics. This bottleneck appears in Hamiltonian construction, variational ansatz preparation, expectation-value and gradient evaluation, and real-time propagation, all of which require repeated Pauli-algebra operations. Here, we present a high-performance Pauli-algebra framework tailored to quantum many-body and quantum-chemical simulations. The framework combines compact binary symplectic encoding, canonical coefficient reduction, and grouped sparse operator representations that exploit shared bit-flip patterns among Pauli strings. The resulting Julia/C\texttt{++} implementation accelerates Pauli multiplication, Hamiltonian construction, and operator--state multiplication in sparse and symmetry-adapted many-electron spaces. Benchmarks demonstrate efficient Hamiltonian construction, large-active-space VQE and ADAPT-VQE calculations, and real-time variational dynamics on modern multicore CPU and GPU architectures. These results show that structure-aware Pauli-algebra engines provide a scalable classical backend for developing and benchmarking quantum algorithms in quantum chemistry and many-body simulation.
Standard variational quantum simulation seeks to reproduce the evolution of the full quantum state, although many applications require only the expectation values of a few observables. We study a variational method for pure-state Hamiltonian dynamics that updates circuit parameters to reproduce the evolution of selected expectation values. An exact error identity guides the choice of observables, motivating a construction based on repeated commutators of the target with the Hamiltonian. For Pauli observables and Pauli-rotation circuits, the update can be estimated without ancillary qubits or controlled operations for overlap estimation. Across six- and ten-qubit spin, fermionic, and molecular benchmarks, the observable-targeted update extends the median time within the target-error tolerance compared with standard variational quantum simulation with equal shot budgets. These results show that directing the variational update toward the target observable can extend accurate simulation without increasing the measurement cost per time step.