Journal
SCIENCE
Volume 362, Issue 6412, Pages 308-+Publisher
AMER ASSOC ADVANCEMENT SCIENCE
DOI: 10.1126/science.aar3106
Keywords
-
Categories
Funding
- IBM Research Frontiers Institute
- Technical University of Munich-Institute for Advanced Study - German Excellence Initiative
- European Union Seventh Framework Programme [291763]
Ask authors/readers for more resources
Quantum effects can enhance information-processing capabilities and speed up the solution of certain computational problems. Whether a quantum advantage can be rigorously proven in some setting or demonstrated experimentally using near-term devices is the subject of active debate. We show that parallel quantum algorithms running in a constant time period are strictly more powerful than their classical counterparts; they are provably better at solving certain linear algebra problems associated with binary quadratic forms. Our work gives an unconditional proof of a computational quantum advantage and simultaneously pinpoints its origin: It is a consequence of quantum nonlocality. The proposed quantum algorithm is a suitable candidate for near-future experimental realizations, as it requires only constant-depth quantum circuits with nearest-neighbor gates on a two-dimensional grid of qubits (quantum bits).
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available