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:1207.5257 · Reports on Mathematical Physics

Discrete Randomness in Discrete Time Quantum Walk: Study Via Stochastic Averaging

Demosthenes Ellinas, Anthony J. Bracken, I. Smyrnakis

Published Oct 1, 2012• 1 citation
arXivHTMLPDF
DOI
10.1016/s0034-4877(12)60041-x

Related papers

Time averaged distribution of a discrete-time quantum walk on the path

Yusuke Ide, Norio Konno, Etsuo Segawa

arXiv:1112.4036•Quantum Information Processing•May 28, 2012•17 citations

One-dimensional discrete-time quantum walks on random environments

Norio Konno

arXiv:0904.0392•Quantum Information Processing•May 26, 2009•63 citations

The average search probabilities of discrete-time quantum walks

Hanmeng Zhan

arXiv:2108.09818•Quantum Information Processing•Sep 29, 2022•1 citation

Localization of discrete time quantum walks on the glued trees

Yusuke Ide, Norio Konno, Etsuo Segawa +1 more

In this paper, we consider the time averaged distribution of discrete time quantum walks on the glued trees. In order to analyse the walks on the glued trees, we consider a reduction to the walks on path graphs. Using a spectral analysis of the Jacobi matrices defined by the corresponding random walks on the path graphs, we have spectral decomposition of the time evolution operator of the quantum walks. We find significant contributions of the eigenvalues $\pm 1$ of the Jacobi matrices to the time averaged limit distribution of the quantum walks. As a consequence we obtain lower bounds of the time averaged distribution.

•Aug 16, 2016•8 citations

Localization of Discrete Time Quantum Walks on the Glued Trees

Yusuke Ide, Norio Konno, Etsuo Segawa +1 more

In this paper, we consider the time averaged distribution of discrete time quantum walks on the glued trees. In order to analyze the walks on the glued trees, we consider a reduction to the walks on path graphs. Using a spectral analysis of the Jacobi matrices defined by the corresponding random walks on the path graphs, we have a spectral decomposition of the time evolution operator of the quantum walks. We find significant contributions of the eigenvalues, ±1, of the Jacobi matrices to the time averaged limit distribution of the quantum walks. As a consequence, we obtain the lower bounds of the time averaged distribution.

arXiv:1312.1149•Entropy•Mar 18, 2014•9 citations

Entropy rate of message sources driven by quantum walks

Bálint Kollár, Mátyás Koniorczyk

The amount of information generated by a discrete time stochastic processes in a single step can be quantified by the entropy rate. We investigate the differences between two discrete time walk models, the discrete time quantum walk and the classical random walk, in terms of entropy rate. We develop analytical methods to calculate and approximate it. This allows us to draw conclusions about the differences between classical stochastic and quantum processes in terms of the classical information theory.

arXiv:1402.6731•Physical Review A•Feb 26, 2014•15 citations
In this paper, we consider the time averaged distribution of discrete time quantum walks on the glued trees. In order to analyse the walks on the glued trees, we consider a reduction to the walks on path graphs. Using a spectral analysis of the Jacobi matrices defined by the corresponding random walks on the path graphs, we have spectral decomposition of the time evolution operator of the quantum walks. We find significant contributions of the eigenvalues ±1\pm 1±1 of the Jacobi matrices to the time averaged limit distribution of the quantum walks. As a consequence we obtain lower bounds of the time averaged distribution.
In this paper, we consider the time averaged distribution of discrete time quantum walks on the glued trees. In order to analyze the walks on the glued trees, we consider a reduction to the walks on path graphs. Using a spectral analysis of the Jacobi matrices defined by the corresponding random walks on the path graphs, we have a spectral decomposition of the time evolution operator of the quantum walks. We find significant contributions of the eigenvalues, ±1, of the Jacobi matrices to the time averaged limit distribution of the quantum walks. As a consequence, we obtain the lower bounds of the time averaged distribution.
The amount of information generated by a discrete time stochastic processes in a single step can be quantified by the entropy rate. We investigate the differences between two discrete time walk models, the discrete time quantum walk and the classical random walk, in terms of entropy rate. We develop analytical methods to calculate and approximate it. This allows us to draw conclusions about the differences between classical stochastic and quantum processes in terms of the classical information theory.