Impact of global and local interaction on quantum spatial search on chimera graph
arXiv:1807.09347 · doi:10.1142/S0219749919500400
Abstract
In the paper, we investigated the influence of local and global interaction on the efficiency of continuous-time quantum spatial search. To do so, we analyzed numerically chimera graph, which is defined as 2D grid with each node replaced by complete bipartite graph. Our investigation provides a numerical evidence that with a large number of local interactions the quantum spatial search is optimal, contrary to the case with limited number of such interactions. The result suggests that relatively large number of local interactions with the marked vertex is necessary for optimal search, which in turn would imply that poorly connected vertices are hard to be found.
References in corpus (13)
- Quantum Amplitude Amplification and Estimation
- Quantum annealing with more than one hundred qubits
- Spatial search by quantum walk
- Spatial search by quantum walk is optimal for almost all graphs
- Global Symmetry is Unnecessary for Fast Quantum Search
- Systematic Dimensionality Reduction for Quantum Walks: Optimal Spatial Search and Transport on Non-Regular Graphs
- Connectivity is a Poor Indicator of Fast Quantum Search
- Continuous-Time Quantum Search on Balanced Trees
- Finding a marked node on any graph by continuous-time quantum walk
- Diagrammatic Approach to Quantum Search
- Vertices cannot be hidden from quantum spatial search for almost all random graphs
- Optimal Quantum Walk Search on Kronecker Graphs with Dominant or Fixed Regular Initiators
- Quantum walk on a chimera graph