Quantum walk search through potential barriers
From MaRDI portal
Abstract: An ideal quantum walk transitions from one vertex to another with perfect fidelity, but in physical systems, the particle may be hindered by potential energy barriers. Then the particle has some amplitude of tunneling through the barriers, and some amplitude of staying put. We investigate the algorithmic consequence of such barriers for the quantum walk formulation of Grover's algorithm. We prove that the failure amplitude must scale as for search to retain its quantum runtime; otherwise, it searches in classical time. Thus searching larger "databases" requires increasingly reliable hop operations or error correction. This condition holds for both discrete- and continuous-time quantum walks.
Recommendations
Cited in
(10)- Equivalence of Szegedy's and coined quantum walks
- Fast quantum search of multiple vertices based on electric circuits
- Quantum walk on the line through potential barriers
- Spatial search by continuous-time quantum walk with multiple marked vertices
- Search via quantum walks with intermediate measurements
- Search via Quantum Walk
- Robust quantum spatial search
- Quantum walk search with time-reversal symmetry breaking
- The quantum walk search algorithm: factors affecting efficiency
- Robustness of quantum walk search with neighbors measurement
This page was built for publication: Quantum walk search through potential barriers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3178738)