Quantum Property Testing for Bounded-Degree Directed Graphs

TL;DR

This paper demonstrates a significant quantum speedup in property testing of bounded-degree directed graphs, showing quantum algorithms outperform classical ones in query complexity.

Contribution

It establishes a nearly quadratic quantum speedup for testing properties in the unidirectional model and proves the near-tightness of this speedup.

Findings

Quantum algorithms test graph properties with fewer queries than classical algorithms.

An explicit property requires almost quadratic quantum queries, matching the speedup.

Constant-size subgraph occurrences can be approximated with sublinear quantum queries.

Abstract

We study quantum property testing for directed graphs with maximum in-degree and out-degree bounded by some universal constant $d$. For a proximity parameter $\varepsilon$, we show that any property that can be tested with $O_{\varepsilon,d}(1)$ queries in the classical bidirectional model, where both incoming and outgoing edges are accessible, can also be tested in the quantum unidirectional model, where only outgoing edges are accessible, using $n^{1/2 - \Omega_{\varepsilon,d}(1)}$ queries. This yields an almost quadratic quantum speedup over the best known classical algorithms in the unidirectional model. Moreover, we prove that our transformation is almost tight by giving an explicit property $P_\varepsilon$ that is $\varepsilon$-testable within $O_\varepsilon(1)$ classical queries in the bidirectional model, but requires $\widetilde{\Omega}(n^{1/2-f'(\varepsilon)})$ quantum queries in the unidirectional model, where $f'(\varepsilon)$ is a function that approaches $0$ as $\varepsilon$ approaches $0$. As a byproduct, we show that in the unidirectional model, the number of occurrences of any constant-size subgraph $H$ can be approximated up to additive error $\delta n$ using $o(\sqrt{n})$ quantum queries.