Connectivity is a Poor Indicator of Fast Quantum Search

Abstract

A randomly walking quantum particle evolving by Schrödinger's equation searches on $d$-dimensional cubic lattices in $O(\sqrt{N})$ time when $d\ge 5$, and with progressively slower runtime as $d$ decreases. This suggests that graph connectivity (including vertex, edge, algebraic, and normalized algebraic connectivities) is an indicator of fast quantum search, a belief supported by fast quantum search on complete graphs, strongly regular graphs, and hypercubes, all of which are highly connected. In this paper, we show this intuition to be false by giving two examples of graphs for which the opposite holds true: one with low connectivity but fast search, and one with high connectivity but slow search. The second example is a novel two-stage quantum walk algorithm in which the walking rate must be adjusted to yield high search probability.

5 pages, 9 figures; additional 10 pages of supplemental material

References in corpus (1)

• Spatial search by quantum walk

Cited by in corpus (6)

• Perfect state transfer by means of discrete-time quantum walk search algorithms on highly symmetric graphs
• On the optimality of spatial search by continuous-time quantum walk
• Continuous-time quantum walks on dynamical percolation graphs
• Diagrammatic Approach to Quantum Search
• Quantum walks on two-dimensional grids with multiple marked locations
• Application of graph theory in quantum computer science