期刊
SCIENCE
卷 362, 期 6412, 页码 308-+出版社
AMER ASSOC ADVANCEMENT SCIENCE
DOI: 10.1126/science.aar3106
关键词
-
资金
- IBM Research Frontiers Institute
- Technical University of Munich-Institute for Advanced Study - German Excellence Initiative
- European Union Seventh Framework Programme [291763]
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).
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据