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

Dynamic Observable Subspaces: Fast Simulation of Observable Quantum Dynamics

Hannes Leipold

quant-phSubmitted Sep 9, 2026• Announced Sep 10, 2026• 1 citation• Revised Sep 11, 2026 (v2)
v1 · Sep 9, 2026v2 · Sep 11, 2026
arXivHTMLPDF

Abstract

By decomposing quantum dynamics across the Lie orbits of a list of observables, we find polynomial bounded classical simulations for the dynamics of the quantum system given a polynomial sized dynamic Lie algebra (DLA) for the generators of the quantum system. To do so, we describe how to construct the Dynamic Observable Subspace (DOS) that captures all the relevant dynamics for calculating expectation values for a specific observable for Pauli strings, diffusor mixers, and general local generators. Efficient sparse matrix representation, decoupling nonlinearity from such representation and basis construction with permissible pruning allows us to simulate the closed dynamics of such systems with hundreds of qubits. Moreover, we find that while restricted DOS circuits may not express the space of an associated Hamiltonian, they can dramatically outperform a fully expressive circuit due to the absence of the Barren Plateau. While classically simulatable, such circuits can still exhibit a form of quantum advantage through inference, act as warm starting for more expressive circuits, and find high quality trial states for Quantum Amplitude Amplification or Quantum Phase Estimation. In the simulation of quantum dynamics, we find that our restricted circuit can be simulated in polynomial time while producing high quality guiding state for downstream tasks like Quantum Phase Estimation with significantly lower energy than circuits with full expressivity.

Related papers

Enabling Lie-Algebraic Classical Simulation beyond Free Fermions

Adelina Bärligea, Matthew L. Sims-Goh, Jakob S. Kottmann

Efficient classical simulation has matured to a critical component of the quantum computing stack, driving hardware validation, algorithm design, benchmarking, and the study of structured quantum dynamics. Lie-algebraic simulation ($\mathfrak{g}$-sim) offers a compelling approach: it represents Heisenberg-picture dynamics in the adjoint space whose dimension is set by the dynamical Lie algebra (DLA) governing the circuit, enabling efficient simulation of expectation values whenever the DLA grows only polynomially with system size. Despite this promise, existing applications of $\mathfrak{g}$-sim have been confined to free-fermionic settings. It has therefore remained unclear if the method can be applied to other structured circuit families, especially when their generators have large Pauli expansions, and hence whether Lie-algebraic simulability presents a genuinely broader paradigm than free fermions. In this work, we resolve this question by identifying additional non-trivial families of polynomial-dimensional DLAs and introducing symmetry-adapted bases that make the required adjoint-space preprocessing tractable. In particular, we develop an explicit Pauli orbit representation for permutation-equivariant dynamics, enabling efficient processing of cubic-dimensional algebras despite exponential Pauli support, and a modified generalized Gell--Mann representation for bounded Hamming-weight ($U(1)$-equivariant) dynamics, yielding polynomial simulation costs on fixed excitation sectors. Together with streamlined routines for free-fermionic algebras, these constructions significantly broaden the practical scope of $\mathfrak{g}$-sim as a unifying simulation tool for structured quantum circuits. Numerical benchmarks confirm favorable preprocessing scaling and validate large-scale proof-of-concept simulations beyond the reach of state-vector simulation.

quant-pharXiv:2604.16701•Apr 21, 2026•11 citations

Lie-Algebraic Classical Simulation of Bosonic Systems Beyond Gaussian Dynamics

Adelina Bärligea, Timothy Heightman, Jakob S. Kottmann +1 more

Classical simulability is ultimately determined by both the dynamics of a quantum system and the observables being evaluated. Lie-algebraic simulation exploits the latter to make exact polynomial-time classical simulations by propagating observables through low-dimensional invariant operator spaces. However, its conventional formulation in terms of polynomial-dimensional dynamical Lie algebras does not directly accommodate bosonic systems as their algebras are neither compact nor semisimple. In this contribution, we overcome this limitation, making bosonic systems accessible to the Lie-algebraic programme of exact polynomial-time classical simulation. We prove that expectation values, fixed-order correlation functions, including multi-time correlators and out-of-time-ordered correlators, and gradients are efficiently computable whenever their operator modules have polynomial dimension. This recovers Gaussian quantum optics and extends it to non-Gaussian input states, while identifying exact polynomial regimes of interacting non-Gaussian dynamics including bounded-photon Kerr and pair-hopping Hamiltonians and nilpotent polynomial phase dynamics. We show that unlike in the finite-dimensional spin and fermionic setting treated previously, a finite-dimensional bosonic generator algebra alone does not guarantee finite observable dynamics. We further derive a controlled perturbative hierarchy for squeezing beyond exact sector confinement and confirm the predicted error orders numerically. We also evaluate operator spreading on interacting chains of up to $400$ modes and connect a topological doublon band with flux-reversed edge motion. These results provide a unified formalism for classifying, discovering, and systematically approximating tractable bosonic quantum dynamics with classical polynomial-time simulation.

quant-pharXiv:2608.17094•Aug 19, 2026•1 citation

An efficient algorithm for approximate shadow Hamiltonian simulation

Abhijit Chakraborty, Bharath Sambasivam, Karunya Shirali +4 more

We propose an efficient algorithm based on shadow Hamiltonian simulation to approximately simulate the real-time dynamics of observables under time-independent Hamiltonians. Shadow Hamiltonian simulation works at the level of the operator algebra generated by the observables through commutators with the Hamiltonian. Exactly encoding the quantum state in this picture is generally inefficient for interacting systems due to the exponential growth of the operator algebra. Our algorithm overcomes this bottleneck by systematically identifying the elements of the algebra most relevant to the target observables. This targeted approach is a controlled approximation that yields a highly efficient quantum state encoding that substantially reduces the size of the qubit register required to perform the time evolution using the shadow Hamiltonian. We propose two main pruning schemes, one based on a predefined operator basis and another on a constructed Krylov basis. We also present a hybrid scheme that builds a Krylov basis within a pruned algebra in the predefined basis. We benchmark our algorithm using lattice spin systems in one and two dimensions, for both one- and higher-point correlators as observables.

quant-pharXiv:2607.11882•Jul 14, 2026•4 citations

Lie-algebraic classical simulations for quantum computing

Matthew L. Goh, Martín Larocca, Łukasz Cincio +2 more

The classical simulation of quantum dynamics plays an important role in our understanding of quantum complexity and in the development of quantum technologies. Efficient techniques such as those based on the Gottesman-Knill theorem for Clifford circuits, tensor networks for low entanglement-generating circuits, or Wick's theorem for fermionic Gaussian states have become central tools in quantum computing. In this work, we contribute to this body of knowledge by presenting a framework for classical simulations, dubbed “ g -sim ”, which is based on the underlying Lie algebraic structure of the dynamical process. When the dimension of the algebra grows at most polynomially in the system size, there exist observables for which the simulation is efficient. Indeed, we show that g -sim enables new regimes for classical simulations, is able to deal with certain forms of noise in the evolution, as well as can be used to tackle several paradigmatic variational and nonvariational quantum computing tasks. For the former, we perform Lie-algebraic simulations to train and optimize parametrized quantum circuits (thus effectively showing that some variational models can be dequantized), design enhanced parameter initialization strategies, solve tasks of quantum circuit synthesis, and train a quantum-phase classifier. For the latter, we report large-scale noiseless and noisy simulations on benchmark problems. By comparing the limitations of g -sim and certain Wick's theorem-based simulations, we find that the two methods become inefficient for different types of states or observables, hinting at the existence of distinct, nonequivalent resources for classical simulation.

arXiv:2308.01432•Physical Review Research•Aug 22, 2025•111 citations

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

Dissipation accelerates quantum and classical simulation of open-system dynamics

Armando Angrisani, Ricard Puig, Yanting Teng +1 more

Simulating open quantum systems reveals how environmental coupling shapes relaxation, excitation transport, and the dynamics of quantum correlations. On quantum hardware, dissipative channels add operations and might seem to increase cost. However, we show that a broad class of Pauli noise, including depolarization, can ease quantum and classical simulation by exponentially suppressing high-weight components of Heisenberg-evolved observables. For bounded-degree Lindblad dynamics, this permits system-size-independent Trotter steps when estimating local observables. Combining this compression with Richardson extrapolation, we provide classical and quantum error bounds with respect to the 2-norm of the propagated observable. These give high-probability expectation-value guarantees for random input states or random Hamiltonians acting on a fixed state and control (out-of-time-order) correlators. Concretely, we show that expectation values of local observables at time $t$ can be estimated to accuracy $\varepsilon$ using circuits of maximum depth $O\!\left(\left[1+\left(t/γ\right)^{3/2}\right]\log^2(1/\varepsilon)\right)$, independent of the system size $n$. Classically, we show that sparse Pauli propagation runs in time polynomial in $n$, $t$ and $1/\varepsilon$ for every fixed $γ>0$, with polynomial degree $O(1/γ)$ in the weak dissipation limit. The gap between our quantum and classical upper bounds leaves room for a substantial polynomial quantum advantage as dissipation weakens, an observation further supported by our numerical results.

quant-pharXiv:2609.40174•Oct 1, 2026•2 citations
By decomposing quantum dynamics across the Lie orbits of a list of observables, we find polynomial bounded classical simulations for the dynamics of the quantum system given a polynomial sized dynamic Lie algebra (DLA) for the generators of the quantum system. To do so, we describe how to construct the Dynamic Observable Subspace (DOS) that captures all the relevant dynamics for calculating expectation values for a specific observable for Pauli strings, diffusor mixers, and general local generators. Efficient sparse matrix representation, decoupling nonlinearity from such representation and basis construction with permissible pruning allows us to simulate the closed dynamics of such systems with hundreds of qubits. Moreover, we find that while restricted DOS circuits may not express the space of an associated Hamiltonian, they can dramatically outperform a fully expressive circuit due to the absence of the Barren Plateau. While classically simulatable, such circuits can still exhibit a form of quantum advantage through inference, act as warm starting for more expressive circuits, and find high quality trial states for Quantum Amplitude Amplification or Quantum Phase Estimation. In the simulation of quantum dynamics, we find that our restricted circuit can be simulated in polynomial time while producing high quality guiding state for downstream tasks like Quantum Phase Estimation with significantly lower energy than circuits with full expressivity.
Efficient classical simulation has matured to a critical component of the quantum computing stack, driving hardware validation, algorithm design, benchmarking, and the study of structured quantum dynamics. Lie-algebraic simulation (g\mathfrak{g}g-sim) offers a compelling approach: it represents Heisenberg-picture dynamics in the adjoint space whose dimension is set by the dynamical Lie algebra (DLA) governing the circuit, enabling efficient simulation of expectation values whenever the DLA grows only polynomially with system size. Despite this promise, existing applications of g\mathfrak{g}g-sim have been confined to free-fermionic settings. It has therefore remained unclear if the method can be applied to other structured circuit families, especially when their generators have large Pauli expansions, and hence whether Lie-algebraic simulability presents a genuinely broader paradigm than free fermions. In this work, we resolve this question by identifying additional non-trivial families of polynomial-dimensional DLAs and introducing symmetry-adapted bases that make the required adjoint-space preprocessing tractable. In particular, we develop an explicit Pauli orbit representation for permutation-equivariant dynamics, enabling efficient processing of cubic-dimensional algebras despite exponential Pauli support, and a modified generalized Gell--Mann representation for bounded Hamming-weight (U(1)U(1)U(1)-equivariant) dynamics, yielding polynomial simulation costs on fixed excitation sectors. Together with streamlined routines for free-fermionic algebras, these constructions significantly broaden the practical scope of g\mathfrak{g}g-sim as a unifying simulation tool for structured quantum circuits. Numerical benchmarks confirm favorable preprocessing scaling and validate large-scale proof-of-concept simulations beyond the reach of state-vector simulation.
Classical simulability is ultimately determined by both the dynamics of a quantum system and the observables being evaluated. Lie-algebraic simulation exploits the latter to make exact polynomial-time classical simulations by propagating observables through low-dimensional invariant operator spaces. However, its conventional formulation in terms of polynomial-dimensional dynamical Lie algebras does not directly accommodate bosonic systems as their algebras are neither compact nor semisimple. In this contribution, we overcome this limitation, making bosonic systems accessible to the Lie-algebraic programme of exact polynomial-time classical simulation. We prove that expectation values, fixed-order correlation functions, including multi-time correlators and out-of-time-ordered correlators, and gradients are efficiently computable whenever their operator modules have polynomial dimension. This recovers Gaussian quantum optics and extends it to non-Gaussian input states, while identifying exact polynomial regimes of interacting non-Gaussian dynamics including bounded-photon Kerr and pair-hopping Hamiltonians and nilpotent polynomial phase dynamics. We show that unlike in the finite-dimensional spin and fermionic setting treated previously, a finite-dimensional bosonic generator algebra alone does not guarantee finite observable dynamics. We further derive a controlled perturbative hierarchy for squeezing beyond exact sector confinement and confirm the predicted error orders numerically. We also evaluate operator spreading on interacting chains of up to 400400400 modes and connect a topological doublon band with flux-reversed edge motion. These results provide a unified formalism for classifying, discovering, and systematically approximating tractable bosonic quantum dynamics with classical polynomial-time simulation.
We propose an efficient algorithm based on shadow Hamiltonian simulation to approximately simulate the real-time dynamics of observables under time-independent Hamiltonians. Shadow Hamiltonian simulation works at the level of the operator algebra generated by the observables through commutators with the Hamiltonian. Exactly encoding the quantum state in this picture is generally inefficient for interacting systems due to the exponential growth of the operator algebra. Our algorithm overcomes this bottleneck by systematically identifying the elements of the algebra most relevant to the target observables. This targeted approach is a controlled approximation that yields a highly efficient quantum state encoding that substantially reduces the size of the qubit register required to perform the time evolution using the shadow Hamiltonian. We propose two main pruning schemes, one based on a predefined operator basis and another on a constructed Krylov basis. We also present a hybrid scheme that builds a Krylov basis within a pruned algebra in the predefined basis. We benchmark our algorithm using lattice spin systems in one and two dimensions, for both one- and higher-point correlators as observables.
The classical simulation of quantum dynamics plays an important role in our understanding of quantum complexity and in the development of quantum technologies. Efficient techniques such as those based on the Gottesman-Knill theorem for Clifford circuits, tensor networks for low entanglement-generating circuits, or Wick's theorem for fermionic Gaussian states have become central tools in quantum computing. In this work, we contribute to this body of knowledge by presenting a framework for classical simulations, dubbed “ g -sim ”, which is based on the underlying Lie algebraic structure of the dynamical process. When the dimension of the algebra grows at most polynomially in the system size, there exist observables for which the simulation is efficient. Indeed, we show that g -sim enables new regimes for classical simulations, is able to deal with certain forms of noise in the evolution, as well as can be used to tackle several paradigmatic variational and nonvariational quantum computing tasks. For the former, we perform Lie-algebraic simulations to train and optimize parametrized quantum circuits (thus effectively showing that some variational models can be dequantized), design enhanced parameter initialization strategies, solve tasks of quantum circuit synthesis, and train a quantum-phase classifier. For the latter, we report large-scale noiseless and noisy simulations on benchmark problems. By comparing the limitations of g -sim and certain Wick's theorem-based simulations, we find that the two methods become inefficient for different types of states or observables, hinting at the existence of distinct, nonequivalent resources for classical 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.
Simulating open quantum systems reveals how environmental coupling shapes relaxation, excitation transport, and the dynamics of quantum correlations. On quantum hardware, dissipative channels add operations and might seem to increase cost. However, we show that a broad class of Pauli noise, including depolarization, can ease quantum and classical simulation by exponentially suppressing high-weight components of Heisenberg-evolved observables. For bounded-degree Lindblad dynamics, this permits system-size-independent Trotter steps when estimating local observables. Combining this compression with Richardson extrapolation, we provide classical and quantum error bounds with respect to the 2-norm of the propagated observable. These give high-probability expectation-value guarantees for random input states or random Hamiltonians acting on a fixed state and control (out-of-time-order) correlators. Concretely, we show that expectation values of local observables at time ttt can be estimated to accuracy ε\varepsilonε using circuits of maximum depth O ⁣([1+(t/γ)3/2]log⁡2(1/ε))O\!\left(\left[1+\left(t/γ\right)^{3/2}\right]\log^2(1/\varepsilon)\right)O([1+(t/γ)3/2]log2(1/ε)), independent of the system size nnn. Classically, we show that sparse Pauli propagation runs in time polynomial in nnn, ttt and 1/ε1/\varepsilon1/ε for every fixed γ>0γ>0γ>0, with polynomial degree O(1/γ)O(1/γ)O(1/γ) in the weak dissipation limit. The gap between our quantum and classical upper bounds leaves room for a substantial polynomial quantum advantage as dissipation weakens, an observation further supported by our numerical results.