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

Quantum Information Processing

Ergodicity and limit distribution of open quantum walks on the periodic graphs

Chul Ki Ko, Hyun Jae Yoo

Published Apr 23, 2024• 0 citations
Publisher
DOI
10.1007/s11128-024-04367-0

Related papers

141Limiting distributions of ergodic continuous-time quantum walks on periodic graphs

Anne Boutet de Monvel, Krishan Kumar, Mostafa Sabri

De Gruyter eBooks•Mar 2, 2026•0 citations

Open Quantum Random Walks: Reducibility, Period, Ergodic Properties

Raffaella Carbone, Yan Pautrat

arXiv:1405.2214•Annales Henri Poincaré•Feb 18, 2015•60 citations

Entropy production of quantum Markov semigroup associated with open quantum walks on the periodic graphs

Chul Ki Ko, Hyun Jae Yoo

Quantum Information Processing•Jan 19, 2023•1 citation

Open Quantum Random Walks: Ergodicity, Hitting Times, Gambler’s Ruin and Potential Theory

Carlos F. Lardizabal, Rafael R. Souza

arXiv:1510.03454•Journal of Statistical Physics•Jul 11, 2016•21 citations

Limit distribution of a time-dependent 3-period quantum walk

拓也 町田

IEICE technical report. Speech•Jun 11, 2015•0 citations

Quantum-driven sampling of the quasi-uniform distribution via quantum walks

Marco Radaelli, Claudia Benedetti, Stefano Olivares

We investigate the use of discrete-time quantum walks to sample from an almost-uniform distribution, in the absence of any external source of randomness. Integers are encoded on the vertices of a cycle graph, and a quantum walker evolves for a fixed number of steps before its position is measured and recorded. The walker is then reset to the measured site, and the procedure is iterated to produce the sequence of random numbers. We show that when the quantum walk parameters, such as the coin operator and initial state, satisfy the conditions of the ergodic theorem for random walks on finite groups, the resulting sequence converges asymptotically to the uniform distribution. Although correlations between successive outcomes are unavoidable, they can be significantly reduced by a suitable choice of the evolution time. By analyzing the iterated convolution of the quantum walk transition probability and exploiting the ergodic theorem, we demonstrate convergence of the marginal distributions toward the uniform distribution in the asymptotic limit.

quant-pharXiv:2511.08293•Nov 12, 2025•0 citations
We investigate the use of discrete-time quantum walks to sample from an almost-uniform distribution, in the absence of any external source of randomness. Integers are encoded on the vertices of a cycle graph, and a quantum walker evolves for a fixed number of steps before its position is measured and recorded. The walker is then reset to the measured site, and the procedure is iterated to produce the sequence of random numbers. We show that when the quantum walk parameters, such as the coin operator and initial state, satisfy the conditions of the ergodic theorem for random walks on finite groups, the resulting sequence converges asymptotically to the uniform distribution. Although correlations between successive outcomes are unavoidable, they can be significantly reduced by a suitable choice of the evolution time. By analyzing the iterated convolution of the quantum walk transition probability and exploiting the ergodic theorem, we demonstrate convergence of the marginal distributions toward the uniform distribution in the asymptotic limit.