Success criteria for quantum search on graphs
classification
🪐 quant-ph
keywords
criteriaquantumsearchgraphgraphsquestionaffirmativeallow
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.