Nonhomogeneous quantum Markov chains and a notion of ergodicity
Carlos F. Lardizabal, Rafael R. Souza

TL;DR
This paper introduces a quantum generalization of nonhomogeneous Markov chains, defining a new ergodicity concept and providing criteria based on spectral analysis, extending classical results to the quantum setting.
Contribution
It proposes a novel notion of ergodicity for nonhomogeneous quantum Markov chains and offers spectral criteria for their ergodic behavior, connecting to existing quantum ergodicity concepts.
Findings
Defined a quantum ergodicity criterion using singular values.
Extended classical Markov chain results to quantum nonhomogeneous processes.
Linked quantum ergodicity with weak and uniform ergodicity in noncommutative spaces.
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\'u\~niga, 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…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture · Markov Chains and Monte Carlo Methods · Graph theory and applications
