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:quant-ph/0206053 · Quantum Information Processing

Quantum Random Walks in One Dimension

Norio Konno

Published Oct 1, 2002• 305 citations
arXivHTMLPDF
DOI
10.1023/a:1023413713008

Related papers

Delocalization of a non-Hermitian quantum walk on random media in one dimension

Naomichi Hatano, Hideaki Obuse

arXiv:2107.10420•Annals of Physics•Sep 17, 2021•13 citations

Limit theorems for quantum walks with memory

Norio Konno, Takuya Machida

Recently Mc Gettrick introduced and studied a discrete-time 2-state quantum walk (QW) with a memory in one dimension. He gave an expression for the amplitude of the QW by path counting method. Moreover he showed that the return probability of the walk is more than 1/2 for any even time. In this paper, we compute the stationary distribution by considering the walk as a 4-state QW without memory. Our result is consistent with his claim. In addition, we obtain the weak limit theorem of the rescaled QW. This behavior is strikingly different from the corresponding classical random walk and the usual 2-state QW without memory as his numerical simulations suggested.

arXiv:1004.0443•Quantum Information and Computation•Nov 1, 2010•20 citations

Two-dimensional Quantum Random Walk

Yuliy M. Baryshnikov, Wil Brady, Andrew Bressler +1 more

arXiv:0810.5495•Journal of Statistical Physics•Dec 7, 2010•25 citations

Two-dimensional Quantum Random Walk and its Physical Realization

Peng Xue

Quantum random walks have been much studied recently,largely due to their highly non-classical behaviors.In this paper,we review the classical and quantum random walks of one-dimensional,and analyze two classical two-dimensional models and compare them.Furthermore we propose a two-dimensional quantum random walk algorithm.We compute the standard deviation,thereby proving our two-dimensional algorithm is superior to that of one-dimension.We propose a scheme,which is based on single photon with pairs of qubits,to implement it.

Acta Sinica Quantum Optica•Jan 1, 2011•0 citations

One-dimensional discrete-time quantum walks on random environments

Norio Konno

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

Quantum Walk Random Number Generation: Memory-based Models

Minu J. Bae

The semi-source independent quantum walk random number generator (SI-QW-QRNG) is a cryptographic protocol that extracts a string of true random bits from a quantum random walk with an adversary controls a randomness source, but the dimension of the system is known. This paper analyzes SI-QW-QRNG protocols with a memory-based quantum walk state. The new protocol utilizes a generalized coin operator with various parameters to optimize the randomness of the quantum walk state. We focus on evaluations of the protocols in multiple scenarios and walk configurations. Moreover, we show some interesting behavior of the system depending on the size of the memory space and the number of quantum coins.

arXiv:2207.08973•IEEE International Conference on Quantum Computing and Engineering (QCE)•Sep 1, 2022•4 citations
Recently Mc Gettrick introduced and studied a discrete-time 2-state quantum walk (QW) with a memory in one dimension. He gave an expression for the amplitude of the QW by path counting method. Moreover he showed that the return probability of the walk is more than 1/2 for any even time. In this paper, we compute the stationary distribution by considering the walk as a 4-state QW without memory. Our result is consistent with his claim. In addition, we obtain the weak limit theorem of the rescaled QW. This behavior is strikingly different from the corresponding classical random walk and the usual 2-state QW without memory as his numerical simulations suggested.
Quantum random walks have been much studied recently,largely due to their highly non-classical behaviors.In this paper,we review the classical and quantum random walks of one-dimensional,and analyze two classical two-dimensional models and compare them.Furthermore we propose a two-dimensional quantum random walk algorithm.We compute the standard deviation,thereby proving our two-dimensional algorithm is superior to that of one-dimension.We propose a scheme,which is based on single photon with pairs of qubits,to implement it.
The semi-source independent quantum walk random number generator (SI-QW-QRNG) is a cryptographic protocol that extracts a string of true random bits from a quantum random walk with an adversary controls a randomness source, but the dimension of the system is known. This paper analyzes SI-QW-QRNG protocols with a memory-based quantum walk state. The new protocol utilizes a generalized coin operator with various parameters to optimize the randomness of the quantum walk state. We focus on evaluations of the protocols in multiple scenarios and walk configurations. Moreover, we show some interesting behavior of the system depending on the size of the memory space and the number of quantum coins.