Quantum property testing for bounded-degree graphs
Abstract
We study quantum algorithms for testing bipartiteness and expansion of bounded-degree graphs. We give quantum algorithms that solve these problems in time O(N^(1/3)), beating the Omega(sqrt(N)) classical lower bound. For testing expansion, we also prove an Omega(N^(1/4)) quantum query lower bound, thus ruling out the possibility of an exponential quantum speedup. Our quantum algorithms follow from a combination of classical property testing techniques due to Goldreich and Ron, derandomization, and the quantum algorithm for element distinctness. The quantum lower bound is obtained by the polynomial method, using novel algebraic techniques and combinatorial analysis to accommodate the graph structure.
Cite
@article{arxiv.1012.3174,
title = {Quantum property testing for bounded-degree graphs},
author = {Andris Ambainis and Andrew M. Childs and Yi-Kai Liu},
journal= {arXiv preprint arXiv:1012.3174},
year = {2011}
}
Comments
21 pages; v3: more detailed proof of the lower bound; v2: minor corrections to Lemma 6