We consider recurrence to the initial state after repeated actions of a quantum channel. After each iteration a projective measurement is applied to check recurrence. The corresponding return time is known to be an integer for the special case of unital channels, including unitary channels. We prove that for a more general class of quantum channels the expected return time can be given as the inverse of the weight of the initial state in the steady state. This statement is a generalization of the Kac lemma for classical Markov chains.
We consider recurrence to the initial state after repeated actions of a quantum channel. After each iteration a projective measurement is applied to check recurrence. The corresponding return time is known to be an integer for the special case of unital channels, including unitary channels. We prove that for a more general class of quantum channels the expected return time can be given as the inverse of the weight of the initial state in the steady state. This statement is a generalization of the Kac lemma for classical Markov chains.
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.
The Bayesian inverse of a quantum channel E is a channel F in the reverse direction of E that yields time-symmetric correlations for sequential measurements performed on open quantum systems. Such an operational form of time-reversal symmetry for open quantum systems is quite remarkable, as the dynamics of open quantum systems are inherently irreversible due to system-environment interactions. Similar to the Petz map, a Bayesian inverse F is defined with respect to a fiducial reference state ρ for the channel E. However, Bayesian inverses do not always exist, and it is often a non-trivial task to determine the set of states ρ for which a Bayesian inverse of E exists. In this work, we solve the general problem of quantum Bayesian inversion for unital channels acting on a single qubit. Our analysis is streamlined by demonstrating that finding a Bayesian inverse for a unital qubit channel may be reduced to finding a Bayesian inverse of a Pauli channel, which is simply a mixture of unitary channels associated with the Pauli matrices. As such, we provide a complete description of when operational time-reversal symmetry is attainable for sequential measurements of a single qubit in the presence of unital noise.
We introduce "amplitude Markov chains" associated to the matrix elements, in a fixed basis, of a unitary operator (discrete quantum dynamics).We prove the amplitude analogue of the relation between the recurrence probability of a state of a classical Markov chain and its first return probability.This formula is then used to prove the universal property, mentioned in the title, which emphasizes a striking difference between the amplitude Markov chains and their classical analogues.This property is probably the statistical reflex of the reversibility of the quantum evolution.Finally note that, in the finite dimensional case, which is the most important one for the applications to quantum information, the word "almost" in the title can be omitted.
The Poincaré recurrence theorem shows that conservative systems in a bounded region of phase space eventually return arbitrarily close to their initial state after a finite amount of time. An analogous behavior occurs in certain quantum systems where quantum states can recur after sufficiently long unitary evolution, a phenomenon known as quantum recurrence. Periodically driven (i.e. Floquet) quantum systems in particular exhibit complex dynamics even in small dimensions, motivating the study of how interactions and Hamiltonian structure affect recurrence behavior. While most studies treat recurrence in an approximate, distance-based sense, here we address the problem of {exact}, state-independent recurrences in a broad class of finite-dimensional Floquet systems, spanning both integrable and non-integrable models. Leveraging techniques from algebraic field theory, we construct an arithmetic framework that identifies all possible recurrence times by analyzing the cyclotomic structure of the Floquet unitary's spectrum. This computationally tractable approach yields both positive results, enumerating all candidate recurrence times, and definitive negative results, rigorously ruling out candidate recurrence times for a given set of Hamiltonian parameters. We further prove that rational Hamiltonian parameters do not, in general, guarantee exact recurrences, revealing a subtle interplay between system parameters and long-time dynamics. Our findings sharpen the theoretical understanding of quantum recurrences, clarify their relationship to quantum chaos, and highlight parameter regimes of special interest for quantum metrology and control.
The evolution of an isolated quantum system inevitably exhibits recurrence: the state returns to the vicinity of its initial condition after finite time. Despite its fundamental nature, a rigorous quantitative understanding of recurrence has been lacking. We establish upper bounds on the recurrence time, trec≲texit(ε)(1/ε)d, where d is the Hilbert-space dimension, ε the neighborhood size, and texit(ε) the escape time from this neighborhood. For pure states evolving under a Hamiltonian H, estimating texit is equivalent to an inverse quantum speed limit problem: finding upper bounds on the time a time-evolved state ψt needs to depart from the ε-vicinity of the initial state ψ0. We provide a partial solution, showing that under mild assumptions texit(ε)≈ε/Δ(H2), with Δ(H2) the Hamiltonian variance in ψ0. We show that our upper bound on trec is generically saturated for random Hamiltonians. Finally, we analyze the impact of coherence of the initial state in the eigenbasis of H on recurrence behavior.
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 L1-spaces.