2012
DOI: 10.1007/s11128-012-0432-5
|View full text |Cite
|
Sign up to set email alerts
|

Quantum walks: a comprehensive review

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
5

Citation Types

2
640
1
2

Year Published

2014
2014
2022
2022

Publication Types

Select...
8
1

Relationship

0
9

Authors

Journals

citations
Cited by 874 publications
(667 citation statements)
references
References 364 publications
2
640
1
2
Order By: Relevance
“…A quantum walker moves by superpositions of possible paths, resulting in a probability amplitude for being observed at a particular position [1][2][3]. Optical multiport interferometers provide an attractive implementation for quantum walks, since optical fields naturally exhibit coherence between pathways and allow multi-walker scenarios using multiple single photons.…”
Section: Introductionmentioning
confidence: 99%
“…A quantum walker moves by superpositions of possible paths, resulting in a probability amplitude for being observed at a particular position [1][2][3]. Optical multiport interferometers provide an attractive implementation for quantum walks, since optical fields naturally exhibit coherence between pathways and allow multi-walker scenarios using multiple single photons.…”
Section: Introductionmentioning
confidence: 99%
“…As there are few real-life materials that are topological insulators, 3 there is an intense search for model systems that simulate topological insulators in the laboratory. [4][5][6] Discrete-time quantum walks (DTQW) 7 are quantum generalizations of the random walk, with a quantum speedup that could be employed for fast quantum search 8 or even for general quantum computation. 9 They have been realized in many experimental setups, including atoms in optical lattices, 10,11 trapped ions, 12,13 and light in optical setups.…”
Section: Introductionmentioning
confidence: 99%
“…: [3][4][5][6][7]). It was originally proposed with the aim of finding quantum algorithms that are faster than classical algorithms for the same problem, because in general quantum walks diffuse faster than its classical counter parts.…”
Section: Introductionmentioning
confidence: 99%
“…For a recent review on various aspects of localisation in quantum walks, see e.g., Ref. [4] and [39].…”
Section: Introductionmentioning
confidence: 99%