Symmetries, Graph Properties, and Quantum Speedups

  title={Symmetries, Graph Properties, and Quantum Speedups},
  author={Shalev Ben-David and Andrew M. Childs and Andr'as Gily'en and William Kretschmer and Supartha Podder and Daochen Wang},
  journal={2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS)},
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… Expand

Figures from this paper

Classical symmetries and QAOA
This work formalizes the connection between quantum symmetry properties of the QAOA dynamics and the group of classical symmetries of the objective function and provides numerical evidence that a small set of graph symmetry properties suffices to predict the minimumQAOA depth required to achieve a target approximation ratio on the MaxCut problem. Expand
(Sub)Exponential advantage of adiabatic Quantum computation with no sign problem
It is demonstrated the possibility of (sub)exponential quantum speedup via a quantum algorithm that follows an adiabatic path of a gapped Hamiltonian with no sign problem and it is shown that if the graph is given via an adjacency-list oracle, there is no classical algorithm that finds the “EXIT” with probability greater than exp(−nδ) using at most exp(n δ) queries. Expand
Quantum algorithms for learning graphs and beyond
We study the problem of learning an unknown graph provided via an oracle using a quantum algorithm. We consider three query models. In the first model ("OR queries"), the oracle returns whether aExpand
Quantum algorithms for graph problems with cut queries
It is shown that a quantum algorithm can learn a graph with maximum degree $d$ after $O(d \log(n)^2)$ many cut queries, and can learning a general graph with $O(\sqrt{m} \log (n)^{3/2})$ manycut queries. Expand
Classical Reinforcement Learning using Quantum Algorithms
This study investigates how the Harrow-Hassidim-Lloyd (HHL) Algorithm, the quantum algorithm for solving linear systems of equations (LSE), performs within the Policy Iteration of model-basedExpand


The Need for Structure in Quantum Speedups
It is shown that for any problem that is invariant under permuting inputs and outputs, the quantum query complexity is at least the 9 root of the classical randomized query complexity, and that one essentially cannot hope to prove P 6 BQP relative to a random oracle. Expand
Sculpting Quantum Speedups
This work gives a full characterization of sculptable functions in the query complexity setting, and investigates sculpting in the Turing machine model, showing that if there is any BPP-bi-immune language in BQP, then every language outside BPP can be restricted to a promise which places it in PromiseBQP but not in promiseBPP. Expand
Forrelation: A Problem that Optimally Separates Quantum from Classical Computing
It is conjectured that a natural generalization of Forrelation achieves the optimal t versus Ω(N1-1/2t) separation for all t, and it is shown that this generalization is BQP-complete. Expand
Quantum Property Testing for Bounded-Degree Graphs
These quantum algorithms follow from a combination of classical property testing techniques due to Goldreich and Ron, derandomization, and the quantum algorithm for element distinctness, using novel algebraic techniques and combinatorial analysis to accommodate the graph structure. Expand
Quantum lower bounds by polynomials
This work examines the number of queries to input variables that a quantum algorithm requires to compute Boolean functions on {0,1}N in the black-box model and gives asymptotically tight characterizations of T for all symmetric f in the exact, zero-error, and bounded-error settings. Expand
The Structure of Promises in Quantum Speedups
It is concluded that exponential quantum speedups only occur given "structured" promises on the input, and any function defined on a "symmetric set" - one invariant under $S_n$ - satisfies $R(f)=O(Q(f)^{12(M-1)})$. Expand
Quantum singular value transformation and beyond: exponential improvements for quantum matrix arithmetics
A new “Quantum singular value transformation” algorithm is developed that can directly harness the advantages of exponential dimensionality by applying polynomial transformations to the singular values of a block of a unitary operator. Expand
Property Testing in Bounded Degree Graphs
This work develops the study of testing graph properties as initiated by Goldreich, Goldwasser and Ron and presents randomized algorithms for testing whether an unknown bounded-degree graph is connected, k -connected (for k>1 ), cycle-free and Eulerian. Expand
A Note on the Quantum Query Complexity of Permutation Symmetric Functions
This paper improves the result of [AA14] and shows that for any permutation symmetric function f, the quantum query complexity is at most polynomially smaller than the classical randomized query complexity. Expand
Quantum query complexity and semi-definite programming
  • H. Barnum, M. Saks, M. Szegedy
  • Mathematics, Computer Science
  • 18th IEEE Annual Conference on Computational Complexity, 2003. Proceedings.
  • 2003
A general lower bound for quantum query complexity is derived that encompasses a lower bound method of Ambainis and its generalizations and an interpretation of a generalized form of branching in quantum computation. Expand