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

Stability of Local Quantum Dissipative Systems

Toby S. Cubitt, Angelo Lucia, Spyridon Michalakis, David Pérez-Garcı́a

Published Aug 1, 2015• 35 citations
OpenAlex

Abstract

Open quantum systems weakly coupled to the environment are modeled by completely positive, trace preserving semigroups of linear maps. The generators of such evolutions are called Lindbladians. In the setting of quantum many-body systems on a lattice it is natural to consider Lindbladians that decompose into a sum of local interactions with decreasing strength with respect to the size of their support. For both practical and theoretical reasons, it is crucial to estimate the impact that perturbations in the generating Lindbladian, arising as noise or errors, can have on the evolution. These local perturbations are potentially unbounded, but constrained to respect the underlying lattice structure. We show that even for polynomially decaying errors in the Lindbladian, local observables and correlation functions are stable if the unperturbed Lindbladian has a unique fixed point and a mixing time which scales logarithmically with the system size. The proof relies on Lieb-Robinson bounds, which describe a finite group velocity for propagation of information in local systems. As a main example, we prove that classical Glauber dynamics is stable under local perturbations, including perturbations in the transition rates which may not preserve detailed balance.

Related papers

Stability of slow Hamiltonian dynamics from Lieb-Robinson bounds

Daniele Toniolo, Sougato Bose

We rigorously show that a local spin system giving rise to a slow Hamiltonian dynamics is stable against generic, even time-dependent, local perturbations. The sum of these perturbations can cover a significant amount of the system's size. The stability of the slow dynamics follows from proving that the Lieb-Robinson bound for the dynamics of the total Hamiltonian is the sum of two contributions: the Lieb-Robinson bound of the unperturbed dynamics and an additional term coming from the Lieb-Robinson bound of the perturbations with respect to the unperturbed Hamiltonian. Our results are particularly relevant in the context of the study of the stability of Many-Body-Localized systems, implying that if a so called ergodic region is present in the system, to spread across a certain distance it takes a time proportional to the exponential of such distance. The non-perturbative nature of our result allows us to develop a dual description of the dynamics of a system. As a consequence we are able to prove that the presence of a region of disorder in a ergodic system implies the slowing down of the dynamics in the vicinity of that region.

arXiv:2405.05958•May 9, 2024•1 citation

Killing of Transport in Lattices driven by Local Quantum Stochastic Dynamics

Benoît Descamps

Systems with local dynamics are characterized by a finite velocity of propagation of perturbations, known as the Lieb-Robinson velocity. On the other hand, irreducible stochastic processes drive states towards some unique fixed point. However, combining both effects is mathematically challenging. The bounds on propagation do not depend on system-size, while the theory of mixing is mostly based on extensive upper-bounds. In a previous paper, a class of local Lindbladian operators on arbitrary lattice was constructed, for which the two effects could be combined. In this paper, we show that for some local dynamics, local observables are propagated inside a much smaller convex subset of the total Banach space. This allows us to show localization for such dynamics.

arXiv:1501.02363•Jan 10, 2015•1 citation

Constant-time equilibration of observables under rapid Lindbladian dynamics

Štěpán Šmíd, Richard Meister, Mario Berta +1 more

Markovian open-system dynamics have widespread applications throughout quantum information science, including algorithmic state preparation. Their convergence is commonly quantified using the worst case global trace distance between the evolving and stationary states. However, this criterion can be unnecessarily stringent when only physically relevant observables are of interest. Here we introduce and study observable-specific mixing times. We prove that, for quasi-local, rapidly mixing Lindbladians, sums of geometrically local observables equilibrate in a time independent of system size, in contrast to the logarithmic dependence of global state mixing. This separation reduces the runtime of dissipative quantum algorithms, including quantum Gibbs samplers, for estimating quantities such as the Gibbs state energy and local order parameters, yielding an overall scaling that is linear in system size. Complementing this quantum result, we develop a quantum-inspired classical algorithm for estimating the same quantities. Its runtime is likewise linear in system size, but scaling exponentially in $\mathcal{O}\big(\log(1/ε)^D\big)$, where $D$ denotes the spatial dimension of the lattice. We further analyse non-interacting Lindbladians over qudits, fermions, and bosons, demonstrating that locality of observables is not always necessary for a qualitatively faster mixing. Small-scale simulations of quantum Gibbs samplers reveal no large hidden constants in our asymptotic analysis and show that the theoretical predictions closely capture the finite-size dynamics.

quant-pharXiv:2608.28451•Aug 31, 2026•0 citations

Stability and area law for rapidly mixing quantum dissipative systems

Lucia, Angelo

In this thesis we study properties of open quantum dissipative evolutions of spin systems on lattices described by Lindblad generators, in a particular regime that we denote rapid mixing. We consider dissipative evolutions with a unique fixed point, and which compress the whole space of input states into increasingly small neighborhoods of the fixed point. The time scale at which this compression takes place, or in other words the time we have to wait for any input state to become almost indistinguishable from the fixed point, is called the mixing time of the process. Rapid mixing is a condition on the scaling of this mixing time with the system size: if it is logarithmic, then we have rapid mixing. The main contribution of this thesis is to show that rapid mixing has profound implications for the corresponding system: it is stable against external perturbations and its fixed point satisfies an area law for mutual information.

arXiv:1703.08346•Mar 24, 2017•0 citations

Rapid mixing and stability of quantum dissipative systems

Ángelo Lucia, Toby S. Cubitt, Spyridon Michalakis +1 more

The physics of many materials is modeled by quantum many-body systems with local interactions. If the model of the system is sensitive to noise from the environment, or small perturbations to the original interactions, it will not properly model the robustness of the real physical system it aims to describe, or be useful when engineering novel systems for quantum information processing. We show that local observables and correlation functions of local Liouvillians are stable to local perturbations if the dynamics is rapidly mixing and has a unique fixed point. No other condition is required.

arXiv:1409.7809•Physical Review A•Apr 9, 2015•19 citations

Lattice Lindbladian simulation by patching and merging

Kaoru Mizuta

Simulating the dynamics of dissipative quantum many-body systems governed by local Lindbladians is a fundamental task in quantum computation. While the near-optimal gate count has been achieved for Hamiltonian simulation, comparable results for Lindbladian simulation remain elusive. In this work, we develop quantum algorithms for lattice Lindbladians by exploiting their locality. First, we consider sparsely dissipative systems, in which the dissipation is sparsely located, including boundary-driven systems. We establish a near-optimal quantum algorithm for their dynamics with gate count $O(Nt \, \mathrm{polylog}(Nt/\varepsilon))$, where $N$ is the system size, $t$ is the evolution time, and $\varepsilon$ is the allowable error. We then consider generic lattice Lindbladians with finite-range interactions and dissipation, and develop an algorithm for simulating time-evolved observables with gate count $O((Nt)^{4/3} \, \mathrm{polylog}(Nt/\varepsilon))$ per sample with the sampling complexity $Θ(\varepsilon^{-2})$. The gate count has the smallest known dependence on the system size among algorithms retaining polylogarithmic dependence on $1/\varepsilon$. Our algorithms are based on two techniques that exploit locality: patching and merging. Patching decomposes dissipative dynamics into dynamics on subsystems with exponentially small error, generalizing a key idea underlying the Haah-Hastings-Kothari-Low algorithm for near-optimal Hamiltonian simulation. Merging absorbs reversed dissipative dynamics into other parts of the evolution, substantially reducing the overhead associated with quasi-probabilistic sampling. These results demonstrate that locality can be fully exploited to achieve fast quantum simulation of dissipative many-body dynamics, opening the way to applications such as predicting nonequilibrium phenomena and preparing desirable quantum states.

quant-pharXiv:2609.26372•Sep 23, 2026•0 citations
Open quantum systems weakly coupled to the environment are modeled by completely positive, trace preserving semigroups of linear maps. The generators of such evolutions are called Lindbladians. In the setting of quantum many-body systems on a lattice it is natural to consider Lindbladians that decompose into a sum of local interactions with decreasing strength with respect to the size of their support. For both practical and theoretical reasons, it is crucial to estimate the impact that perturbations in the generating Lindbladian, arising as noise or errors, can have on the evolution. These local perturbations are potentially unbounded, but constrained to respect the underlying lattice structure. We show that even for polynomially decaying errors in the Lindbladian, local observables and correlation functions are stable if the unperturbed Lindbladian has a unique fixed point and a mixing time which scales logarithmically with the system size. The proof relies on Lieb-Robinson bounds, which describe a finite group velocity for propagation of information in local systems. As a main example, we prove that classical Glauber dynamics is stable under local perturbations, including perturbations in the transition rates which may not preserve detailed balance.
We rigorously show that a local spin system giving rise to a slow Hamiltonian dynamics is stable against generic, even time-dependent, local perturbations. The sum of these perturbations can cover a significant amount of the system's size. The stability of the slow dynamics follows from proving that the Lieb-Robinson bound for the dynamics of the total Hamiltonian is the sum of two contributions: the Lieb-Robinson bound of the unperturbed dynamics and an additional term coming from the Lieb-Robinson bound of the perturbations with respect to the unperturbed Hamiltonian. Our results are particularly relevant in the context of the study of the stability of Many-Body-Localized systems, implying that if a so called ergodic region is present in the system, to spread across a certain distance it takes a time proportional to the exponential of such distance. The non-perturbative nature of our result allows us to develop a dual description of the dynamics of a system. As a consequence we are able to prove that the presence of a region of disorder in a ergodic system implies the slowing down of the dynamics in the vicinity of that region.
Systems with local dynamics are characterized by a finite velocity of propagation of perturbations, known as the Lieb-Robinson velocity. On the other hand, irreducible stochastic processes drive states towards some unique fixed point. However, combining both effects is mathematically challenging. The bounds on propagation do not depend on system-size, while the theory of mixing is mostly based on extensive upper-bounds. In a previous paper, a class of local Lindbladian operators on arbitrary lattice was constructed, for which the two effects could be combined. In this paper, we show that for some local dynamics, local observables are propagated inside a much smaller convex subset of the total Banach space. This allows us to show localization for such dynamics.
Markovian open-system dynamics have widespread applications throughout quantum information science, including algorithmic state preparation. Their convergence is commonly quantified using the worst case global trace distance between the evolving and stationary states. However, this criterion can be unnecessarily stringent when only physically relevant observables are of interest. Here we introduce and study observable-specific mixing times. We prove that, for quasi-local, rapidly mixing Lindbladians, sums of geometrically local observables equilibrate in a time independent of system size, in contrast to the logarithmic dependence of global state mixing. This separation reduces the runtime of dissipative quantum algorithms, including quantum Gibbs samplers, for estimating quantities such as the Gibbs state energy and local order parameters, yielding an overall scaling that is linear in system size. Complementing this quantum result, we develop a quantum-inspired classical algorithm for estimating the same quantities. Its runtime is likewise linear in system size, but scaling exponentially in O(log⁡(1/ε)D)\mathcal{O}\big(\log(1/ε)^D\big)O(log(1/ε)D), where DDD denotes the spatial dimension of the lattice. We further analyse non-interacting Lindbladians over qudits, fermions, and bosons, demonstrating that locality of observables is not always necessary for a qualitatively faster mixing. Small-scale simulations of quantum Gibbs samplers reveal no large hidden constants in our asymptotic analysis and show that the theoretical predictions closely capture the finite-size dynamics.
In this thesis we study properties of open quantum dissipative evolutions of spin systems on lattices described by Lindblad generators, in a particular regime that we denote rapid mixing. We consider dissipative evolutions with a unique fixed point, and which compress the whole space of input states into increasingly small neighborhoods of the fixed point. The time scale at which this compression takes place, or in other words the time we have to wait for any input state to become almost indistinguishable from the fixed point, is called the mixing time of the process. Rapid mixing is a condition on the scaling of this mixing time with the system size: if it is logarithmic, then we have rapid mixing. The main contribution of this thesis is to show that rapid mixing has profound implications for the corresponding system: it is stable against external perturbations and its fixed point satisfies an area law for mutual information.
The physics of many materials is modeled by quantum many-body systems with local interactions. If the model of the system is sensitive to noise from the environment, or small perturbations to the original interactions, it will not properly model the robustness of the real physical system it aims to describe, or be useful when engineering novel systems for quantum information processing. We show that local observables and correlation functions of local Liouvillians are stable to local perturbations if the dynamics is rapidly mixing and has a unique fixed point. No other condition is required.
Simulating the dynamics of dissipative quantum many-body systems governed by local Lindbladians is a fundamental task in quantum computation. While the near-optimal gate count has been achieved for Hamiltonian simulation, comparable results for Lindbladian simulation remain elusive. In this work, we develop quantum algorithms for lattice Lindbladians by exploiting their locality. First, we consider sparsely dissipative systems, in which the dissipation is sparsely located, including boundary-driven systems. We establish a near-optimal quantum algorithm for their dynamics with gate count O(Nt polylog(Nt/ε))O(Nt \, \mathrm{polylog}(Nt/\varepsilon))O(Ntpolylog(Nt/ε)), where NNN is the system size, ttt is the evolution time, and ε\varepsilonε is the allowable error. We then consider generic lattice Lindbladians with finite-range interactions and dissipation, and develop an algorithm for simulating time-evolved observables with gate count O((Nt)4/3 polylog(Nt/ε))O((Nt)^{4/3} \, \mathrm{polylog}(Nt/\varepsilon))O((Nt)4/3polylog(Nt/ε)) per sample with the sampling complexity Θ(ε−2)Θ(\varepsilon^{-2})Θ(ε−2). The gate count has the smallest known dependence on the system size among algorithms retaining polylogarithmic dependence on 1/ε1/\varepsilon1/ε. Our algorithms are based on two techniques that exploit locality: patching and merging. Patching decomposes dissipative dynamics into dynamics on subsystems with exponentially small error, generalizing a key idea underlying the Haah-Hastings-Kothari-Low algorithm for near-optimal Hamiltonian simulation. Merging absorbs reversed dissipative dynamics into other parts of the evolution, substantially reducing the overhead associated with quasi-probabilistic sampling. These results demonstrate that locality can be fully exploited to achieve fast quantum simulation of dissipative many-body dynamics, opening the way to applications such as predicting nonequilibrium phenomena and preparing desirable quantum states.