Symmetries, graph properties, and quantum speedups

06/23/2020
by   Shalev Ben-David, et al.
0

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).

READ FULL TEXT

page 1

page 2

page 3

page 4

01/28/2020

Can graph properties have exponential quantum speedup?

Quantum computers can sometimes exponentially outperform classical ones,...
01/27/2020

How symmetric is too symmetric for large quantum speedups?

Suppose a Boolean function f is symmetric under a group action G acting ...
04/28/2020

Quantum Implications of Huang's Sensitivity Theorem

Based on the recent breakthrough of Huang (2019), we show that for any t...
10/23/2020

Degree vs. Approximate Degree and Quantum Implications of Huang's Sensitivity Theorem

Based on the recent breakthrough of Huang (2019), we show that for any t...
10/05/2020

A Query-Efficient Quantum Algorithm for Maximum Matching on General Graphs

We design quantum algorithms for maximum matching. Working in the query ...
04/24/2019

Normalizers and permutational isomorphisms in simply-exponential time

We show that normalizers and permutational isomorphisms of permutation g...
08/05/2022

Towards Antisymmetric Neural Ansatz Separation

We study separations between two fundamental models (or Ansätze) of anti...