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

International Journal of Quantum Information

Mean and variance for the visit time of absorbing quantum walks and channels

Lucas K. Moori, Carlos F. Lardizabal

Published Jan 24, 2026• 1 citation
Publisher

Abstract

While the expected time of first visit to a subspace under some quantum evolution is a relevant statistic, it is also important to confront this information with the associated variance, so that one may have a better understanding of how representative such means are. In this work, we study these matters in the context of quantum channels acting on finite-dimensional Hilbert spaces, and we provide practical methods for calculating the above data with respect to goal subspaces of interest. By considering an assumption which is strictly weaker than irreducibility, we are also able to consider unitary quantum walks. Our approach is based on the monitored evolution of positive, trace-preserving operators given by quantum Markov chains as described by Gudder. Then, given any channel and some goal subspace of interest, one may induce an absorbing chain in a natural way so that the monitored evolution of the original map can be examined.

DOI
10.1142/s021974992650005x

Related papers

Nonhomogeneous quantum Markov chains and a notion of ergodicity

Carlos F. Lardizabal, Rafael Rigão Souza

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.

arXiv:1504.05398•Apr 21, 2015•1 citation

Quantized recurrence time in unital iterated open quantum dynamics

P. Sinkovicz, Z. Kurucz, T. Kiss +1 more

The expected return time to the original state is a key concept characterizing systems obeying both classical or quantum dynamics. We consider iterated open quantum dynamical systems in finite-dimensional Hilbert spaces, a broad class of systems that includes classical Markov chains and unitary discrete-time quantum walks on networks. Starting from a pure state, the time evolution is induced by repeated applications of a superoperator (quantum channel) in each time step followed by a measurement to detect whether the system has returned to the original state. We prove that if the superoperator is unital in the part of the Hilbert space explored by the system, then the expectation value of the return time is an integer, equal to the dimension of this relevant Hilbert space. We illustrate our results on partially coherent quantum walks on finite graphs. Our work shows that the expected return time is a quantitative measure of the size of the part of the Hilbert space available to the system when the dynamics is started from a certain state.

arXiv:1411.0568•Physical Review A•Apr 9, 2015•22 citations

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

Manuel D. de la Iglesia, Carlos F. Lardizabal

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.

arXiv:2402.15878•Journal of Physics A Mathematical and Theoretical•Jun 25, 2024•2 citations

Quantized time in quantum walks under weak rank-K measurements

Klaus Ziegler

Measurements can be used to monitor the evolution of quantum systems and may lead to a universally quantized time statistics. It is known that the mean return time is quantized for strong and indirect monitoring through the winding number of the return amplitude in a one-dimensional space. Here we discuss that under multi-channel strong or indirect monitoring, where the latter is achieved through ancilla coupling, the mean return time of a quantum walk in the projected subspace is also quantized. This reflects a universal time quantization for a higher dimensional evolution.

quant-pharXiv:2606.13552•Jun 12, 2026•0 citations

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

Quantum Searching on Markov Chains - The Complete Graph

Min-Ho Lee, Nark Nyul Choi, Gregor Tanner

We will give an introduction into the quantum search algorithms on the Markov chains introduced by Szegedy and recent modifications based on partially absorbing Markov chains due to Krovi et al.Algorithmica 74, 851 (2016) It has been shown that a quantum search can find a set of marked vertices quadratically faster (in units of the hitting time) for any reversible Markov chain.The proofs are based on certain properties of the stationary state of the partially absorbing walk and rely on quantum phase estimation techniques.We will offer an alternative view of the underlying mechanism of the quantum search based on spectral properties of the quantum walk operator.By considering the complete graph as an example, we identify the relevant two-level quantum subspace leading to a Grover-like rotation in the underlying vector space.

Acta Physica Polonica A•Dec 1, 2021•3 citations
While the expected time of first visit to a subspace under some quantum evolution is a relevant statistic, it is also important to confront this information with the associated variance, so that one may have a better understanding of how representative such means are. In this work, we study these matters in the context of quantum channels acting on finite-dimensional Hilbert spaces, and we provide practical methods for calculating the above data with respect to goal subspaces of interest. By considering an assumption which is strictly weaker than irreducibility, we are also able to consider unitary quantum walks. Our approach is based on the monitored evolution of positive, trace-preserving operators given by quantum Markov chains as described by Gudder. Then, given any channel and some goal subspace of interest, one may induce an absorbing chain in a natural way so that the monitored evolution of the original map can be examined.
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.
The expected return time to the original state is a key concept characterizing systems obeying both classical or quantum dynamics. We consider iterated open quantum dynamical systems in finite-dimensional Hilbert spaces, a broad class of systems that includes classical Markov chains and unitary discrete-time quantum walks on networks. Starting from a pure state, the time evolution is induced by repeated applications of a superoperator (quantum channel) in each time step followed by a measurement to detect whether the system has returned to the original state. We prove that if the superoperator is unital in the part of the Hilbert space explored by the system, then the expectation value of the return time is an integer, equal to the dimension of this relevant Hilbert space. We illustrate our results on partially coherent quantum walks on finite graphs. Our work shows that the expected return time is a quantitative measure of the size of the part of the Hilbert space available to the system when the dynamics is started from a certain state.
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.
Measurements can be used to monitor the evolution of quantum systems and may lead to a universally quantized time statistics. It is known that the mean return time is quantized for strong and indirect monitoring through the winding number of the return amplitude in a one-dimensional space. Here we discuss that under multi-channel strong or indirect monitoring, where the latter is achieved through ancilla coupling, the mean return time of a quantum walk in the projected subspace is also quantized. This reflects a universal time quantization for a higher dimensional evolution.
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.
We will give an introduction into the quantum search algorithms on the Markov chains introduced by Szegedy and recent modifications based on partially absorbing Markov chains due to Krovi et al.Algorithmica 74, 851 (2016) It has been shown that a quantum search can find a set of marked vertices quadratically faster (in units of the hitting time) for any reversible Markov chain.The proofs are based on certain properties of the stationary state of the partially absorbing walk and rely on quantum phase estimation techniques.We will offer an alternative view of the underlying mechanism of the quantum search based on spectral properties of the quantum walk operator.By considering the complete graph as an example, we identify the relevant two-level quantum subspace leading to a Grover-like rotation in the underlying vector space.