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:1210.1171 · Journal of Mathematical Physics

Perturbation bounds for quantum Markov processes and their fixed points

Oleg Szehr, Michael M. Wolf

Published Mar 1, 2013• 35 citations
arXivHTMLPDF

Abstract

We investigate the stability of quantum Markov processes with respect to perturbations of their transition maps. In the first part, we introduce a condition number that measures the sensitivity of fixed points of a quantum channel to perturbations. We establish upper and lower bounds on this condition number in terms of subdominant eigenvalues of the transition map. In the second part, we consider quantum Markov processes that converge to a unique stationary state and we analyze the stability of the evolution at finite times. In this way we obtain a linear relation between the mixing time of a quantum Markov process and the sensitivity of its fixed point with respect to perturbations of the transition map.

DOI
10.1063/1.4795112

Related papers

Robustness of Fixed Points of Quantum Channels and Application to Approximate Quantum Markov Chains

Salzmann, Robert, Bjarne Bergh, Nilanjana Datta

Given a quantum channel and a state which satisfy a fixed point equation approximately (say, up to an error $\varepsilon$), can one find a new channel and a state, which are respectively close to the original ones, such that they satisfy an exact fixed point equation? It is interesting to ask this question for different choices of constraints on the structures of the original channel and state, and requiring that these are also satisfied by the new channel and state. We affirmatively answer the above question, under fairly general assumptions on these structures, through a compactness argument. Additionally, for channels and states satisfying certain specific structures, we find explicit upper bounds on the distances between the pairs of channels (and states) in question. When these distances decay quickly (in a particular, desirable manner) as $\varepsilon\to 0$, we say that the original approximate fixed point equation is rapidly fixable. We establish rapid fixability, not only for general quantum channels, but also when the original and new channels are both required to be unitary, mixed unitary or unital. In contrast, for the case of bipartite quantum systems with channels acting trivially on one subsystem, we prove that approximate fixed point equations are not rapidly fixable. In this case, the distance to the closest channel (and state) which satisfy an exact fixed point equation can depend on the dimension of the quantum system in an undesirable way. We apply our results on approximate fixed point equations to the question of robustness of quantum Markov chains (QMC) and establish the following: For any tripartite quantum state, there exists a dimension-dependent upper bound on its distance to the set of QMCs, which decays to zero as the conditional mutual information of the state vanishes.

arXiv:2405.01532•May 2, 2024•2 citations

A cutoff phenomenon for quantum Markov chains

Michael J Kastoryano, David Reeb, Michael M Wolf

We derive upper and lower bounds on the convergence behavior of certain classes of one-parameter quantum dynamical semigroups. The classes we consider, consist of tensor product channels and of channels with commuting Liouvillians. We introduce the notion of cutoff phenomenon in the setting of quantum information theory, and show how it exemplifies the fact that the convergence of (quantum) stochastic processes is not solely governed by the spectral gap of the transition map. We apply the new methods to show that graph states can be prepared efficiently, albeit not in constant time, by dissipation, and give the exact scaling behavior of the time to stationarity.

arXiv:1111.2123•Journal of Physics A Mathematical and Theoretical•Feb 1, 2012•47 citations

Spectral Methods for quantum Markov chains

Oleg Szehr

The aim of this project is to contribute to our understanding of quantum time evolutions, whereby we focus on quantum Markov chains. The latter constitute a natural generalization of the ubiquitous concept of a classical Markov chain to describe evolutions of quantum mechanical systems. We contribute to the theory of such processes by introducing novel methods that allow us to relate the eigenvalue spectrum of the transition map to convergence as well as stability properties of the Markov chain.

•Jan 1, 2015•1 citation

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•26 citations

Defining Stable Phases of Open Quantum Systems

Tibor Rakovszky, Sarang Gopalakrishnan, Curt W. von Keyserlingk

The steady states of dynamical processes can exhibit stable nontrivial phases, which can also serve as fault-tolerant classical or quantum memories. For Markovian quantum (classical) dynamics, these steady states are extremal eigenvectors of the non-Hermitian operators that generate the dynamics, i.e., quantum channels (Markov chains). However, since these operators are non-Hermitian, their spectra are an unreliable guide to dynamical relaxation timescales or to stability against perturbations. We propose an alternative dynamical criterion for a steady state to be in a stable phase, which we name uniformity: Informally, our criterion amounts to requiring that, under sufficiently small local perturbations of the dynamics, the unperturbed and perturbed steady states are related to one another by a finite-time dissipative evolution. We show that this criterion implies many of the properties one would want from any reasonable definition of a phase. We prove that uniformity is satisfied in a canonical classical cellular automaton, and we provide numerical evidence that the gap determines the relaxation rate between nearby steady states in the same phase, a situation we conjecture holds generically whenever uniformity is satisfied. We further conjecture some sufficient conditions for a channel to exhibit uniformity and therefore stability. Published by the American Physical Society 2024

arXiv:2308.15495•Physical Review X•Nov 4, 2024•55 citations

The generalized Lyapunov theorem and its application to quantum channels

Daniel Klaus Burgarth, Vittorio Giovannetti

We give a simple and physically intuitive necessary and sufficient condition for a map acting on a compact metric space to be mixing (i.e. infinitely many applications of the map transfer any input into a fixed convergency point). This is a generalization of the 'Lyapunov direct method'. First we prove this theorem in topological spaces and for arbitrary continuous maps. Finally we apply our theorem to maps which are relevant in open quantum systems and quantum information, namely quantum channels. In this context, we also discuss the relations between mixing and ergodicity (i.e. the property that there exists only a single input state which is left invariant by a single application of the map) showing that the two are equivalent when the invariant point of the ergodic map is pure.

arXiv:quant-ph/0605197•New Journal of Physics•May 23, 2007•44 citations
We investigate the stability of quantum Markov processes with respect to perturbations of their transition maps. In the first part, we introduce a condition number that measures the sensitivity of fixed points of a quantum channel to perturbations. We establish upper and lower bounds on this condition number in terms of subdominant eigenvalues of the transition map. In the second part, we consider quantum Markov processes that converge to a unique stationary state and we analyze the stability of the evolution at finite times. In this way we obtain a linear relation between the mixing time of a quantum Markov process and the sensitivity of its fixed point with respect to perturbations of the transition map.
Given a quantum channel and a state which satisfy a fixed point equation approximately (say, up to an error ε\varepsilonε), can one find a new channel and a state, which are respectively close to the original ones, such that they satisfy an exact fixed point equation? It is interesting to ask this question for different choices of constraints on the structures of the original channel and state, and requiring that these are also satisfied by the new channel and state. We affirmatively answer the above question, under fairly general assumptions on these structures, through a compactness argument. Additionally, for channels and states satisfying certain specific structures, we find explicit upper bounds on the distances between the pairs of channels (and states) in question. When these distances decay quickly (in a particular, desirable manner) as ε→0\varepsilon\to 0ε→0, we say that the original approximate fixed point equation is rapidly fixable. We establish rapid fixability, not only for general quantum channels, but also when the original and new channels are both required to be unitary, mixed unitary or unital. In contrast, for the case of bipartite quantum systems with channels acting trivially on one subsystem, we prove that approximate fixed point equations are not rapidly fixable. In this case, the distance to the closest channel (and state) which satisfy an exact fixed point equation can depend on the dimension of the quantum system in an undesirable way. We apply our results on approximate fixed point equations to the question of robustness of quantum Markov chains (QMC) and establish the following: For any tripartite quantum state, there exists a dimension-dependent upper bound on its distance to the set of QMCs, which decays to zero as the conditional mutual information of the state vanishes.
We derive upper and lower bounds on the convergence behavior of certain classes of one-parameter quantum dynamical semigroups. The classes we consider, consist of tensor product channels and of channels with commuting Liouvillians. We introduce the notion of cutoff phenomenon in the setting of quantum information theory, and show how it exemplifies the fact that the convergence of (quantum) stochastic processes is not solely governed by the spectral gap of the transition map. We apply the new methods to show that graph states can be prepared efficiently, albeit not in constant time, by dissipation, and give the exact scaling behavior of the time to stationarity.
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.
The steady states of dynamical processes can exhibit stable nontrivial phases, which can also serve as fault-tolerant classical or quantum memories. For Markovian quantum (classical) dynamics, these steady states are extremal eigenvectors of the non-Hermitian operators that generate the dynamics, i.e., quantum channels (Markov chains). However, since these operators are non-Hermitian, their spectra are an unreliable guide to dynamical relaxation timescales or to stability against perturbations. We propose an alternative dynamical criterion for a steady state to be in a stable phase, which we name uniformity: Informally, our criterion amounts to requiring that, under sufficiently small local perturbations of the dynamics, the unperturbed and perturbed steady states are related to one another by a finite-time dissipative evolution. We show that this criterion implies many of the properties one would want from any reasonable definition of a phase. We prove that uniformity is satisfied in a canonical classical cellular automaton, and we provide numerical evidence that the gap determines the relaxation rate between nearby steady states in the same phase, a situation we conjecture holds generically whenever uniformity is satisfied. We further conjecture some sufficient conditions for a channel to exhibit uniformity and therefore stability. Published by the American Physical Society 2024
We give a simple and physically intuitive necessary and sufficient condition for a map acting on a compact metric space to be mixing (i.e. infinitely many applications of the map transfer any input into a fixed convergency point). This is a generalization of the 'Lyapunov direct method'. First we prove this theorem in topological spaces and for arbitrary continuous maps. Finally we apply our theorem to maps which are relevant in open quantum systems and quantum information, namely quantum channels. In this context, we also discuss the relations between mixing and ergodicity (i.e. the property that there exists only a single input state which is left invariant by a single application of the map) showing that the two are equivalent when the invariant point of the ergodic map is pure.