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

Lecture notes in computer science

Discrete Quantum Walks Hit Exponentially Faster

Julia Kempe

Published Jan 1, 2003• 84 citations
Publisher
DOI
10.1007/978-3-540-45198-3_30

Related papers

Discrete Quantum Walks Hit Exponentially Faster

Julia Kempe

Probability Theory and Related Fields•Feb 10, 2005•149 citations

Quantum Random Walks Hit Exponentially Faster

Julia Kempe

We show that the hitting time of the discrete time quantum random walk on the n-bit hypercube from one corner to its opposite is polynomial in n. This gives the first exponential quantum-classical gap in the hitting time of discrete quantum random walks. We provide the framework for quantum hitting time and give two alternative definitions to set the ground for its study on general graphs. We then give an application to random routing.

arXiv:quant-ph/0205083•May 14, 2002•136 citations

Connecting the Discrete-time and Continuous-time Quantum Walks

Albert T. Schmitz

Bulletin of the American Physical Society•Mar 15, 2016•0 citations

Discrete-time quantum walk with history dependence

Zlatko Dimcovic, Yevgeniy Kovchegov

Bulletin of the American Physical Society•Mar 18, 2013•0 citations

Quantum walks on embedded hypercubes

Adi Makmal, Manran Zhu, Daniel Manzano +2 more

It has been proved by Kempe that discrete quantum walks on the hypercube (HC) hit exponentially faster than the classical analog. The same was also observed numerically by Krovi and Brun for a slightly different property, namely, the expected hitting time. Yet, to what extent this striking result survives in more general graphs is to date an open question. Here, we tackle this question by studying the expected hitting time for quantum walks on HCs that are embedded into larger symmetric structures. By performing numerical simulations of the discrete quantum walk and deriving a general expression for the classical hitting time, we observe an exponentially increasing gap between the expected classical and quantum hitting times, not only for walks on the bare HC, but also for a large family of embedded HCs. This suggests that the quantum speedup is stable with respect to such embeddings.

arXiv:1309.5253•Physical Review A•Aug 14, 2014•19 citations

Electric‐Circuit Simulation of Quantum Fast Hitting with Exponential Speedup

Hanxu Zhang, Tian Chen, Naiqiao Pan +1 more

Abstract The ultimate goal of developing quantum algorithms and constructing quantum computers is to achieve faster information processing than using current classical computers. Quantum walks are powerful kernels in quantum computing protocols and possess strong capabilities in speeding up various simulation and optimization tasks. One striking example is provided by quantum walkers evolving on unbalanced trees, which demonstrate faster hitting performances than classical random walk. However, direct experimental construction of unbalanced trees to prove quantum advantage with exponential speedup remains a great challenge due to the highly complex arrangements of the structure. This study attempts to simulate quantum algorithm by classical circuit. Inspired by the quantum algorithm, the classical circuit networks are designed and fabricated with unbalanced tree structures. It is then demonstrated, both theoretically and experimentally, that the quantum algorithm for the fast hitting problem can be simulated in the structure. It is shown that the hitting efficiency of electric signals in the circuit networks with unbalanced tree structures is exponentially faster than the corresponding cases of classical random walks. Because classical circuit networks possess good scalability and stability, the results open up a scalable new path toward quantum speedup in complex problems.

Advanced Quantum Technologies•Feb 5, 2022•17 citations
It has been proved by Kempe that discrete quantum walks on the hypercube (HC) hit exponentially faster than the classical analog. The same was also observed numerically by Krovi and Brun for a slightly different property, namely, the expected hitting time. Yet, to what extent this striking result survives in more general graphs is to date an open question. Here, we tackle this question by studying the expected hitting time for quantum walks on HCs that are embedded into larger symmetric structures. By performing numerical simulations of the discrete quantum walk and deriving a general expression for the classical hitting time, we observe an exponentially increasing gap between the expected classical and quantum hitting times, not only for walks on the bare HC, but also for a large family of embedded HCs. This suggests that the quantum speedup is stable with respect to such embeddings.
Abstract The ultimate goal of developing quantum algorithms and constructing quantum computers is to achieve faster information processing than using current classical computers. Quantum walks are powerful kernels in quantum computing protocols and possess strong capabilities in speeding up various simulation and optimization tasks. One striking example is provided by quantum walkers evolving on unbalanced trees, which demonstrate faster hitting performances than classical random walk. However, direct experimental construction of unbalanced trees to prove quantum advantage with exponential speedup remains a great challenge due to the highly complex arrangements of the structure. This study attempts to simulate quantum algorithm by classical circuit. Inspired by the quantum algorithm, the classical circuit networks are designed and fabricated with unbalanced tree structures. It is then demonstrated, both theoretically and experimentally, that the quantum algorithm for the fast hitting problem can be simulated in the structure. It is shown that the hitting efficiency of electric signals in the circuit networks with unbalanced tree structures is exponentially faster than the corresponding cases of classical random walks. Because classical circuit networks possess good scalability and stability, the results open up a scalable new path toward quantum speedup in complex problems.