Efficient Quantum Algorithms for (Gapped) Group Testing and Junta Testing

Andris Ambainis; Aleksandrs Belovs; Oded Regev; Ronald de Wolf

Home/Archive/arXiv

arXiv · 1507.03126

Efficient Quantum Algorithms for (Gapped) Group Testing and Junta Testing

Andris Ambainis·Aleksandrs Belovs·Oded Regev·Ronald de Wolf

View original source ↗Read source document ↗Export metadata ↓

Abstract

In the $k$-junta testing problem, a tester has to efficiently decide whether a given function $f:\{0,1\}^n\rightarrow \{0,1\}$ is a $k$-junta (i.e., depends on at most $k$ of its input bits) or is $\epsilon$-far from any $k$-junta. Our main result is a quantum algorithm for this problem with query complexity $\tilde O(\sqrt{k/\epsilon})$ and time complexity $\tilde O(n\sqrt{k/\epsilon})$. This quadratically improves over the query complexity of the previous best quantum junta tester, due to At\i c\i\ and Servedio. Our tester is based on a new quantum algorithm for a gapped version of the combinatorial group testing problem, with an up to quartic improvement over the query complexity of the best classical algorithm. For our upper bound on the time complexity we give a near-linear time implementation of a shallow variant of the quantum Fourier transform over the symmetric group, similar to the Schur-Weyl transform. We also prove a lower bound of $\Omega(k^{1/3})$ queries for junta-testing (for constant $\epsilon$).

Explore related subjects

cs.CC quant-ph

Keep this discovery

BibTeX RIS

Andris Ambainis, Aleksandrs Belovs, Oded Regev, Ronald de Wolf. 2015-07-11. Efficient Quantum Algorithms for (Gapped) Group Testing and Junta Testing. https://arxiv.org/abs/1507.03126

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

The Computational Complexity of Holant Problems on 4-regular Graphs from the Stable Subgroup Sequence of $SL(2,\mathbb{C})$

The Holant framework provides a general setting for studying counting problems and includes graph homomorphisms (\#GH) and counting constraint satisfaction problems (\#CSP) as special cases. Over the past twenty years, a series of computational complexity dichotomies have been established for Holant problems, but the classification for complex-valued signatures is still open. The main obstacle is the case in which all signatures have even arity. In this paper, we establish a dichotomy for Holant problems with a complex-valued 4-ary signature, which is a key base case for the full classification of Holant problems. We present a new strategy by introducing Schur's theorem, the classification of finite subgroups of $\mathrm{SL}(2,\mathbb{C})$ and stable subgroup sequences into the proof. These new techniques are of independent interest.

cs.CC↗

arXiv2026

Max Independent Set Remains NP-hard when Excluding a Planar Induced Minor

We show that there is a fixed planar graph $H$, namely the $5 \times 5$ grid, such that Max Independent Set remains NP-hard in $H$-induced-minor-free graphs. This refutes the Dallard--Milani\v{c}--\v{S}torgel conjecture and a weakening of it by Gartland and Lokshtanov, and by Korhonen.

cs.CC↗

arXiv2026

Topology inside NC$^1$

We show that ACC$^0$ is precisely what can be computed with constant-width circuits of polynomial size and polylogarithmic genus. This extends a characterization given by Hansen, showing that planar constant-width circuits also characterize ACC$^0$. Thus polylogarithmic genus provides no additional computational power in this model. We consider other generalizations of planarity, including crossing number and thickness. We show that constant-width circuits of polynomial size and thickness two already suffice to capture all of NC$^1$.

cs.CC↗