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

Quantum Markov Networks and Commuting Hamiltonians

Winton Brown, David Poulin

Published Jun 4, 2012• 52 citations
arXivHTMLPDF

Abstract

Quantum Markov networks are a generalization of quantum Markov chains to arbitrary graphs. They provide a powerful classification of correlations in quantum many-body systems---complementing the area law at finite temperature---and are therefore useful to understand the powers and limitations of certain classes of simulation algorithms. Here, we extend the characterization of quantum Markov networks and in particular prove the equivalence of positive quantum Markov networks and Gibbs states of Hamiltonians that are the sum of local commuting terms on graphs containing no triangles. For more general graphs we demonstrate the equivalence between quantum Markov networks and Gibbs states of a class of Hamiltonians of intermediate complexity between commuting and general local Hamiltonians.

DOI
10.48550/arxiv.1206.0755

Related papers

Clustering of Conditional Mutual Information for Quantum Gibbs States above a Threshold Temperature

Tomotaka Kuwahara, Kohtaro Kato, Fernando G. S. L. Brandão

We prove that the quantum Gibbs states of spin systems above a certain threshold temperature are approximate quantum Markov networks, meaning that the conditional mutual information decays rapidly with distance. We demonstrate the exponential decay for short-ranged interacting systems and power-law decay for long-ranged interacting systems. Consequently, we establish the efficiency of quantum Gibbs sampling algorithms, a strong version of the area law, the quasilocality of effective Hamiltonians on subsystems, a clustering theorem for mutual information, and a polynomial-time algorithm for classical Gibbs state simulations.

arXiv:1910.09425•Physical Review Letters•Jun 1, 2020•77 citations

Virtual Quantum Markov Chains

Yu-Ao Chen, Chengkai Zhu, Keming He +2 more

Quantum Markov chains generalize classical Markov chains for random variables to the quantum realm and exhibit unique inherent properties, making them an important feature in quantum information theory. In this work, we propose the concept ofvirtual quantum Markov chains(VQMCs), focusing on scenarios where subsystems retain classical information about global systems from measurement statistics. As a generalization of quantum Markov chains, VQMCs characterize states where arbitrary global shadow information can be recovered from subsystems through local quantum operations and measurements. We present an algebraic characterization for virtual quantum Markov chains and show that the virtual quantum recovery is fully determined by the block matrices of a quantum state on its subsystems. Notably, we find a distinction between two classes of tripartite entanglement by showing that the W state is a VQMC while the GHZ state is not. Furthermore, we introduce the virtual non- Markovianity to quantify the non-Markovianity of a given quantum state which also assesses the optimal sampling overhead for virtually recovering this state. Our findings elucidate distinctions between quantum Markov chains and virtual quantum Markov chains, extending our understanding of quantum recovery to scenarios prioritizing classical information from measurement statistics.

arXiv:2312.02031•IEEE Transactions on Information Theory•May 8, 2025•2 citations

Discrete Quantum Markov Chains

Ulrich Faigle, Alexander Schönhuth

A framework for finite-dimensional quantum Markov chains on Hilbert spaces is introduced. Quantum Markov chains generalize both classical Markov chains with possibly hidden states and existing models of quantum walks on finite graphs. Quantum Markov chains are based on Markov operations that may be applied to quantum systems and include quantum measurements, for example. It is proved that quantum Markov chains are asymptotically stationary and hence possess ergodic and entropic properties. With a quantum Markov chain one may associate a quantum Markov process, which is a stochastic process in the classical sense. Generalized Markov chains allow a representation with respect to a generalized Markov source model with definite (but possibly hidden) states relative to which observables give rise to classical stochastic processes. It is demonstrated that this model allows for observables to violate Bell’s inequality.

•Nov 4, 2010•4 citations

Spectral Gap Bounds for Quantum Markov Semigroups via Correlation Decay

Lucia, Angelo, David Pérez-García, Antonio Pérez

Starting from an arbitrary full-rank state of a lattice quantum spin system, we define a "canonical purified Hamiltonian" and characterize its spectral gap in terms of a spatial mixing condition (or correlation decay) of the state. When the state considered is a Gibbs state of a local, commuting Hamiltonian at positive temperature, we show that the spectral gap of the canonical purified Hamiltonian provides a lower bound to the spectral gap of a large class of reversible generators of quantum Markov semigroup, including local and ergodic Davies generators. As an application of our construction, we show that the mixing condition is always satisfied for any finite-range 1D model, as well as by Kitaev's quantum double models.

arXiv:2505.08991•May 13, 2025•9 citations

Quantum Markov chains

Stanley Gudder

A new approach to quantum Markov chains is presented. We first define a transition operation matrix (TOM) as a matrix whose entries are completely positive maps whose column sums form a quantum operation. A quantum Markov chain is defined to be a pair (G,E) where G is a directed graph and E=[Eij] is a TOM whose entry Eij labels the edge from vertex j to vertex i. We think of the vertices of G as sites that a quantum system can occupy and Eij is the transition operation from site j to site i in one time step. The discrete dynamics of the system is obtained by iterating the TOM E. We next consider a special type of TOM called a transition effect matrix. In this case, there are two types of dynamics, a state dynamics and an operator dynamics. Although these two types are not identical, they are statistically equivalent. We next give examples that illustrate various properties of quantum Markov chains. We conclude by showing that our formalism generalizes the usual framework for quantum random walks.

Journal of Mathematical Physics•Jul 1, 2008•106 citations

The stationarity test: a framework for learning quantum many-body systems from their thermal states

Thiago Bergamaschi

The task of learning the Hamiltonian interactions governing a quantum system, given samples of its thermal (or 'Gibbs') states, is a foundational question at the intersection of quantum learning theory and many-body physics. In this paper, we draw connections to the quantum Gibbs sampling literature to introduce a natural learning algorithm we call the stationarity test: which simply "guesses" the Hamiltonian, and measures the rate-of-change of local observables, under the associated detailed-balanced quantum Markov chain [CKG23]. We leverage the stationarity test to address the following applications: 1. To give the first learning algorithm for the underlying interaction graph, i.e. structure learning, of lattice Hamiltonians at all temperatures, given copies of their Gibbs states. 2. To give the first learning algorithm for the coefficients of a lattice Hamiltonian, given only copies of its thermal metastable states, modeled as the "local minima" of the free energy. 3. In addition, we present a refinement to the recent area law for thermal metastable states [BCV25], which holds in the thermodynamic limit. Our learning algorithms are rigorous, time-efficient, and nearly sample-optimal in system size and accuracy. At a technical level, our arguments are based on new approximate locality and convexity properties for the quantum Fisher information of these Gibbs sampling algorithms.

quant-pharXiv:2610.01074•Oct 2, 2026•1 citation
Quantum Markov networks are a generalization of quantum Markov chains to arbitrary graphs. They provide a powerful classification of correlations in quantum many-body systems---complementing the area law at finite temperature---and are therefore useful to understand the powers and limitations of certain classes of simulation algorithms. Here, we extend the characterization of quantum Markov networks and in particular prove the equivalence of positive quantum Markov networks and Gibbs states of Hamiltonians that are the sum of local commuting terms on graphs containing no triangles. For more general graphs we demonstrate the equivalence between quantum Markov networks and Gibbs states of a class of Hamiltonians of intermediate complexity between commuting and general local Hamiltonians.
We prove that the quantum Gibbs states of spin systems above a certain threshold temperature are approximate quantum Markov networks, meaning that the conditional mutual information decays rapidly with distance. We demonstrate the exponential decay for short-ranged interacting systems and power-law decay for long-ranged interacting systems. Consequently, we establish the efficiency of quantum Gibbs sampling algorithms, a strong version of the area law, the quasilocality of effective Hamiltonians on subsystems, a clustering theorem for mutual information, and a polynomial-time algorithm for classical Gibbs state simulations.
Quantum Markov chains generalize classical Markov chains for random variables to the quantum realm and exhibit unique inherent properties, making them an important feature in quantum information theory. In this work, we propose the concept ofvirtual quantum Markov chains(VQMCs), focusing on scenarios where subsystems retain classical information about global systems from measurement statistics. As a generalization of quantum Markov chains, VQMCs characterize states where arbitrary global shadow information can be recovered from subsystems through local quantum operations and measurements. We present an algebraic characterization for virtual quantum Markov chains and show that the virtual quantum recovery is fully determined by the block matrices of a quantum state on its subsystems. Notably, we find a distinction between two classes of tripartite entanglement by showing that the W state is a VQMC while the GHZ state is not. Furthermore, we introduce the virtual non- Markovianity to quantify the non-Markovianity of a given quantum state which also assesses the optimal sampling overhead for virtually recovering this state. Our findings elucidate distinctions between quantum Markov chains and virtual quantum Markov chains, extending our understanding of quantum recovery to scenarios prioritizing classical information from measurement statistics.
A framework for finite-dimensional quantum Markov chains on Hilbert spaces is introduced. Quantum Markov chains generalize both classical Markov chains with possibly hidden states and existing models of quantum walks on finite graphs. Quantum Markov chains are based on Markov operations that may be applied to quantum systems and include quantum measurements, for example. It is proved that quantum Markov chains are asymptotically stationary and hence possess ergodic and entropic properties. With a quantum Markov chain one may associate a quantum Markov process, which is a stochastic process in the classical sense. Generalized Markov chains allow a representation with respect to a generalized Markov source model with definite (but possibly hidden) states relative to which observables give rise to classical stochastic processes. It is demonstrated that this model allows for observables to violate Bell’s inequality.
Starting from an arbitrary full-rank state of a lattice quantum spin system, we define a "canonical purified Hamiltonian" and characterize its spectral gap in terms of a spatial mixing condition (or correlation decay) of the state. When the state considered is a Gibbs state of a local, commuting Hamiltonian at positive temperature, we show that the spectral gap of the canonical purified Hamiltonian provides a lower bound to the spectral gap of a large class of reversible generators of quantum Markov semigroup, including local and ergodic Davies generators. As an application of our construction, we show that the mixing condition is always satisfied for any finite-range 1D model, as well as by Kitaev's quantum double models.
A new approach to quantum Markov chains is presented. We first define a transition operation matrix (TOM) as a matrix whose entries are completely positive maps whose column sums form a quantum operation. A quantum Markov chain is defined to be a pair (G,E) where G is a directed graph and E=[Eij] is a TOM whose entry Eij labels the edge from vertex j to vertex i. We think of the vertices of G as sites that a quantum system can occupy and Eij is the transition operation from site j to site i in one time step. The discrete dynamics of the system is obtained by iterating the TOM E. We next consider a special type of TOM called a transition effect matrix. In this case, there are two types of dynamics, a state dynamics and an operator dynamics. Although these two types are not identical, they are statistically equivalent. We next give examples that illustrate various properties of quantum Markov chains. We conclude by showing that our formalism generalizes the usual framework for quantum random walks.
The task of learning the Hamiltonian interactions governing a quantum system, given samples of its thermal (or 'Gibbs') states, is a foundational question at the intersection of quantum learning theory and many-body physics. In this paper, we draw connections to the quantum Gibbs sampling literature to introduce a natural learning algorithm we call the stationarity test: which simply "guesses" the Hamiltonian, and measures the rate-of-change of local observables, under the associated detailed-balanced quantum Markov chain [CKG23]. We leverage the stationarity test to address the following applications: 1. To give the first learning algorithm for the underlying interaction graph, i.e. structure learning, of lattice Hamiltonians at all temperatures, given copies of their Gibbs states. 2. To give the first learning algorithm for the coefficients of a lattice Hamiltonian, given only copies of its thermal metastable states, modeled as the "local minima" of the free energy. 3. In addition, we present a refinement to the recent area law for thermal metastable states [BCV25], which holds in the thermodynamic limit. Our learning algorithms are rigorous, time-efficient, and nearly sample-optimal in system size and accuracy. At a technical level, our arguments are based on new approximate locality and convexity properties for the quantum Fisher information of these Gibbs sampling algorithms.