Correcting for Potential Barriers in Quantum Walk Search
arXiv:1505.02035
Abstract
A randomly walking quantum particle searches in Grover's iterations for a marked vertex on the complete graph of vertices by repeatedly querying an oracle that flips the amplitude at the marked vertex, scattering by a "coin" flip, and hopping. Physically, however, potential energy barriers can hinder the hop and cause the search to fail, even when the amplitude of not hopping decreases with . We correct for these errors by interpreting the quantum walk search as an amplitude amplification algorithm and modifying the phases applied by the coin flip and oracle such that the amplification recovers the runtime.
arXiv comment8 pages, 3 figures
References in corpus (11)
- Quantum algorithm for solving linear systems of equations
- A Quantum Random Walk Search Algorithm
- Quantum Walk in Position Space with Single Optically Trapped Atoms
- Realization of quantum walks with negligible decoherence in waveguide lattices
- Quantum walk of a trapped ion in phase space
- Experimental Implementation of Discrete Time Quantum Random Walk on an NMR Quantum Information Processor
- On Arbitrary Phases in Quantum Amplitude Amplification
- On the absence of homogeneous scalar unitary cellular automata
- Grover Search with Lackadaisical Quantum Walks
- Effects of Noisy Oracle on Search Algorithm Complexity
- Scattering quantum random-walk search with errors