Discrete-time quantum walks with the Dirac equation as continuum limit localize on topological defects in O(√N) steps with probability O(1/log N), numerically matching Grover search scaling.
Any and-or formula of size n can be evaluated in time nˆ1/2+o(1) on a quantum computer
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
quant-ph 1years
2019 1verdicts
CONDITIONAL 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
The Grover search as a naturally occurring phenomenon
Discrete-time quantum walks with the Dirac equation as continuum limit localize on topological defects in O(√N) steps with probability O(1/log N), numerically matching Grover search scaling.