A random walk approach to quantum algorithms
Open accessThe DOI matches its Crossref record; 25 of the 25 references it cites were found in a registry or an index.
Abstract
The development of quantum algorithms based on quantum versions of random walks is placed in the context of the emerging field of quantum computing. Constructing a suitable quantum version of a random walk is not trivial; pure quantum dynamics is deterministic, so randomness only enters during the measurement phase, i.e. when converting the quantum information into classical information. The outcome of a quantum random walk is very different from the corresponding classical random walk owing to the interference between the different possible paths. The upshot is that quantum walkers find themselves further from their starting point than a classical walker on average, and this forms the basis of a quantum speed up, which can be exploited to solve problems faster. Surprisingly, the effect of making the walk slightly less than perfectly quantum can optimize the properties of the quantum walk for algorithmic applications. Looking to the future, even with a small quantum computer available, the development of quantum walk algorithms might proceed more rapidly than it has, especially for solving real problems.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
A fast quantum mechanical algorithm for database search
Grover, L. K. (1996) · Proceedings of the twenty-eighth annual ACM symposium on Theory of computing - STOC '96 · doi:10.1145/237814.237866 · Cited by 8,830
Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer
Shor, P. W. (1997) · SIAM Journal on Computing · doi:10.1137/s0097539795293172 · Cited by 8,472
Simulating physics with computers
Feynman, R. P. (1982) · International Journal of Theoretical Physics · doi:10.1007/bf02650179 · Cited by 7,691 · cited 4×
“(2003) do prove their quantum algorithm is faster than any classical algorithm, but Shor’s algorithm (Shor 1997) is only the ‘best-known’ algorithm for factoring, there is no proof something faster cannot be found in future.”
BackgroundMethodInfluentialQuantum theory, the Church–Turing principle and the universal quantum computer
Deutsch, D. (1985) · Proceedings of the Royal Society of London. A. Mathematical and Physical Sciences · doi:10.1098/rspa.1985.0070 · Cited by 4,597
Raussendorf, R., & Briegel, H. J. (2001) · Physical Review Letters · doi:10.1103/physrevlett.86.5188 · Cited by 4,477
Lloyd, S. (1996) · Science · doi:10.1126/science.273.5278.1073 · Cited by 3,088 · cited 1×
“However, this is not possible within the constraints of quantum dynamics, as shown by Meyer (1996).”
BackgroundThe Quantum Postulate and the Recent Development of Atomic Theory1
BOHR, N. (1928) · Nature · doi:10.1038/121580a0 · Cited by 1,700 · cited 4×
“For physical systems we can give a straightforward answer to the question of what makes a quantum walk ‘quantum’: like all quantum systems they should exhibit complementarity (Bohr 1928, 1950). The text-book complementarity experiment is Young’s double-slits, in which quantum particles (such as photons or electrons) a…”
BackgroundInfluentialImproved simulation of stabilizer circuits
Aaronson, S., & Gottesman, D. (2004) · Physical Review A · doi:10.1103/physreva.70.052328 · Cited by 1,515 · cited 1×
“This is a criterion regularly applied in quantum computing, e.g. the Clifford group of operations can all be efficiently classically simulated (Aaronson & Gottesman 2004), and so they are not sufficient to build a quantum computer.”
BackgroundMultiple-particle interference and quantum error correction
(1996) · Proceedings of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences · doi:10.1098/rspa.1996.0136 · Cited by 1,284
Quantum computation and decision trees
Farhi, E., & Gutmann, S. (1998) · Physical Review A · doi:10.1103/physreva.58.915 · Cited by 1,215 · cited 4×
“The recipes for continuous time walks are similar to the discrete time walks in table 1. Continuous time walks do not use a coin: the coin toss and conditional shift (steps 2. and 3.) are replaced by a hopping rate per unit time for the probability of moving to a neighbouring location, and step 4. by continuous evolut…”
BackgroundMethodInfluentialQuantum random-walk search algorithm
Shenvi, N., Kempe, J., & Whaley, K. B. (2003) · Physical Review A · doi:10.1103/physreva.67.052307 · Cited by 1,150 · cited 2×
“s are shown since odd points are unoccupied at even time steps. 3. Quantum walk algorithms Of course, quadratically faster spreading on a line isn’t an algorithm yet, but it is a good start, and soon Shenvi et al. (2003) showed that a quantum walk could search an unsorted database with a quadratic speed up. The first q…”
BackgroundMethodExponential algorithmic speedup by a quantum walk
Childs, A. M., Cleve, R., Deotto, E., Farhi, E., Gutmann, S., & Spielman, D. A. (2003) · Proceedings of the thirty-fifth annual ACM symposium on Theory of computing · doi:10.1145/780542.780552 · Cited by 825 · cited 5×
“Childs et al. (2003) proved that a quantum walk could perform exponentially faster than any classical algorithm when finding a route across a particular sort of network, see figure 2.”
BackgroundInfluentialAharonov, D., Ambainis, A., Kempe, J., & Vazirani, U. (2001) · Proceedings of the thirty-third annual ACM symposium on Theory of computing · doi:10.1145/380752.380758 · Cited by 654 · cited 3×
“This recipe for a quantum walk was first investigated with algorithmic applications in mind by Aharanov et al. (2001) and Ambainis et al.”
BackgroundMethodInfluentialQUANTUM WALKS AND THEIR ALGORITHMIC APPLICATIONS
AMBAINIS, A. (2003) · International Journal of Quantum Information · doi:10.1142/s0219749903000383 · Cited by 632 · cited 3×
“(2001) and Ambainis et al. (2001). Table 1 compares the instructions for performing classical and quantum random walks on a line.”
BackgroundInfluentialFault-tolerant quantum computation with constant error
Aharonov, D., & Ben-Or, M. (1997) · Proceedings of the twenty-ninth annual ACM symposium on Theory of computing - STOC '97 · doi:10.1145/258533.258579 · Cited by 631
(2004) · doi:10.1109/focs.2004.53 · Cited by 599
Ambainis, A., Bach, E., Nayak, A., Vishwanath, A., & Watrous, J. (2001) · Proceedings of the thirty-third annual ACM symposium on Theory of computing · doi:10.1145/380752.380757 · Cited by 562 · cited 1×
“which way you arrived at your location, allowing you to retrace your steps. This recipe for a quantum walk was first investigated with algorithmic applications in mind by Aharanov, D et al. (2001) and Ambainis et al. (2001). Table 1 compares the instructions for performing classical and quantum random walks on a line.…”
MethodA probabilistic algorithm for k-SAT and constraint satisfaction problems
Schoning, T. (2003) · 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039) · doi:10.1109/sffcs.1999.814612 · Cited by 433 · cited 2×
“It is also possible to extend the original concept (e.g., Rubel 1993 ) to solve a wider class of equations.”
BackgroundQuantum walks in optical lattices
Dür, W., Raussendorf, R., Kendon, V. M., & Briegel, H.-J. (2002) · Physical Review A · doi:10.1103/physreva.66.052319 · Cited by 259
Self-citationDecoherence can be useful in quantum walks
Kendon, V., & Tregenna, B. (2003) · Physical Review A · doi:10.1103/physreva.67.042315 · Cited by 223 · cited 4×
“Applying decoherence to a quantum walk on a cycle causes it to mix even faster than a pure quantum walk, and to always mix to a uniform distribution (Kendon & Tregenna 2003).”
BackgroundMethodInfluentialSelf-citationQuantum Simulations on a Quantum Computer
Somaroo, S., Tseng, C. H., Havel, T. F., Laflamme, R., & Cory, D. G. (1999) · Physical Review Letters · doi:10.1103/physrevlett.82.5381 · Cited by 180 · cited 1×
“of the quantum system to sufficient accuracy using a sequence of standard Hamiltonians applied to the quantum register, each for short period of time. Quantum simulation has already been demonstrated (Somaroo et al. 1999), for small systems using NMR quantum computers. However, like classical analogue computing, quantum…”
MethodQuantum walk on the line as an interference phenomenon
Knight, P. L., Roldán, E., & Sipe, J. E. (2003) · Physical Review A · doi:10.1103/physreva.68.020301 · Cited by 176
Localization and its consequences for quantum walk algorithms and quantum communication
Keating, J. P., Linden, N., Matthews, J. C. F., & Winter, A. (2007) · Physical Review A · doi:10.1103/physreva.76.012315 · Cited by 123
Threshold Accuracy for Quantum Computation
Knill, E., Laflamme, R., & Zurek, W. (1996) · arXiv · doi:10.48550/arxiv.quant-ph/9610011 · Cited by 99
Brown, K. R., Clark, R. J., & Chuang, I. L. (2006) · Physical Review Letters · doi:10.1103/physrevlett.97.050504 · Cited by 98 · cited 9×
“Dür et al. (2002) used simulation to assess the effects of errors when making an atom in an optical lattice perform a quantum walk.”
BackgroundMethodInfluential
Cited by
Quantum walks: a comprehensive review
Venegas-Andraca, S. E. (2012) · Quantum Information Processing · doi:10.1007/s11128-012-0432-5 · Cited by 934
Realization of Quantum Walks with Negligible Decoherence in Waveguide Lattices
Perets, H. B., Lahini, Y., Pozzi, F., Sorel, M., Morandotti, R., & Silberberg, Y. (2008) · Physical Review Letters · doi:10.1103/physrevlett.100.170506 · Cited by 526
Decoherence in quantum walks – a review
KENDON, V. (2007) · Mathematical Structures in Computer Science · doi:10.1017/s0960129507006354 · Cited by 252
Self-citationQuantum Navigation and Ranking in Complex Networks
Sánchez-Burillo, E., Duch, J., Gómez-Gardeñes, J., & Zueco, D. (2012) · Scientific Reports · doi:10.1038/srep00605 · Cited by 115
Kendon, V. M., Nemoto, K., & Munro, W. J. (2010) · Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences · doi:10.1098/rsta.2010.0017 · Cited by 41
Self-citation
Metadata
- Authors
- Kendon, V. M.
- Venue
- Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences
- Publisher
- The Royal Society
- Published
- 2006-10-18
- Volume
- 364
- Issue
- 1849
- Pages
- 3407-3422
- ISSN
- 1364-503X (ISSN-L)
- 1471-2962
- OpenAlex
- W2150269682
- Cited by
- 117
- References
- 25
- FWCI
- 7.27
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.