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

Nonhomogeneous quantum Markov chains and a notion of ergodicity

Carlos F. Lardizabal, Rafael Rigão Souza

Published Apr 21, 2015• 1 citation
arXivHTMLPDF

Abstract

Motivated by a model presented by S. Gudder, we study a quantum generalization of Markov chains and discuss the relation between these maps and open quantum random walks, a class of quantum channels described by S. Attal et al. We consider processes which are nonhomogeneous in time, i.e., at each time step, a possibly distinct evolution kernel. Inspired by a spectral technique described by L. Saloff-Coste and J. Zúñiga, we define a notion of ergodicity for nonhomogeneous quantum Markov chains and describe a criterion for ergodicity of such objects in terms of singular values. As a consequence we obtain a quantum version of the classical probability result concerning the behavior of the columns (or rows) of the iterates of a stochastic matrix induced by a finite, irreducible, aperiodic Markov chain. We are also able to relate the ergodic property presented here with the notions of weak and uniform ergodicity known in the literature of noncommutative $L^1$-spaces.

DOI
10.48550/arxiv.1504.05398

Related papers

Markov properties of partially open quantum random walks

Yuan Bao Kang

In this paper, we first construct (nonhomogeneous) quantum Markov chains (QMCs, for short) associated with partially open quantum random walks (POQRWs, for short). We then focus on the study of the analogs of irreducibility, period, and ergodic behavior of POQRWs by QMCs. Moreover, we get the characterization of invariant states of POQRWs via QMCs.

Journal of Mathematical Physics•Mar 1, 2023•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

Reducibility and irreducibility of open quantum random walks: A quantum Markov chain approach

Ameur Dhahri, Chul Ki Ko, Hyun Jae Yoo

In this paper we construct (nonhomogeneous) quantum Markov chains associated with open quantum random walks. We then discuss the reducibility and irreducibility of open quantum random walks via the corresponding quantum Markov chains. The quantum Markov chain was introduced by Accardi by using transition expectation, and the construction of the quantum Markov chains for the open quantum random walks was introduced by Dhahri and Mukhamedov. Here we construct nonhomogeneous quantum Markov chains for the open quantum random walks so that we can naturally express the evolution of any open quantum random walk by the corresponding quantum Markov chain. We provide with some examples. In particular, we show that the classical Markov chains are reconstructed as quantum Markov chains as well and the reducibility and irreducibility properties of classical Markov chains can be investigated in the language of quantum Markov chains.

•Aug 10, 2018•0 citations

Probability distributions for Markov chain based quantum walks

Radhakrishnan Balu, Chaobin Liu, Salvador Elías Venegas-Andraca

Abstract We analyze the probability distributions of the quantum walks induced from Markov chains by Szegedy (2004). The first part of this paper is devoted to the quantum walks induced from finite state Markov chains. It is shown that the probability distribution on the states of the underlying Markov chain is always convergent in the Cesaro sense. In particular, we deduce that the limiting distribution is uniform if the transition matrix is symmetric. In the case of a non-symmetric Markov chain, we exemplify that the limiting distribution of the quantum walk is not necessarily identical with the stationary distribution of the underlying irreducible Markov chain. The Szegedy scheme can be extended to infinite state Markov chains (random walks). In the second part, we formulate the quantum walk induced from a lazy random walk on the line. We then obtain the weak limit of the quantum walk. It is noted that the current quantum walk appears to spread faster than its counterpart-quantum walk on the line driven by the Grover coin discussed in literature. The paper closes with an outlook on possible future directions.

arXiv:1703.04131•Journal of Physics A Mathematical and Theoretical•Nov 10, 2017•14 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

Open quantum random walks and the mean hitting time formula

Carlos F. Lardizabal

We make use of the Open Quantum Random Walk setting due to S. Attal, F. Petruccione, C. Sabot and I. Sinayskiy in order to discuss hitting times and a quantum version of the Mean Hitting Time Formula from classical probability theory. We study an open quantum notion of hitting probability on a finite collection of sites and with this we are able to describe the problem in terms of linear maps and its matrix representations. After setting an open quantum version of the fundamental matrix for ergodic Markov chains we are able to prove our main result and as consequence a version of the Random Target Lemma. We also study a mean hitting time formula in terms of the minimal polynomial associated to the matrix representation of the quantum walk. We discuss applications of the results to open quantum dynamics on graphs together with open questions.

arXiv:1603.06255•Quantum Information and Computation•Jan 1, 2017•10 citations
Motivated by a model presented by S. Gudder, we study a quantum generalization of Markov chains and discuss the relation between these maps and open quantum random walks, a class of quantum channels described by S. Attal et al. We consider processes which are nonhomogeneous in time, i.e., at each time step, a possibly distinct evolution kernel. Inspired by a spectral technique described by L. Saloff-Coste and J. Zúñiga, we define a notion of ergodicity for nonhomogeneous quantum Markov chains and describe a criterion for ergodicity of such objects in terms of singular values. As a consequence we obtain a quantum version of the classical probability result concerning the behavior of the columns (or rows) of the iterates of a stochastic matrix induced by a finite, irreducible, aperiodic Markov chain. We are also able to relate the ergodic property presented here with the notions of weak and uniform ergodicity known in the literature of noncommutative L1L^1L1-spaces.
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.
In this paper we construct (nonhomogeneous) quantum Markov chains associated with open quantum random walks. We then discuss the reducibility and irreducibility of open quantum random walks via the corresponding quantum Markov chains. The quantum Markov chain was introduced by Accardi by using transition expectation, and the construction of the quantum Markov chains for the open quantum random walks was introduced by Dhahri and Mukhamedov. Here we construct nonhomogeneous quantum Markov chains for the open quantum random walks so that we can naturally express the evolution of any open quantum random walk by the corresponding quantum Markov chain. We provide with some examples. In particular, we show that the classical Markov chains are reconstructed as quantum Markov chains as well and the reducibility and irreducibility properties of classical Markov chains can be investigated in the language of quantum Markov chains.
Abstract We analyze the probability distributions of the quantum walks induced from Markov chains by Szegedy (2004). The first part of this paper is devoted to the quantum walks induced from finite state Markov chains. It is shown that the probability distribution on the states of the underlying Markov chain is always convergent in the Cesaro sense. In particular, we deduce that the limiting distribution is uniform if the transition matrix is symmetric. In the case of a non-symmetric Markov chain, we exemplify that the limiting distribution of the quantum walk is not necessarily identical with the stationary distribution of the underlying irreducible Markov chain. The Szegedy scheme can be extended to infinite state Markov chains (random walks). In the second part, we formulate the quantum walk induced from a lazy random walk on the line. We then obtain the weak limit of the quantum walk. It is noted that the current quantum walk appears to spread faster than its counterpart-quantum walk on the line driven by the Grover coin discussed in literature. The paper closes with an outlook on possible future directions.
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.
We make use of the Open Quantum Random Walk setting due to S. Attal, F. Petruccione, C. Sabot and I. Sinayskiy in order to discuss hitting times and a quantum version of the Mean Hitting Time Formula from classical probability theory. We study an open quantum notion of hitting probability on a finite collection of sites and with this we are able to describe the problem in terms of linear maps and its matrix representations. After setting an open quantum version of the fundamental matrix for ergodic Markov chains we are able to prove our main result and as consequence a version of the Random Target Lemma. We also study a mean hitting time formula in terms of the minimal polynomial associated to the matrix representation of the quantum walk. We discuss applications of the results to open quantum dynamics on graphs together with open questions.