Improvement of quantum walks search algorithm in single-marked vertex graph
From MaRDI portal
Publication:6096899
DOI10.1088/1751-8121/acf174arXiv2209.04162OpenAlexW4385911360MaRDI QIDQ6096899
Publication date: 15 September 2023
Published in: Journal of Physics A: Mathematical and Theoretical (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2209.04162
Searching and sorting (68P10) Quantum computation (81P68) Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Quantum measurement theory, state operations, state preparations (81P15) Adiabatic invariants for problems in Hamiltonian and Lagrangian mechanics (70H11) Interpolation, preservation, definability (03C40) Random walks on graphs (05C81)
Cites Work
- Quantum walks can find a marked element on any graph
- Quantum algorithm design: techniques and applications
- On the hitting times of quantum versus random walks
- Search via Quantum Walk
- Adiabatic quantum state generation and statistical zero knowledge
- Quantum verification of matrix products
- Some Inequalities for Reversible Markov Chains
- Quantum algorithms revisited
- Faster quantum-walk algorithm for the two-dimensional spatial search
- Quantum mixing of Markov chains for special distributions
- Quadratic speedup for finding marked vertices by Quantum walks
- Low-Mean Hitting Time for Random Walks on Heterogeneous Networks
- Quantum Algorithms for the Triangle Problem
- Quantum Walk Algorithm for Element Distinctness
