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.40174

Dissipation accelerates quantum and classical simulation of open-system dynamics

Armando Angrisani, Ricard Puig, Yanting Teng, Zoë Holmes

quant-phcond-mat.stat-mechSubmitted Sep 30, 2026• Announced Oct 1, 2026• 2 citations
arXivHTMLPDF

Abstract

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.

AI Summary

The paper asks whether dissipation can reduce the cost of simulating continuous-time open-system dynamics, rather than merely adding operations. It considers local, time-independent qubit Lindbladians with Pauli Hamiltonian interactions and paired Pauli-diagonal dissipators that damp every nonidentity Pauli mode on each interaction region, including depolarization. The analysis establishes contraction of two norms of Heisenberg-evolved observables: a Pauli-coefficient $\ell_p$ norm with $p<2$, controlling sparsity, and an exponentially weight-weighted Hilbert–Schmidt norm, controlling high-Pauli-weight tails. These bounds compare coherent and dissipative rates directly and remain valid as Trotter steps shrink. They support system-size-independent product-formula error bounds and sparse classical Pauli propagation with coefficient and weight truncation. Combined with Richardson extrapolation, the quantum result gives maximum ideal circuit depth $O([1+(t/\gamma)^{3/2}]\log^2(1/\varepsilon))$ for fixed local interaction parameters and initially local observables. The classical runtime is polynomial in $n$, $t$, and $1/\varepsilon$ for every fixed damping rate $\gamma>0$, with polynomial degree $O(1+J/\gamma)$. A discrete-circuit extension improves the stated gate-based-depolarizing-noise simulation bound from quasipolynomial to polynomial. Errors are controlled in normalized Hilbert–Schmidt norm, yielding RMS expectation-value guarantees over state 1-designs, rather than arbitrary fixed inputs; infinite-temperature correlations and OTOCs are also covered. The noise assumptions exclude single-axis dephasing, bit flips, and amplitude damping. Quantum depth excludes sampling and implementation overheads, and the gap between quantum and classical upper bounds does not establish advantage. Small-system resource comparisons and 49-qubit Pauli-propagation calculations supplement the analysis.

Likely largely AI-generatedAI use disclosedStrong assumptions
Through much back-and-forth, Claude and GPT then fleshed out the details, ran the numerics, and drafted parts of the manuscript.

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

Comments
10 + 64 pages, 2 figures

Related papers

Hamiltonian dynamics from pure dissipation

Daniel Stilck França, Zhong-Xia Shang

Abstract The fundamental difference between closed and open quantum dynamics lies in their environmental interaction: closed systems are perfectly isolated and evolve reversibly under unitary Hamiltonian dynamics, whereas open systems continuously couple to an external bath, resulting in irreversible dissipation and information loss. In this work, we show internal Hamiltonian dynamics can be "faked`` via external pure dissipation, i.e., Lindbladians without a coherent Hamiltonian part. More concretely, we show that, in a GKSL representation with zero explicit Hamiltonian, bounded-norm dissipative generators can approximate Hamiltonian dynamics within $\epsilon$ error in diamond norm using $\mathcal{O}(t^2/\epsilon)$ evolution time. We further prove that for time-independent dynamics this $\mathcal{O}(t^2/\epsilon)$ scaling is in the worst case, necessary and optimal from a geometric perspective, which captures the fundamental decoherence cost for catching up with the speed of Hamiltonian dynamics. For practical considerations, we establish an autonomous QDRIFT protocol and show how to exponentially improve the dependence on $\epsilon$ for expectation value estimation via extrapolations. Our construction leads to various implications, including the BQP-completeness of purely dissipative dynamics even before reaching approximate equilibrium, a Zeno-adjacent state-independent freezing effect, the no super-quadratic fast-forwarding theorem of a class of purely dissipative dynamics, and reducing Lindbladian simulation cost via gauge changing.

•Jul 31, 2026•0 citations

Shallow Quantum Circuits for Geometrically Local Lindblad Dynamics

Zheyu Shen, Yusen Wu, Xiao Yuan +1 more

Open-system dynamics govern decoherence, transport, and engineered dissipation in quantum many-body systems. We propose a quantum algorithm for simulating time-independent, finite-range Lindblad dynamics with bounded local strength on a constant-dimensional lattice of $n$ sites, allowing noncommuting jump operators. For time $T\ge1$ and diamond-norm error at most $ε$, it has depth $O(T\operatorname{polylog}(nT/ε))$ and gate count $O(nT\operatorname{polylog}(nT/ε))$. These results extend the HHKL spatial decomposition to open systems. The main obstacle is that the reversible overlap corrections used for unitary dynamics have no direct analogue for dissipative channels. We overcome this by retaining the environment in a shared unitary dilation, keeping information lost from the system coherently available and making the spatial corrections reversible. We prove exponential occupation bounds for the environmental states generated by the decomposition, allowing compact representation and coherent simulation of local factors on the inputs that arise. The construction reduces each short-time evolution to a constant number of parallel layers on regions of logarithmic diameter, using nearest-neighbour gates and polylogarithmic auxiliary density. We also prove unconditional worst-case lower bounds using time-independent, purely dissipative processes that transport quantum information. For circuits with local quantum and classical communication, the lower bounds are $Ω(nT)$ for the expected gate count and $Ω(T)$ for depth on time scales up to the lattice diameter. They match the upper bounds' leading time and volume dependence up to polylogarithmic factors. At fixed time and sufficiently small fixed error, we further prove a depth lower bound of $Ω(\log n/\log\log n)$, showing that global accuracy can require increasing depth as the lattice grows.

quant-pharXiv:2610.05362•Oct 6, 2026•1 citation

Simulating Quantum Circuits with Arbitrary Local Noise Using Pauli Propagation

Armando Angrisani, Antonio Anna Mele, Manuel S. Rudolph +2 more

We present a polynomial-time classical algorithm for estimating expectation values of arbitrary observables on typical quantum circuits under any incoherent local noise, including non-unital or dephasing. Although previous research demonstrated that some carefully designed quantum circuits affected by non-unital noise cannot be efficiently simulated, we show that this does not apply to average-case circuits, as these can be efficiently simulated using Pauli-path methods. Specifically, we prove that, with high probability over the circuit gates’ choice, Pauli propagation algorithms with tailored truncation strategies achieve an inversely polynomially small simulation error. This result holds for arbitrary circuit topologies and for any local noise, under the assumption that the distribution of each circuit layer is invariant under single-qubit random gates. Under the same minimal assumptions, we also prove that most noisy circuits can be truncated to an effective logarithmic depth for the task of estimating expectation values of observables, thus generalizing prior results to a significantly broader class of circuit ensembles. We further numerically validate our algorithm with simulations on a 6 × 6 lattice of qubits under the effects of amplitude damping and dephasing noise, as well as real-time dynamics on an 11 × 11 lattice of qubits affected by amplitude damping.

arXiv:2501.13101•PRX Quantum•Mar 17, 2026•70 citations

Classical Simulation Healed by Quantum Entanglement

Jue Xu, Chu Zhao, Xiangran Zhang +2 more

Entanglement is not only the origin of exotic quantum phenomena, but also widely regarded as the fundamental barrier to classical simulation of quantum dynamics. We overturn this intuition: for predicting local observables under Hamiltonian evolution, entanglement in the quantum state actually heals the classical simulation error in the Heisenberg picture. Classical algorithms that propagate observables in the Pauli basis with proper truncation have shown remarkable empirical success in simulating noiseless quantum dynamics, yet all prior rigorous guarantees required noise or randomness---leaving the physically relevant noiseless regime without theoretical foundation. To close this gap, we prove that the truncation error of Low-weight Pauli Dynamics (LPD) admits an average-case bound without assuming randomness, provided the state is sufficiently entangled. Since tensor-network methods efficiently simulate low-entanglement states while LPD thrives precisely in the complementary regime, together they extend rigorous classical simulation to longer times, sharpening the boundary between classically simulable and genuinely quantum dynamics.

quant-pharXiv:2601.15770•Jan 23, 2026•6 citations

Classical simulations of noisy variational quantum circuits

Enrico Fontana, Manuel S. Rudolph, Ross Duncan +2 more

Noise detrimentally affects quantum computations so that they not only become less accurate but also easier to simulate classically as systems scale up. We construct a classical simulation algorithm, lowesa (low weight efficient simulation algorithm), for estimating expectation values of noisy parameterised quantum circuits with a fixed observable. It combines previous results on spectral analysis of parameterised circuits with Pauli back-propagation and recent ideas for simulations of noisy random circuits. We show, under some conditions on the circuits and mild assumptions on noise, that lowesa gives an efficient, polynomial algorithm in the number of qubits (and depth), with approximation error that vanishes exponentially in the physical error rate and a controllable cutoff parameter. This is valid for any expectation value that may be efficiently evaluated on a quantum computer. We discuss the practical limitations of the method for circuit classes with correlated parameters and its scaling with decreasing error rates.

arXiv:2306.05400•npj Quantum Information•May 22, 2025•93 citations

Scalable Lindblad Noise Learning via Stochastic Tensor-Network Simulation

Alejandro R. Ramos Ramos, Maximilian Fröhlich, Aaron Sander +4 more

Learning dissipation rates in large-scale open quantum systems is a major obstacle for near-term quantum technologies, as existing Lindblad estimation methods are typically limited to small system sizes due to the computational complexity of repeatedly solving the Lindblad equation during optimization. Here, we propose a scalable noise-learning framework for Lindblad dissipation rates that combines a stochastic simulation method, the Tensor Jump Method (TJM), with gradient-free optimization of a least-squares cost-function defined on time series of local-observable expectation values. We demonstrate the approach on two noise models in the Ising model: a site-resolved (local) model, in which independent dissipation rates are learned for each site up to $N_{\mathrm{site}}=16$, and a spatially homogeneous (global) model with only seven parameters, scaled to $N_{\mathrm{site}}=160$ sites.We complement these numerical results with a series of exact, provable guarantees: the Frobenius variance of the TJM density-matrix estimator is shown to equal $(1-\mathrm{Tr}[ρ^2])/N_{\mathrm{traj}}$, an exact purity-based characterization of the stochastic estimation error; the corresponding purity evolution is proven to be monotonically non-increasing for Hermitian jump operators; and, under a finite covariance distance assumption, the standard deviation of the cost-function is shown to decrease with system size, so that fewer trajectories are needed to reach a fixed target accuracy as the system grows. Together, this combination of scalable numerics and rigorous theoretical guarantees positions TJM-based noise learning as a practical foundation for characterizing dissipation in large quantum devices and for guiding future work on error mitigation and quantum error correction.

quant-pharXiv:2608.24668•Aug 26, 2026•0 citations
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.
The paper asks whether dissipation can reduce the cost of simulating continuous-time open-system dynamics, rather than merely adding operations. It considers local, time-independent qubit Lindbladians with Pauli Hamiltonian interactions and paired Pauli-diagonal dissipators that damp every nonidentity Pauli mode on each interaction region, including depolarization.
The analysis establishes contraction of two norms of Heisenberg-evolved observables: a Pauli-coefficient ℓp\ell_pℓp​ norm with p<2p<2p<2, controlling sparsity, and an exponentially weight-weighted Hilbert–Schmidt norm, controlling high-Pauli-weight tails. These bounds compare coherent and dissipative rates directly and remain valid as Trotter steps shrink. They support system-size-independent product-formula error bounds and sparse classical Pauli propagation with coefficient and weight truncation.
Combined with Richardson extrapolation, the quantum result gives maximum ideal circuit depth O([1+(t/γ)3/2]log⁡2(1/ε))O([1+(t/\gamma)^{3/2}]\log^2(1/\varepsilon))O([1+(t/γ)3/2]log2(1/ε)) for fixed local interaction parameters and initially local observables. The classical runtime is polynomial in nnn, ttt, and 1/ε1/\varepsilon1/ε for every fixed damping rate γ>0\gamma>0γ>0, with polynomial degree O(1+J/γ)O(1+J/\gamma)O(1+J/γ). A discrete-circuit extension improves the stated gate-based-depolarizing-noise simulation bound from quasipolynomial to polynomial.
Errors are controlled in normalized Hilbert–Schmidt norm, yielding RMS expectation-value guarantees over state 1-designs, rather than arbitrary fixed inputs; infinite-temperature correlations and OTOCs are also covered. The noise assumptions exclude single-axis dephasing, bit flips, and amplitude damping. Quantum depth excludes sampling and implementation overheads, and the gap between quantum and classical upper bounds does not establish advantage. Small-system resource comparisons and 49-qubit Pauli-propagation calculations supplement the analysis.
Abstract The fundamental difference between closed and open quantum dynamics lies in their environmental interaction: closed systems are perfectly isolated and evolve reversibly under unitary Hamiltonian dynamics, whereas open systems continuously couple to an external bath, resulting in irreversible dissipation and information loss. In this work, we show internal Hamiltonian dynamics can be "faked`` via external pure dissipation, i.e., Lindbladians without a coherent Hamiltonian part. More concretely, we show that, in a GKSL representation with zero explicit Hamiltonian, bounded-norm dissipative generators can approximate Hamiltonian dynamics within ϵ\epsilonϵ error in diamond norm using O(t2/ϵ)\mathcal{O}(t^2/\epsilon)O(t2/ϵ) evolution time. We further prove that for time-independent dynamics this O(t2/ϵ)\mathcal{O}(t^2/\epsilon)O(t2/ϵ) scaling is in the worst case, necessary and optimal from a geometric perspective, which captures the fundamental decoherence cost for catching up with the speed of Hamiltonian dynamics. For practical considerations, we establish an autonomous QDRIFT protocol and show how to exponentially improve the dependence on ϵ\epsilonϵ for expectation value estimation via extrapolations. Our construction leads to various implications, including the BQP-completeness of purely dissipative dynamics even before reaching approximate equilibrium, a Zeno-adjacent state-independent freezing effect, the no super-quadratic fast-forwarding theorem of a class of purely dissipative dynamics, and reducing Lindbladian simulation cost via gauge changing.
Open-system dynamics govern decoherence, transport, and engineered dissipation in quantum many-body systems. We propose a quantum algorithm for simulating time-independent, finite-range Lindblad dynamics with bounded local strength on a constant-dimensional lattice of nnn sites, allowing noncommuting jump operators. For time T≥1T\ge1T≥1 and diamond-norm error at most εεε, it has depth O(Tpolylog⁡(nT/ε))O(T\operatorname{polylog}(nT/ε))O(Tpolylog(nT/ε)) and gate count O(nTpolylog⁡(nT/ε))O(nT\operatorname{polylog}(nT/ε))O(nTpolylog(nT/ε)). These results extend the HHKL spatial decomposition to open systems. The main obstacle is that the reversible overlap corrections used for unitary dynamics have no direct analogue for dissipative channels. We overcome this by retaining the environment in a shared unitary dilation, keeping information lost from the system coherently available and making the spatial corrections reversible. We prove exponential occupation bounds for the environmental states generated by the decomposition, allowing compact representation and coherent simulation of local factors on the inputs that arise. The construction reduces each short-time evolution to a constant number of parallel layers on regions of logarithmic diameter, using nearest-neighbour gates and polylogarithmic auxiliary density. We also prove unconditional worst-case lower bounds using time-independent, purely dissipative processes that transport quantum information. For circuits with local quantum and classical communication, the lower bounds are Ω(nT)Ω(nT)Ω(nT) for the expected gate count and Ω(T)Ω(T)Ω(T) for depth on time scales up to the lattice diameter. They match the upper bounds' leading time and volume dependence up to polylogarithmic factors. At fixed time and sufficiently small fixed error, we further prove a depth lower bound of Ω(log⁡n/log⁡log⁡n)Ω(\log n/\log\log n)Ω(logn/loglogn), showing that global accuracy can require increasing depth as the lattice grows.
We present a polynomial-time classical algorithm for estimating expectation values of arbitrary observables on typical quantum circuits under any incoherent local noise, including non-unital or dephasing. Although previous research demonstrated that some carefully designed quantum circuits affected by non-unital noise cannot be efficiently simulated, we show that this does not apply to average-case circuits, as these can be efficiently simulated using Pauli-path methods. Specifically, we prove that, with high probability over the circuit gates’ choice, Pauli propagation algorithms with tailored truncation strategies achieve an inversely polynomially small simulation error. This result holds for arbitrary circuit topologies and for any local noise, under the assumption that the distribution of each circuit layer is invariant under single-qubit random gates. Under the same minimal assumptions, we also prove that most noisy circuits can be truncated to an effective logarithmic depth for the task of estimating expectation values of observables, thus generalizing prior results to a significantly broader class of circuit ensembles. We further numerically validate our algorithm with simulations on a 6 × 6 lattice of qubits under the effects of amplitude damping and dephasing noise, as well as real-time dynamics on an 11 × 11 lattice of qubits affected by amplitude damping.
Entanglement is not only the origin of exotic quantum phenomena, but also widely regarded as the fundamental barrier to classical simulation of quantum dynamics. We overturn this intuition: for predicting local observables under Hamiltonian evolution, entanglement in the quantum state actually heals the classical simulation error in the Heisenberg picture. Classical algorithms that propagate observables in the Pauli basis with proper truncation have shown remarkable empirical success in simulating noiseless quantum dynamics, yet all prior rigorous guarantees required noise or randomness---leaving the physically relevant noiseless regime without theoretical foundation. To close this gap, we prove that the truncation error of Low-weight Pauli Dynamics (LPD) admits an average-case bound without assuming randomness, provided the state is sufficiently entangled. Since tensor-network methods efficiently simulate low-entanglement states while LPD thrives precisely in the complementary regime, together they extend rigorous classical simulation to longer times, sharpening the boundary between classically simulable and genuinely quantum dynamics.
Noise detrimentally affects quantum computations so that they not only become less accurate but also easier to simulate classically as systems scale up. We construct a classical simulation algorithm, lowesa (low weight efficient simulation algorithm), for estimating expectation values of noisy parameterised quantum circuits with a fixed observable. It combines previous results on spectral analysis of parameterised circuits with Pauli back-propagation and recent ideas for simulations of noisy random circuits. We show, under some conditions on the circuits and mild assumptions on noise, that lowesa gives an efficient, polynomial algorithm in the number of qubits (and depth), with approximation error that vanishes exponentially in the physical error rate and a controllable cutoff parameter. This is valid for any expectation value that may be efficiently evaluated on a quantum computer. We discuss the practical limitations of the method for circuit classes with correlated parameters and its scaling with decreasing error rates.
Learning dissipation rates in large-scale open quantum systems is a major obstacle for near-term quantum technologies, as existing Lindblad estimation methods are typically limited to small system sizes due to the computational complexity of repeatedly solving the Lindblad equation during optimization. Here, we propose a scalable noise-learning framework for Lindblad dissipation rates that combines a stochastic simulation method, the Tensor Jump Method (TJM), with gradient-free optimization of a least-squares cost-function defined on time series of local-observable expectation values. We demonstrate the approach on two noise models in the Ising model: a site-resolved (local) model, in which independent dissipation rates are learned for each site up to Nsite=16N_{\mathrm{site}}=16Nsite​=16, and a spatially homogeneous (global) model with only seven parameters, scaled to Nsite=160N_{\mathrm{site}}=160Nsite​=160 sites.We complement these numerical results with a series of exact, provable guarantees: the Frobenius variance of the TJM density-matrix estimator is shown to equal (1−Tr[ρ2])/Ntraj(1-\mathrm{Tr}[ρ^2])/N_{\mathrm{traj}}(1−Tr[ρ2])/Ntraj​, an exact purity-based characterization of the stochastic estimation error; the corresponding purity evolution is proven to be monotonically non-increasing for Hermitian jump operators; and, under a finite covariance distance assumption, the standard deviation of the cost-function is shown to decrease with system size, so that fewer trajectories are needed to reach a fixed target accuracy as the system grows. Together, this combination of scalable numerics and rigorous theoretical guarantees positions TJM-based noise learning as a practical foundation for characterizing dissipation in large quantum devices and for guiding future work on error mitigation and quantum error correction.