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

Bulletin of the American Physical Society

Finding paths with quantum walks

Mark S. Hillery

Published Mar 8, 2019• 0 citations
OpenAlex

Related papers

Quantum Walks and Search Algorithms

Renato Portugal

Springer eBooks•Jan 1, 2013•478 citations

A versatile quantum walk resonator with bright classical light

Bereneice Sephton, Angela L. Dudley, Gianluca Ruffato +7 more

In a Quantum Walk (QW) the "walker" follows all possible paths at once through the principle of quantum superposition, differentiating itself from classical random walks where one random path is taken at a time. This facilitates the searching of problem solution spaces faster than with classical random walks, and holds promise for advances in dynamical quantum simulation, biological process modelling and quantum computation. Here we employ a versatile and scalable resonator configuration to realise quantum walks with bright classical light. We experimentally demonstrate the versatility of our approach by implementing a variety of QWs, all with the same experimental platform, while the use of a resonator allows for an arbitrary number of steps without scaling the number of optics. This paves the way for future QW implementations with spatial modes of light in free-space that are both versatile and scalable.

arXiv:1810.06850•PLoS ONE•Apr 9, 2019•35 citations

Introduction to Quantum Walks

Renato Portugal

Quantum science and technology•Jan 1, 2018•1 citation

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•19 citations

Introduction to Quantum Walks

Renato Portugal

Springer eBooks•Jan 1, 2013•1 citation

Classical and quantum walks on paths associated with exceptional Krawtchouk polynomials

Hiroshi Miki, Satoshi Tsujimoto, Luc Vinet

Classical and quantum walks on some finite paths are introduced. It is shown that these walks have explicit solutions given in terms of exceptional Krawtchouk polynomials, and their properties are explored. In particular, fractional revival is shown to take place in the corresponding quantum walks.

arXiv:2201.02337•Journal of Mathematical Physics•Oct 1, 2022•4 citations
In a Quantum Walk (QW) the "walker" follows all possible paths at once through the principle of quantum superposition, differentiating itself from classical random walks where one random path is taken at a time. This facilitates the searching of problem solution spaces faster than with classical random walks, and holds promise for advances in dynamical quantum simulation, biological process modelling and quantum computation. Here we employ a versatile and scalable resonator configuration to realise quantum walks with bright classical light. We experimentally demonstrate the versatility of our approach by implementing a variety of QWs, all with the same experimental platform, while the use of a resonator allows for an arbitrary number of steps without scaling the number of optics. This paves the way for future QW implementations with spatial modes of light in free-space that are both versatile and scalable.
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.