Quantum advantage with shallow circuits

• Published in: Science (American Association for the Advancement of Science) Vol. 362; no. 6412; pp. 308 - 311
• Main Authors: Bravyi, Sergey, Gosset, David, König, Robert
• Format: Journal Article
• Language: English
• Published: United States The American Association for the Advancement of Science 19.10.2018
• Subjects: Algebra; Algorithms; Circuits; Complexity theory; Computation; Computer applications; Computers; Information processing; Linear algebra; Nearest-neighbor; Quadratic forms; Quantum computers; Qubits (quantum computing)
• DOI: 10.1126/science.aar3106
• ISSN: 0036-8075; 1095-9203

Quantum computers are expected to be better at solving certain computational problems than classical computers. This expectation is based on (well-founded) conjectures in computational complexity theory, but rigorous comparisons between the capabilities of quantum and classical algorithms are difficult to perform. Bravyi et al. proved theoretically that whereas the number of “steps” needed by parallel quantum circuits to solve certain linear algebra problems was independent of the problem size, this number grew logarithmically with size for analogous classical circuits (see the Perspective by Montanaro). This so-called quantum advantage stems from the quantum correlations present in quantum circuits that cannot be reproduced in analogous classical circuits. Science , this issue p. 308 ; see also p. 289 Parallel quantum circuits outperform classical counterparts at solving certain linear algebra problems. 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).