Forrelation: A Problem That Optimally Separates Quantum from Classical Computing
Name
Aaronson_Forrelation.pdf
Size
193.44 KB
Format
Adobe PDF
Checksum (MD5)
8d10e4876630fea6d8ceed164e5f2cc6
Author(s)
Aaronson, Scott
Ambainis, Andris
Date Issued
June 2015
Journal
Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing (STOC '15)
Publisher
Association for Computing Machinery (ACM)
Citation
Scott Aaronson and Andris Ambainis. 2015. Forrelation: A Problem that Optimally Separates Quantum from Classical Computing. In Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing (STOC '15). ACM, New York, NY, USA, 307-316.
Version
Author's final manuscript
Abstract
We achieve essentially the largest possible separation between quantum and classical query complexities. We do so using a property-testing problem called Forrelation, where one needs to decide whether one Boolean function is highly correlated with the Fourier transform of a second function. This problem can be solved using 1 quantum query, yet we show that any randomized algorithm needs Ω(√(N)log(N)) queries (improving an Ω(N[superscript 1/4]) lower bound of Aaronson). Conversely, we show that this 1 versus Ω(√(N)) separation is optimal: indeed, any t-query quantum algorithm whatsoever can be simulated by an O(N[superscript 1-1/2t])-query randomized algorithm. Thus, resolving an open question of Buhrman et al. from 2002, there is no partial Boolean function whose quantum query complexity is constant and whose randomized query complexity is linear. We conjecture that a natural generalization of Forrelation achieves the optimal t versus Ω(N[superscript 1-1/2t]) separation for all t. As a bonus, we show that this generalization is BQP-complete. This yields what's arguably the simplest BQP-complete problem yet known, and gives a second sense in which Forrelation "captures the maximum power of quantum computation."
MIT Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1145/2746539.2746547
