Publication Date:
2018
Description:
〈p〉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).〈/p〉
Print ISSN:
0036-8075
Electronic ISSN:
1095-9203
Topics:
Biology
,
Chemistry and Pharmacology
,
Computer Science
,
Medicine
,
Natural Sciences in General
,
Physics
Permalink
