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:2402.15878 · Journal of Physics A Mathematical and Theoretical

One-dimensional continuous-time quantum Markov chains: qubit probabilities and measures

Manuel D. de la Iglesia, Carlos F. Lardizabal

Published Jun 25, 2024• 2 citations
arXivHTMLPDF

Abstract

Abstract Quantum Markov chains (QMCs) are positive maps on a trace-class space describing open quantum dynamics on graphs. Such objects have a statistical resemblance with classical random walks, while at the same time they allow for internal (quantum) degrees of freedom. In this work we study continuous-time QMCs on the integer line, half-line and finite segments, so that we are able to obtain exact probability calculations in terms of the associated matrix-valued orthogonal polynomials and measures. The methods employed here are applicable to a wide range of settings, but we will restrict ourselves to classes of examples for which the Lindblad generators are induced by a single positive map, and such that the Stieltjes transforms of the measures and their inverses can be calculated explicitly.

DOI
10.1088/1751-8121/ad5bcb

Related papers

Quantum Markov processes on graphs, monitoring and hitting times

Carlos F. Lardizabal

We make use of matrix representations of completely positive maps in order to study open quantum dynamics on graphs, with emphasis on quantum walks and the associated trajectories obtained via a monitoring of the position. We discuss the discrete and continuous time setting and consider the statistics of particles located on a vertex with some internal degree of freedom. Other classes of semigroup generators, such as graph-induced generators are also considered. In the case of primitive quantum channels we present expressions of the mean hitting time for a particle to reach a vertex in terms of a quantum version of the fundamental matrix, thus extending recent results in the setting of open quantum random walks. An open quantum version of Kac's Lemma for the expected return time is discussed. By considering appropriate block matrix expressions we are able to make computations in terms of matrix-valued transition rates, in analogy with the notion of rates from classical continuous-time Markov chains. Also inspired by the classical case a recurrence criterion for the continuous time open walk setting is presented.

arXiv:1801.09578•Jan 29, 2018•1 citation

On the Structure of Quantum Markov Chains on Cayley Trees Associated with Open Quantum Random Walks

Abdessatar Souissi, Tarek Hamdi, Farrukh Maksutovich Mukhamedov +1 more

Quantum Markov chains (QMCs) and open quantum random walks (OQRWs) represent different quantum extensions of the classical Markov chain framework. QMCs stand as a more profound layer within the realm of Markovian dynamics. The exploration of both QMCs and OQRWs has been a predominant focus over the past decade. Recently, a significant connection between QMCs and OQRWs has been forged, yielding valuable applications. This bridge is particularly impactful when studying QMCs on tree structures, where it intersects with the realm of phase transitions in models naturally arising from quantum statistical mechanics. Furthermore, it aids in elucidating statistical properties, such as recurrence and clustering. The objective of this paper centers around delving into the intricate structure of QMCs on Cayley trees in relation to OQRWs. The foundational elements of this class of QMCs are built upon using classical probability measures that encompass the hierarchical nature of Cayley trees. This exploration unveils the pivotal role that the dynamics of OQRWs play in shaping the behavior of the Markov chains under consideration. Moreover, the analysis extends to their classical counterparts. The findings are further underscored by the examination of notable examples, contributing to a comprehensive understanding of the outcomes.

Axioms•Sep 7, 2023•4 citations

Open quantum random walks, quantum Markov chains and recurrence

Ameur Dhahri, Farrukh Maksutovich Mukhamedov

In the present paper, we construct QMCs (Quantum Markov Chains) associated with Open Quantum Random Walks such that the transition operator of the chain is defined by OQRW and the restriction of QMC to the commutative subalgebra coincides with the distribution [Formula: see text] of OQRW. This sheds new light on some properties of the measure [Formula: see text]. As an example, we simply mention that the measure can be considered as a distribution of some functions of certain Markov processes. Furthermore, we study several properties of QMC and associated measures. A new notion of [Formula: see text]-recurrence of QMC is studied, and the relations between the concepts of recurrence introduced in this paper and the existing ones are established.

arXiv:1608.01065•Reviews in Mathematical Physics•Jan 23, 2019•35 citations

Spectral quantization of discrete random walks on half-line and orthogonal polynomials on the unit circle

Adam Doliwa, Artur Siemaszko

Abstract We define quantization scheme for discrete-time random walks on the half-line consistent with Szegedy’s quantization of finite Markov chains. Motivated by the Karlin and McGregor description of discrete-time random walks in terms of polynomials orthogonal with respect to a measure with support in the segment $$[-1,1]$$ [ - 1 , 1 ] , we represent the unitary evolution operator of the quantum walk in terms of orthogonal polynomials on the unit circle. We find the relation between transition probabilities of the random walk with the Verblunsky coefficients of the corresponding polynomials of the quantum walk. We show that the both polynomials systems and their measures are connected by the classical Szegő map. Our scheme can be applied to arbitrary Karlin and McGregor random walks and generalizes the so-called Cantero–Grünbaum–Moral–Velázquez method. We illustrate our approach on example of random walks related to the Jacobi polynomials. Then we study quantization of random walks with constant transition probabilities where the corresponding polynomials on the unit circle have two-periodic real Verblunsky coefficients. We present geometric construction of the spectrum of such polynomials (in the general complex case) which generalizes the known construction for the Geronimus polynomials. In the Appendix, we present the explicit form, in terms of Chebyshev polynomials of the second kind, of polynomials orthogonal on the unit circle and polynomials orthogonal on the real line with coefficients of arbitrary period.

arXiv:2306.12265•Quantum Information Processing•Nov 25, 2024•1 citation

Open Quantum Random Walks and Quantum Markov chains on Trees I: Phase transitions

Farrukh Maksutovich Mukhamedov, Abdessatar Souissi, Tarek Hamdi

In the present paper, we construct QMC (Quantum Markov Chains) associated with Open Quantum Random Walks such that the transition operator of the chain is defined by OQRW and the restriction of QMC to the commutative subalgebra coincides with the distribution [Formula: see text] of OQRW. However, we are going to look at the probability distribution as a Markov field over the Cayley tree. Such kind of consideration allows us to investigate phase transition phenomena associated for OQRW within QMC scheme. Furthermore, we first propose a new construction of QMC on trees, which is an extension of QMC considered in [10]. Using such a construction, we are able to construct QMCs on tress associated with OQRW. Our investigation leads to the detection of the phase transition phenomena within the proposed scheme. This kind of phenomena appears for the first time in this direction. Moreover, mean entropies of QMCs are calculated.

arXiv:2208.03770•Open Systems & Information Dynamics•Mar 1, 2022•15 citations

Continuous-time quantum Markov chains and discretizations of p -adic Schrödinger equations: comparisons and simulations

Wilson A. Zúñiga-Galindo, L. F. Chacón-Cortés

Abstract Continuous-time quantum walks (CTQWs) are a fundamental tool in the development of quantum algorithms. Recently, it was shown that discretizations of p -adic Schrödinger equations give rise to continuous-time quantum Markov chains (CTQMCs); this type of Markov chain includes the CTQWs constructed using adjacency matrices of graphs as a particular case. Unlike classical continuous-time Markov chains (CTMCs), the CTQMCs studied here do not satisfy the classical Chapman–Kolmogorov equation; this is a genuine quantum effect, due to the fact that the underlying unitary evolution composes at the level of probability amplitudes rather than probabilities, and we make precise the sense in which the term ‘quantum Markov chain’ is used. In this paper, we study a large class of p -adic Schrödinger equations and the associated CTQMCs by comparing them with p -adic heat equations and the associated CTMCs. The comparison is done by a mathematical study of the mentioned equations, which requires, for instance, solving the initial value problems attached to the mentioned equations, and through numerical simulations. We conducted multiple simulations, including numerical approximations of the limiting distribution. Our simulations show that the limiting distribution of quantum Markov chains is greater than the stationary probability of their classical counterparts, for a large class of CTQMCs.

arXiv:2508.06712•Journal of Statistical Mechanics Theory and Experiment•Sep 1, 2026•7 citations
Abstract Quantum Markov chains (QMCs) are positive maps on a trace-class space describing open quantum dynamics on graphs. Such objects have a statistical resemblance with classical random walks, while at the same time they allow for internal (quantum) degrees of freedom. In this work we study continuous-time QMCs on the integer line, half-line and finite segments, so that we are able to obtain exact probability calculations in terms of the associated matrix-valued orthogonal polynomials and measures. The methods employed here are applicable to a wide range of settings, but we will restrict ourselves to classes of examples for which the Lindblad generators are induced by a single positive map, and such that the Stieltjes transforms of the measures and their inverses can be calculated explicitly.
We make use of matrix representations of completely positive maps in order to study open quantum dynamics on graphs, with emphasis on quantum walks and the associated trajectories obtained via a monitoring of the position. We discuss the discrete and continuous time setting and consider the statistics of particles located on a vertex with some internal degree of freedom. Other classes of semigroup generators, such as graph-induced generators are also considered. In the case of primitive quantum channels we present expressions of the mean hitting time for a particle to reach a vertex in terms of a quantum version of the fundamental matrix, thus extending recent results in the setting of open quantum random walks. An open quantum version of Kac's Lemma for the expected return time is discussed. By considering appropriate block matrix expressions we are able to make computations in terms of matrix-valued transition rates, in analogy with the notion of rates from classical continuous-time Markov chains. Also inspired by the classical case a recurrence criterion for the continuous time open walk setting is presented.
Quantum Markov chains (QMCs) and open quantum random walks (OQRWs) represent different quantum extensions of the classical Markov chain framework. QMCs stand as a more profound layer within the realm of Markovian dynamics. The exploration of both QMCs and OQRWs has been a predominant focus over the past decade. Recently, a significant connection between QMCs and OQRWs has been forged, yielding valuable applications. This bridge is particularly impactful when studying QMCs on tree structures, where it intersects with the realm of phase transitions in models naturally arising from quantum statistical mechanics. Furthermore, it aids in elucidating statistical properties, such as recurrence and clustering. The objective of this paper centers around delving into the intricate structure of QMCs on Cayley trees in relation to OQRWs. The foundational elements of this class of QMCs are built upon using classical probability measures that encompass the hierarchical nature of Cayley trees. This exploration unveils the pivotal role that the dynamics of OQRWs play in shaping the behavior of the Markov chains under consideration. Moreover, the analysis extends to their classical counterparts. The findings are further underscored by the examination of notable examples, contributing to a comprehensive understanding of the outcomes.
In the present paper, we construct QMCs (Quantum Markov Chains) associated with Open Quantum Random Walks such that the transition operator of the chain is defined by OQRW and the restriction of QMC to the commutative subalgebra coincides with the distribution [Formula: see text] of OQRW. This sheds new light on some properties of the measure [Formula: see text]. As an example, we simply mention that the measure can be considered as a distribution of some functions of certain Markov processes. Furthermore, we study several properties of QMC and associated measures. A new notion of [Formula: see text]-recurrence of QMC is studied, and the relations between the concepts of recurrence introduced in this paper and the existing ones are established.
Abstract We define quantization scheme for discrete-time random walks on the half-line consistent with Szegedy’s quantization of finite Markov chains. Motivated by the Karlin and McGregor description of discrete-time random walks in terms of polynomials orthogonal with respect to a measure with support in the segment [−1,1][-1,1][−1,1] [ - 1 , 1 ] , we represent the unitary evolution operator of the quantum walk in terms of orthogonal polynomials on the unit circle. We find the relation between transition probabilities of the random walk with the Verblunsky coefficients of the corresponding polynomials of the quantum walk. We show that the both polynomials systems and their measures are connected by the classical Szegő map. Our scheme can be applied to arbitrary Karlin and McGregor random walks and generalizes the so-called Cantero–Grünbaum–Moral–Velázquez method. We illustrate our approach on example of random walks related to the Jacobi polynomials. Then we study quantization of random walks with constant transition probabilities where the corresponding polynomials on the unit circle have two-periodic real Verblunsky coefficients. We present geometric construction of the spectrum of such polynomials (in the general complex case) which generalizes the known construction for the Geronimus polynomials. In the Appendix, we present the explicit form, in terms of Chebyshev polynomials of the second kind, of polynomials orthogonal on the unit circle and polynomials orthogonal on the real line with coefficients of arbitrary period.
In the present paper, we construct QMC (Quantum Markov Chains) associated with Open Quantum Random Walks such that the transition operator of the chain is defined by OQRW and the restriction of QMC to the commutative subalgebra coincides with the distribution [Formula: see text] of OQRW. However, we are going to look at the probability distribution as a Markov field over the Cayley tree. Such kind of consideration allows us to investigate phase transition phenomena associated for OQRW within QMC scheme. Furthermore, we first propose a new construction of QMC on trees, which is an extension of QMC considered in [10]. Using such a construction, we are able to construct QMCs on tress associated with OQRW. Our investigation leads to the detection of the phase transition phenomena within the proposed scheme. This kind of phenomena appears for the first time in this direction. Moreover, mean entropies of QMCs are calculated.
Abstract Continuous-time quantum walks (CTQWs) are a fundamental tool in the development of quantum algorithms. Recently, it was shown that discretizations of p -adic Schrödinger equations give rise to continuous-time quantum Markov chains (CTQMCs); this type of Markov chain includes the CTQWs constructed using adjacency matrices of graphs as a particular case. Unlike classical continuous-time Markov chains (CTMCs), the CTQMCs studied here do not satisfy the classical Chapman–Kolmogorov equation; this is a genuine quantum effect, due to the fact that the underlying unitary evolution composes at the level of probability amplitudes rather than probabilities, and we make precise the sense in which the term ‘quantum Markov chain’ is used. In this paper, we study a large class of p -adic Schrödinger equations and the associated CTQMCs by comparing them with p -adic heat equations and the associated CTMCs. The comparison is done by a mathematical study of the mentioned equations, which requires, for instance, solving the initial value problems attached to the mentioned equations, and through numerical simulations. We conducted multiple simulations, including numerical approximations of the limiting distribution. Our simulations show that the limiting distribution of quantum Markov chains is greater than the stationary probability of their classical counterparts, for a large class of CTQMCs.