Success criteria for quantum search on graphs
Abstract
We consider quantum search on graphs. Recently, it has been shown that the graph properties like connectivity, global symmetry, or regularity cannot serve as a reliable criteria that must be satisfied by a graph to allow a successful quantum search. It is an open question whether it is possible to find such a criteria. We solve this question by giving an affirmative answer.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.