Upperbounds on the probability of finding marked connected components using quantum walks
From MaRDI portal
Publication:2684190
DOI10.1007/s11128-020-02939-4OpenAlexW3118739574MaRDI QIDQ2684190
Nikolajs Nahimovs, Konstantin Balakirev, Adam Glos, Kamil Khadiev
Publication date: 16 February 2023
Published in: Quantum Information Processing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1903.01482
Quantum computation (81P68) Random walks on graphs (05C81) Quantum state spaces, operational and probabilistic concepts (81P16)
Related Items (4)
Quantum algorithm for Dyck language with multiple types of brackets ⋮ Classical and quantum algorithms for constructing text from dictionary problem ⋮ Spatial search algorithms on graphs with multiple targets using discrete-time quantum walk ⋮ Optimized search for complex protocols based on entanglement detection
Cites Work
- Unnamed Item
- On the probability of finding marked connected components using quantum walks
- Adjacent vertices can be hard to find by quantum walks
- Impact of the malicious input data modification on the efficiency of quantum spatial search
- The degree sequence of a scale-free random graph process
- Lively quantum walks on cycles
- Adjacent Vertices Can Be Hard to Find by Quantum Walks
- Statistical mechanics of complex networks
- Quadratic speedup for finding marked vertices by Quantum walks
- Collective dynamics of ‘small-world’ networks
- Quantum Walks with Multiple or Moving Marked Locations
- High Degree Vertices and Eigenvalues in the Preferential Attachment Graph
- Quantum Walks on Two-Dimensional Grids with Multiple Marked Locations
- Quantum walks and search algorithms
This page was built for publication: Upperbounds on the probability of finding marked connected components using quantum walks
