Quantum search with multiple walk steps per oracle query

@article{Wong2015QuantumSW,
  title={Quantum search with multiple walk steps per oracle query},
  author={Thomas G. Wong and Andris Ambainis},
  journal={Physical Review A},
  year={2015},
  volume={92},
  pages={022338}
}
  • Thomas G. Wong, Andris Ambainis
  • Published 2015
  • Physics
  • Physical Review A
  • We identify a key difference between quantum search by discrete- and continuous-time quantum walks: a discrete-time walk typically performs one walk step per oracle query, whereas a continuous-time walk can effectively perform multiple walk steps per query while only counting query time. As a result, we show that continuous-time quantum walks can outperform their discrete-time counterparts, even though both achieve quadratic speedups over their corresponding classical random walks. To provide… CONTINUE READING

    Figures from this paper.

    Citations

    Publications citing this paper.
    SHOWING 1-10 OF 17 CITATIONS

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 22 REFERENCES

    Spatial search by quantum walk

    VIEW 11 EXCERPTS
    HIGHLY INFLUENTIAL

    Coins make quantum walks faster

    VIEW 6 EXCERPTS

    Quantum walk algorithm for element distinctness

    • Andris Ambainis
    • Physics, Computer Science, Mathematics
    • 45th Annual IEEE Symposium on Foundations of Computer Science
    • 2003
    VIEW 2 EXCERPTS

    Quantum speed-up of Markov chain based algorithms

    • M. Szegedy
    • Computer Science, Mathematics
    • 45th Annual IEEE Symposium on Foundations of Computer Science
    • 2004
    VIEW 2 EXCERPTS

    Connectivity is a poor indicator of fast quantum search.

    VIEW 1 EXCERPT