Forrelation: A Problem That Optimally Separates Quantum from Classical Computing
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 pro...
Main Authors: | Aaronson, Scott (Contributor), Ambainis, Andris (Author) |
---|---|
Other Authors: | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science (Contributor) |
Format: | Article |
Language: | English |
Published: |
Association for Computing Machinery (ACM),
2015-11-02T19:43:04Z.
|
Subjects: | |
Online Access: | Get fulltext |
Similar Items
-
The need for structure in quantum speedups
by: Aaronson, Scott, et al.
Published: (2012) -
Advice coins for classical and quantum computation
by: Aaronson, Scott, et al.
Published: (2012) -
Closed timelike curves make quantum and classical computing equivalent
by: Aaronson, Scott, et al.
Published: (2010) -
Ripples Across The Internet of Things : Context Metrics as Vehicles forRelational Self-Organization
by: Walters, Jamie
Published: (2011) -
Rūsiņš Mārtiņš Freivalds (1942–2016), Latvian computer scientist
by: Ambainis Andris
Published: (2016-04-01)