新科学想法 › 文献管理 › 浏览文献

Demonstration of quantum advantage in machine learning

zqyin 添加于 2015-12-21 10:49 | 1499 次阅读 | 0 个评论
  •  作 者

    Ristè D, Silva MP da, Ryan CA, Cross AW, Smolin JA, Gambetta JM, Chow JM, Johnson BR
  •  摘 要

    The main promise of quantum computing is to efficiently solve certain problems that are prohibitively expensive for a classical computer. Most problems with a proven quantum advantage involve the repeated use of a black box, or oracle, whose structure encodes the solution. One measure of the algorithmic performance is the query complexity, i.e., the scaling of the number of oracle calls needed to find the solution with a given probability. Few-qubit demonstrations of quantum algorithms, such as Deutsch-Jozsa and Grover, have been implemented across diverse physical systems such as nuclear magnetic resonance, trapped ions, optical systems, and superconducting circuits. However, at the small scale, these problems can already be solved classically with a few oracle queries, and the attainable quantum advantage is modest. Here we solve an oracle-based problem, known as learning parity with noise, using a five-qubit superconducting processor. Running classical and quantum algorithms on the same oracle, we observe a large gap in query count in favor of quantum processing. We find that this gap grows by orders of magnitude as a function of the error rates and the problem size. This result demonstrates that, while complex fault-tolerant architectures will be required for universal quantum computing, a quantum advantage already emerges in existing noisy systems
  •  详细资料

    • 关键词: quant-ph
    • 文献种类:手稿
    • 期卷页: 2015年
    • 日期: 2015-12-19
    • 发布方式: arXiv e-prints
    • 备注:arXiv:1512.06069v1; 8 pages, including 4 figures and methods. 7 supplementary figures, 1 supplementary table
  • 相关链接  URL 

  •  zqyin 的文献笔记  订阅


管理选项: 导出文献

评论(0 人)

facelist doodle 涂鸦板

Copyright;  © 新科学想法 2016-2017   浙公网安备 33010202000686号   ( 浙ICP备09035230号-1 )