View in EDS

SYMMETRIES, GRAPH PROPERTIES, AND QUANTUM SPEEDUPS.

Saved in:
Bibliographic Details
Title: SYMMETRIES, GRAPH PROPERTIES, AND QUANTUM SPEEDUPS.
Authors: BEN-DAVID, SHALEV1 shalev.b@uwaterloo.ca, CHILDS, ANDREW M.2 amchilds@umd.edu, GILYÉN, ANDRÁS3 gilyen@renyi.hu, KRETSCHMER, WILLIAM4 kretsch@berkeley.edu, PODDER, SUPARTHA5 supartha@cs.stonybrook.edu, DAOCHEN WANG6 wdaochen@gmail.com
Source: SIAM Journal on Computing. 2024, Vol. 53 Issue 6, p368-415. 48p.
Subjects: Computer science conferences, Symmetric functions, Open-ended questions, Symmetry, Polynomials
Abstract: Aaronson and Ambainis [Theory Comput., 10 (2014), pp. 133--166] and Chailloux [Proceedings of the 10th 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)]. [ABSTRACT FROM AUTHOR]
Copyright of SIAM Journal on Computing is the property of Society for Industrial & Applied Mathematics and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database: Engineering Source
Description
Abstract:Aaronson and Ambainis [Theory Comput., 10 (2014), pp. 133--166] and Chailloux [Proceedings of the 10th 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)]. [ABSTRACT FROM AUTHOR]
ISSN:00975397
DOI:10.1137/23M1573975