Exceptional quantum walk search on the cycle
DOI10.1007/S11128-017-1606-YzbMath1373.81156arXiv1610.06075OpenAlexW2586861041MaRDI QIDQ1679371
Thomas G. Wong, Raqueline Azevedo Medeiros Santos
Publication date: 9 November 2017
Published in: Quantum Information Processing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1610.06075
Markov chainrandom walkmixing timehitting timequantum walkquantum searchspatial searchexceptional configuration
Computational methods in Markov chains (60J22) Searching and sorting (68P10) Quantum computation (81P68) Random walks, random surfaces, lattice animals, etc. in equilibrium statistical mechanics (82B41)
Related Items (5)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Quantum walks can find a marked element on any graph
- The staggered quantum walk model
- Laplacian versus adjacency matrix in quantum walk search
- From quantum cellular automata to quantum lattice gases
- Equivalence of Szegedy's and coined quantum walks
- Quantum walks: a comprehensive review
- On the absence of homogeneous scalar unitary cellular automata.
- On the hitting times of quantum versus random walks
- Adjacent Vertices Can Be Hard to Find by Quantum Walks
- Search via Quantum Walk
- QUANTUM HITTING TIME ON THE COMPLETE GRAPH
- Doubling the success of quantum walk search using internal-state measurements
- Search by Quantum Walks on Two-Dimensional Grid without Amplitude Amplification
- Faster quantum-walk algorithm for the two-dimensional spatial search
- Quantum algorithm for tree size estimation, with applications to backtracking and 2-player games
- Quantum walks on graphs
- Quantum Walks with Multiple or Moving Marked Locations
- Quantum Walks on Two-Dimensional Grids with Multiple Marked Locations
This page was built for publication: Exceptional quantum walk search on the cycle