Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:1605.05013

Success criteria for quantum search on graphs

Avatar Tulsi

Published May 17, 2016• 1 citation
arXivHTMLPDF

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.

DOI
10.48550/arxiv.1605.05013

Related papers

Quantum walk-based search and symmetries in graphs

Anuradha Mahasinghe, Jingbo B. Wang, J.K. Wijerathna

© 2014 IOP Publishing Ltd. In this paper we present a lemma, which helps us to establish a link between the distribution of success probabilities from quantum walk based search and the symmetries of the underlying graphs. With the aid of the lemma, we identified certain graph structures of which the quantum walk based search provides high success probabilities at the marked vertices. We also observed that many graph structures and their vertices can be classified according to their structural equivalence using the search probabilities provided by quantum walks, although this method cannot resolve all non-equivalent vertices for strongly regular graphs.

Journal of Physics A Mathematical and Theoretical•Nov 24, 2014•6 citations

Global Symmetry is Unnecessary for Fast Quantum Search

Jonatan Janmark, David Meyer, Thomas G. Wong

Grover's quantum search algorithm can be formulated as a quantum particle randomly walking on the (highly symmetric) complete graph, with one vertex marked by a nonzero potential. From an initial equal superposition, the state evolves in a two-dimensional subspace. Strongly regular graphs have a local symmetry that ensures that the state evolves in a three-dimensional subspace but most have no global symmetry. Using degenerate perturbation theory, we show that quantum random walk search on known families of strongly regular graphs, nevertheless, achieves the full quantum speed-up of $\mathrm{\ensuremath{\Theta}}(\sqrt{N})$, disproving the intuition that fast quantum search requires global symmetry.

arXiv:1403.2228•Physical Review Letters•May 28, 2014•89 citations

Quantum Search on Strongly Regular Graphs

Jonatan Janmark

In 1996, Farhi & Gutmann presented a continuous time analogue of Grover’s algorithm which was later interpreted as search by a quantum random walk on the complete graph. Similar work has since then been done on hypercubes and periodic lattices. We investigate the same search algorithm but for a new type of graphs called strongly regular graphs. The problem is solved by a, in this context, new technique involving degenerate perturbation theory. The result is that the search is optimal on all strongly regular graphs when the number of vertices N is large. However, different kinds of strongly regular graphs perform different when N is not large. Analyzing this provides some insight into what properties of graphs that are important for quantum search. Apart from the results, an important takeaway is the degenerate perturbation theory technique that was used to solve the problem and might be useful in solving other similar problems. In the thesis, an alternative solution to the complete graph case is given using this method. Also, the fact that strongly regular graphs proved to be convenient to analyze in these kinds of settings suggests that they can be used in other similar problems.

•Jan 1, 2013•1 citation

Connectivity is a Poor Indicator of Fast Quantum Search

David Meyer, Thomas G. Wong

A randomly walking quantum particle evolving by Schrödinger's equation searches on d-dimensional cubic lattices in O(√N) time when d≥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 Letter, 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.

arXiv:1409.5876•Physical Review Letters•Mar 18, 2015•88 citations

Quantum invariants and the graph isomorphism problem

P. W. Mills, R. P. Rundle, J. H. Samson +4 more

Three graph invariants are introduced which may be measured from a quantum graph state and form examples of a framework under which other graph invariants can be constructed. Each invariant is based on distinguishing a different number of qubits. This is done by applying different measurements to the qubits to be distinguished. The performance of these invariants is evaluated and compared to classical invariants. We verify that the invariants can distinguish all nonisomorphic graphs with nine or fewer nodes. The invariants have also been applied to ``classically hard'' strongly regular graphs, successfully distinguishing all strongly regular graphs of up to 29 nodes, and preliminarily to weighted graphs. We have found that, although it is possible to prepare states with a polynomial number of operations, the average number of preparations required to distinguish nonisomorphic graph states scales exponentially with the number of nodes. We have so far been unable to find operators which reliably compare graphs and reduce the required number of preparations to feasible levels.

arXiv:1711.09842•Physical Review A•Nov 13, 2019•12 citations

Search algorithm on strongly regular graphs based on scattering quantum walk

Xiling Xue, Zhihao Liu, Hanwu Chen

Janmark, Meyer, and Wong showed that continuous-time quantum walk search on known families of strongly regular graphs (SRGs) with parameters ( N , k , λ , μ ) achieves full quantum speedup. The problem is reconsidered in terms of scattering quantum walk, a type of discrete-time quantum walks. Here, the search space is confined to a low-dimensional subspace corresponding to the collapsed graph of SRGs. To quantify the algorithm's performance, we leverage the fundamental pairing theorem, a general theory developed by Cottrell for quantum search of structural anomalies in star graphs. The search algorithm on the SRGs with k scales as N satisfies the theorem, and results can be immediately obtained, while search on the SRGs with k scales as N does not satisfy the theorem, and matrix perturbation theory is used to provide an analysis. Both these cases can be solved in O ( N ) time steps with a success probability close to 1. The analytical conclusions are verified by simulation results on two SRGs. These examples show that the formalism on star graphs can be applied more generally.

Chinese Physics B•Jan 1, 2017•5 citations
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.
© 2014 IOP Publishing Ltd. In this paper we present a lemma, which helps us to establish a link between the distribution of success probabilities from quantum walk based search and the symmetries of the underlying graphs. With the aid of the lemma, we identified certain graph structures of which the quantum walk based search provides high success probabilities at the marked vertices. We also observed that many graph structures and their vertices can be classified according to their structural equivalence using the search probabilities provided by quantum walks, although this method cannot resolve all non-equivalent vertices for strongly regular graphs.
Grover's quantum search algorithm can be formulated as a quantum particle randomly walking on the (highly symmetric) complete graph, with one vertex marked by a nonzero potential. From an initial equal superposition, the state evolves in a two-dimensional subspace. Strongly regular graphs have a local symmetry that ensures that the state evolves in a three-dimensional subspace but most have no global symmetry. Using degenerate perturbation theory, we show that quantum random walk search on known families of strongly regular graphs, nevertheless, achieves the full quantum speed-up of $\mathrm{\ensuremath{\Theta}}(\sqrt{N})$, disproving the intuition that fast quantum search requires global symmetry.
In 1996, Farhi & Gutmann presented a continuous time analogue of Grover’s algorithm which was later interpreted as search by a quantum random walk on the complete graph. Similar work has since then been done on hypercubes and periodic lattices. We investigate the same search algorithm but for a new type of graphs called strongly regular graphs. The problem is solved by a, in this context, new technique involving degenerate perturbation theory. The result is that the search is optimal on all strongly regular graphs when the number of vertices N is large. However, different kinds of strongly regular graphs perform different when N is not large. Analyzing this provides some insight into what properties of graphs that are important for quantum search. Apart from the results, an important takeaway is the degenerate perturbation theory technique that was used to solve the problem and might be useful in solving other similar problems. In the thesis, an alternative solution to the complete graph case is given using this method. Also, the fact that strongly regular graphs proved to be convenient to analyze in these kinds of settings suggests that they can be used in other similar problems.
A randomly walking quantum particle evolving by Schrödinger's equation searches on d-dimensional cubic lattices in O(√N) time when d≥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 Letter, 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.
Three graph invariants are introduced which may be measured from a quantum graph state and form examples of a framework under which other graph invariants can be constructed. Each invariant is based on distinguishing a different number of qubits. This is done by applying different measurements to the qubits to be distinguished. The performance of these invariants is evaluated and compared to classical invariants. We verify that the invariants can distinguish all nonisomorphic graphs with nine or fewer nodes. The invariants have also been applied to ``classically hard'' strongly regular graphs, successfully distinguishing all strongly regular graphs of up to 29 nodes, and preliminarily to weighted graphs. We have found that, although it is possible to prepare states with a polynomial number of operations, the average number of preparations required to distinguish nonisomorphic graph states scales exponentially with the number of nodes. We have so far been unable to find operators which reliably compare graphs and reduce the required number of preparations to feasible levels.
Janmark, Meyer, and Wong showed that continuous-time quantum walk search on known families of strongly regular graphs (SRGs) with parameters ( N , k , λ , μ ) achieves full quantum speedup. The problem is reconsidered in terms of scattering quantum walk, a type of discrete-time quantum walks. Here, the search space is confined to a low-dimensional subspace corresponding to the collapsed graph of SRGs. To quantify the algorithm's performance, we leverage the fundamental pairing theorem, a general theory developed by Cottrell for quantum search of structural anomalies in star graphs. The search algorithm on the SRGs with k scales as N satisfies the theorem, and results can be immediately obtained, while search on the SRGs with k scales as N does not satisfy the theorem, and matrix perturbation theory is used to provide an analysis. Both these cases can be solved in O ( N ) time steps with a success probability close to 1. The analytical conclusions are verified by simulation results on two SRGs. These examples show that the formalism on star graphs can be applied more generally.