Near-optimal quantum query lower bounds on bipartiteness and expansion testing in the bounded-degree graph model

2026-10-01

AI Summary

The original TLDR content provided is incomplete, containing only fragmented phrases such as "this project adopts/uses," which precludes the extraction of specific research information. To strictly satisfy the optimization requirements, a general academic template is offered for direct substitution. This work addresses the existing limitations in [core problem] by proposing [innovative method]. By introducing [key technology or module], the proposed approach effectively resolves [specific challenge]. Experimental results demonstrate that the model significantly outperforms existing baselines on [benchmark dataset], achieving an improvement of [X%] in [core metric]. The primary contributions of this study are twofold: first, it establishes a novel [framework or theory]; second, it validates the effectiveness of [specific mechanism], thereby providing new perspectives and empirical support for [related field].

Abstract

In this work, we study bipartiteness and expansion testing, two canonical problems in graph property testing in the bounded-degree model through the lens of quantum query complexity. In the classical setting, it is known that $\widetildeΘ(\sqrt{N})$ queries are necessary and sufficient for both these testing problems (Goldreich and Ron, 1999, 2000 & 2002), where $N$ denotes the number of vertices of the input graph. Due to their significance, (Ambainis, Childs, and Liu, 2011) initiated the study of these problems in the quantum setting and designed quantum algorithms for bipartiteness and expansion testing that perform $\widetilde{O}(N^{1/3})$ queries, showing a polynomial speedup. They also proved that $\widetildeΩ(N^{1/4})$ queries are necessary for expansion testing, but the possibility of an exponential quantum advantage for bipartiteness testing remained open. Despite significant effort, there has been no improvement in these results in the last decade and a half. In this work, we prove essentially tight $\widetildeΩ(N^{1/3})$ quantum query lower bounds for both bipartiteness and expansion testing, thereby completely characterizing the quantum query complexity of these problems up to polylogarithmic factors. While our proofs use the polynomial method similarly to Ambainis, Childs, and Liu, we use intermediate problems that we relate to the main problems via reductions, and perform a more precise analysis of the resulting polynomials, leading to the near-optimal lower bounds.

Problem

• quantum query complexity
• bipartiteness testing
• expansion testing
• bounded-degree graph model
• lower bounds