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:2006.12760 · Annual Symposium on Foundations of Computer Science

Symmetries, Graph Properties, and Quantum Speedups

Shalev Ben-David, Andrew M. Childs, Andras Gilyen, William Kretschmer, Supartha Podder, Daochen Wang

Published Nov 1, 2020• 32 citations
arXivHTMLPDF

Abstract

Aaronson and Ambainis (2009) and Chailloux (2018) showed that fully symmetric (partial) functions do not admit exponential quantum query speedups. This raises a natural question: how symmetric must a function be before it cannot exhibit a large quantum speedup? In this work, we prove that hypergraph symmetries in the adjacency matrix model allow at most a polynomial separation between randomized and quantum query complexities. We also show that, remarkably, permutation groups constructed out of these symmetries are essentially the only permutation groups that prevent super-polynomial quantum speedups. We prove this by fully characterizing the primitive permutation groups that allow super-polynomial quantum speedups. In contrast, in the adjacency list model for bounded-degree graphs-where graph symmetry is manifested differently-we exhibit a property testing problem that shows an exponential quantum speedup. These results resolve open questions posed by Ambainis, Childs, and Liu (2010) and Montanaro and de Wolf (2013).

DOI
10.1109/focs46700.2020.00066

Related papers

Symmetries, Graph Properties, and Quantum Speedups

Shalev Ben-David, Andrew M. Childs, András Gilyén +3 more

Abstract. Aaronson and Ambainis [ Theory Comput., 10 (2014), pp. 133–166] and Chailloux [ Proceedings of the 10 th Innovations in Theoretical Computer Science Conference, 2018, pp. 19:1–19:7] showed that fully symmetric (partial) functions do not admit exponential quantum query speedups. This raises a natural question: how symmetric must a function be before it cannot exhibit a large quantum speedup? In this work, we prove that hypergraph symmetries in the adjacency matrix model allow at most a polynomial separation between randomized and quantum query complexities. We also show that, remarkably, permutation groups constructed out of these symmetries are essentially the only permutation groups that prevent superpolynomial quantum speedups. We prove this by fully characterizing the primitive permutation groups that allow superpolynomial quantum speedups. In contrast, in the adjacency list model for bounded-degree graphs—where graph symmetry is manifested differently—we exhibit a property testing problem that shows an exponential quantum speedup. These results resolve open questions posed by Ambainis, Childs, and Liu [ Lecture Notes in Comput. Sci. 6845, Springer, 2011, pp. 365–376] and Montanaro and de Wolf [ Theory Comput., 7 (2016)].

SIAM Journal on Computing•Dec 13, 2024•8 citations

Can graph properties have exponential quantum speedup?

Andrew M. Childs, Daochen Wang

Quantum computers can sometimes exponentially outperform classical ones, but only for problems with sufficient structure. While it is well known that query problems with full permutation symmetry can have at most polynomial quantum speedup -- even for partial functions -- it is unclear how far this condition must be relaxed to enable exponential speedup. In particular, it is natural to ask whether exponential speedup is possible for (partial) graph properties, in which the input describes a graph and the output can only depend on its isomorphism class. We show that the answer to this question depends strongly on the input model. In the adjacency matrix model, we prove that the bounded-error randomized query complexity $R$ of any graph property $\mathcal{P}$ has $R(\mathcal{P}) = O(Q(\mathcal{P})^{6})$, where $Q$ is the bounded-error quantum query complexity. This negatively resolves an open question of Montanaro and de Wolf in the adjacency matrix model. More generally, we prove $R(\mathcal{P}) = O(Q(\mathcal{P})^{3l})$ for any $l$-uniform hypergraph property $\mathcal{P}$ in the adjacency matrix model. In direct contrast, in the adjacency list model for bounded-degree graphs, we exhibit a promise problem that shows an exponential separation between the randomized and quantum query complexities.

arXiv:2001.10520•Jan 28, 2020•6 citations

How symmetric is too symmetric for large quantum speedups?

Shalev Ben-David, Supartha Podder

Suppose a Boolean function $f$ is symmetric under a group action $G$ acting on the $n$ bits of the input. For which $G$ does this mean $f$ does not have an exponential quantum speedup? Is there a characterization of how rich $G$ must be before the function $f$ cannot have enough structure for quantum algorithms to exploit? In this work, we make several steps towards understanding the group actions $G$ which are "quantum intolerant" in this way. We show that sufficiently transitive group actions do not allow a quantum speedup, and that a "well-shuffling" property of group actions -- which happens to be preserved by several natural transformations -- implies a lack of super-polynomial speedups for functions symmetric under the group action. Our techniques are motivated by a recent paper by Chailloux (2018), which deals with the case where $G=S_n$. Our main application is for graph symmetries: we show that any Boolean function $f$ defined on the adjacency matrix of a graph (and symmetric under relabeling the vertices of the graph) has a power $6$ relationship between its randomized and quantum query complexities, even if $f$ is a partial function. In particular, this means no graph property testing problems can have super-polynomial quantum speedups, settling an open problem of Ambainis, Childs, and Liu (2011).

arXiv:2001.09642•Jan 27, 2020•2 citations

Optimal Separations Between Randomized and Quantum Query Complexity under Permutation Symmetry

Yunqi Huang, Lvzhou Li, Zekun Ye +1 more

A function $f:\cD\subseteq A^N\to\{0,1\}$ is \emph{permutation-invariant} if every permutation of its input positions preserves both its domain and its value. We study how this symmetry limits quantum speedups. For $1/6\leq\varepsilon<1/2$, we prove that every such function over an arbitrary finite alphabet $A$ satisfies $R_\varepsilon(f)=O(Q_\varepsilon(f)^2)$, where $R_\varepsilon$ and $Q_\varepsilon$ denote randomized and quantum query complexities with error at most $\varepsilon$. This improves the previous cubic bound (ITCS 2019). We further establish bounds for graph and hypergraph properties, for which vertex relabeling preserves both the promise and the answer. For the same range of $\varepsilon$, we obtain $R_\varepsilon(f)=O(Q_\varepsilon(f)^4)$ for graph properties in the adjacency-matrix model and $R_\varepsilon(f)=O_k(Q_\varepsilon(f)^{2k})$ for $k$-uniform hypergraph properties with fixed $k\geq2$, where the implicit constant depends only on $k$. These improve the previous bounds $R_{1/3}(f)=O(Q_{1/3}(f)^6)$ and $R_{1/3}(f)=O_k(Q_{1/3}(f)^{3k})$, respectively (SICOMP 2024) These bounds are tight for permutation-invariant functions and nearly tight for graph and hypergraph properties. Unstructured search gives a matching quadratic separation with $R_{1/3}(f)=Θ\!\left(Q_{1/3}(f)^2\right)$. For every fixed $k\geq 2$, we construct explicit families of invariant promise problems on $k$-uniform hypergraphs satisfying $R_{1/3}(f)\geq Q_{1/3}(f)^{2k-o(1)}$.

arXiv:2611.08919•Nov 6, 2026•0 citations

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

Chandrima Kayal, Sayantan Sen, Dániel Szabó

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.

quant-pharXiv:2610.01752•Oct 2, 2026•0 citations

The Structure of Promises in Quantum Speedups

Shalev Ben-David

In 1998, Beals, Buhrman, Cleve, Mosca, and de Wolf showed that no super-polynomial quantum speedup is possible in the query complexity setting unless there is a promise on the input. We examine several types of "unstructured" promises, and show that they also are not compatible with super-polynomial quantum speedups. We conclude that such speedups are only possible when the input is known to have some structure. Specifically, we show that there is a polynomial relationship of degree 18 between D(f) and Q(f) for any Boolean function f defined on permutations (elements of [n]^n in which each alphabet element occurs exactly once). More generally, this holds for all f defined on orbits of the symmetric group action (which acts on an element of [M]^n by permuting its entries). We also show that any Boolean function f defined on a "symmetric" subset of the Boolean hypercube has a polynomial relationship between R(f) and Q(f) - although in that setting, D(f) may be exponentially larger.

Leibniz international proceedings in informatics•Jan 1, 2016•7 citations
Aaronson and Ambainis (2009) and Chailloux (2018) showed that fully symmetric (partial) functions do not admit exponential quantum query speedups. This raises a natural question: how symmetric must a function be before it cannot exhibit a large quantum speedup? In this work, we prove that hypergraph symmetries in the adjacency matrix model allow at most a polynomial separation between randomized and quantum query complexities. We also show that, remarkably, permutation groups constructed out of these symmetries are essentially the only permutation groups that prevent super-polynomial quantum speedups. We prove this by fully characterizing the primitive permutation groups that allow super-polynomial quantum speedups. In contrast, in the adjacency list model for bounded-degree graphs-where graph symmetry is manifested differently-we exhibit a property testing problem that shows an exponential quantum speedup. These results resolve open questions posed by Ambainis, Childs, and Liu (2010) and Montanaro and de Wolf (2013).
Abstract. Aaronson and Ambainis [ Theory Comput., 10 (2014), pp. 133–166] and Chailloux [ Proceedings of the 10 th Innovations in Theoretical Computer Science Conference, 2018, pp. 19:1–19:7] showed that fully symmetric (partial) functions do not admit exponential quantum query speedups. This raises a natural question: how symmetric must a function be before it cannot exhibit a large quantum speedup? In this work, we prove that hypergraph symmetries in the adjacency matrix model allow at most a polynomial separation between randomized and quantum query complexities. We also show that, remarkably, permutation groups constructed out of these symmetries are essentially the only permutation groups that prevent superpolynomial quantum speedups. We prove this by fully characterizing the primitive permutation groups that allow superpolynomial quantum speedups. In contrast, in the adjacency list model for bounded-degree graphs—where graph symmetry is manifested differently—we exhibit a property testing problem that shows an exponential quantum speedup. These results resolve open questions posed by Ambainis, Childs, and Liu [ Lecture Notes in Comput. Sci. 6845, Springer, 2011, pp. 365–376] and Montanaro and de Wolf [ Theory Comput., 7 (2016)].
Quantum computers can sometimes exponentially outperform classical ones, but only for problems with sufficient structure. While it is well known that query problems with full permutation symmetry can have at most polynomial quantum speedup -- even for partial functions -- it is unclear how far this condition must be relaxed to enable exponential speedup. In particular, it is natural to ask whether exponential speedup is possible for (partial) graph properties, in which the input describes a graph and the output can only depend on its isomorphism class. We show that the answer to this question depends strongly on the input model. In the adjacency matrix model, we prove that the bounded-error randomized query complexity RRR of any graph property P\mathcal{P}P has R(P)=O(Q(P)6)R(\mathcal{P}) = O(Q(\mathcal{P})^{6})R(P)=O(Q(P)6), where QQQ is the bounded-error quantum query complexity. This negatively resolves an open question of Montanaro and de Wolf in the adjacency matrix model. More generally, we prove R(P)=O(Q(P)3l)R(\mathcal{P}) = O(Q(\mathcal{P})^{3l})R(P)=O(Q(P)3l) for any lll-uniform hypergraph property P\mathcal{P}P in the adjacency matrix model. In direct contrast, in the adjacency list model for bounded-degree graphs, we exhibit a promise problem that shows an exponential separation between the randomized and quantum query complexities.
Suppose a Boolean function fff is symmetric under a group action GGG acting on the nnn bits of the input. For which GGG does this mean fff does not have an exponential quantum speedup? Is there a characterization of how rich GGG must be before the function fff cannot have enough structure for quantum algorithms to exploit? In this work, we make several steps towards understanding the group actions GGG which are "quantum intolerant" in this way. We show that sufficiently transitive group actions do not allow a quantum speedup, and that a "well-shuffling" property of group actions -- which happens to be preserved by several natural transformations -- implies a lack of super-polynomial speedups for functions symmetric under the group action. Our techniques are motivated by a recent paper by Chailloux (2018), which deals with the case where G=SnG=S_nG=Sn​. Our main application is for graph symmetries: we show that any Boolean function fff defined on the adjacency matrix of a graph (and symmetric under relabeling the vertices of the graph) has a power 666 relationship between its randomized and quantum query complexities, even if fff is a partial function. In particular, this means no graph property testing problems can have super-polynomial quantum speedups, settling an open problem of Ambainis, Childs, and Liu (2011).
A function $f:\cD\subseteq A^N\to\{0,1\}$ is \emph{permutation-invariant} if every permutation of its input positions preserves both its domain and its value. We study how this symmetry limits quantum speedups. For 1/6≤ε<1/21/6\leq\varepsilon<1/21/6≤ε<1/2, we prove that every such function over an arbitrary finite alphabet AAA satisfies Rε(f)=O(Qε(f)2)R_\varepsilon(f)=O(Q_\varepsilon(f)^2)Rε​(f)=O(Qε​(f)2), where RεR_\varepsilonRε​ and QεQ_\varepsilonQε​ denote randomized and quantum query complexities with error at most ε\varepsilonε. This improves the previous cubic bound (ITCS 2019). We further establish bounds for graph and hypergraph properties, for which vertex relabeling preserves both the promise and the answer. For the same range of ε\varepsilonε, we obtain Rε(f)=O(Qε(f)4)R_\varepsilon(f)=O(Q_\varepsilon(f)^4)Rε​(f)=O(Qε​(f)4) for graph properties in the adjacency-matrix model and Rε(f)=Ok(Qε(f)2k)R_\varepsilon(f)=O_k(Q_\varepsilon(f)^{2k})Rε​(f)=Ok​(Qε​(f)2k) for kkk-uniform hypergraph properties with fixed k≥2k\geq2k≥2, where the implicit constant depends only on kkk. These improve the previous bounds R1/3(f)=O(Q1/3(f)6)R_{1/3}(f)=O(Q_{1/3}(f)^6)R1/3​(f)=O(Q1/3​(f)6) and R1/3(f)=Ok(Q1/3(f)3k)R_{1/3}(f)=O_k(Q_{1/3}(f)^{3k})R1/3​(f)=Ok​(Q1/3​(f)3k), respectively (SICOMP 2024) These bounds are tight for permutation-invariant functions and nearly tight for graph and hypergraph properties. Unstructured search gives a matching quadratic separation with R1/3(f)=Θ ⁣(Q1/3(f)2)R_{1/3}(f)=Θ\!\left(Q_{1/3}(f)^2\right)R1/3​(f)=Θ(Q1/3​(f)2). For every fixed k≥2k\geq 2k≥2, we construct explicit families of invariant promise problems on kkk-uniform hypergraphs satisfying R1/3(f)≥Q1/3(f)2k−o(1)R_{1/3}(f)\geq Q_{1/3}(f)^{2k-o(1)}R1/3​(f)≥Q1/3​(f)2k−o(1).
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 Θ~(N)\widetildeΘ(\sqrt{N})Θ(N​) queries are necessary and sufficient for both these testing problems (Goldreich and Ron, 1999, 2000 & 2002), where NNN 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 O~(N1/3)\widetilde{O}(N^{1/3})O(N1/3) queries, showing a polynomial speedup. They also proved that Ω~(N1/4)\widetildeΩ(N^{1/4})Ω(N1/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 Ω~(N1/3)\widetildeΩ(N^{1/3})Ω(N1/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.
In 1998, Beals, Buhrman, Cleve, Mosca, and de Wolf showed that no super-polynomial quantum speedup is possible in the query complexity setting unless there is a promise on the input. We examine several types of "unstructured" promises, and show that they also are not compatible with super-polynomial quantum speedups. We conclude that such speedups are only possible when the input is known to have some structure. Specifically, we show that there is a polynomial relationship of degree 18 between D(f) and Q(f) for any Boolean function f defined on permutations (elements of [n]^n in which each alphabet element occurs exactly once). More generally, this holds for all f defined on orbits of the symmetric group action (which acts on an element of [M]^n by permuting its entries). We also show that any Boolean function f defined on a "symmetric" subset of the Boolean hypercube has a polynomial relationship between R(f) and Q(f) - although in that setting, D(f) may be exponentially larger.