全部
  • 全部
  • 标题
  • 简介
  • TAG
谷歌量子计算论文
推荐星级:
时间:2019-10-28
大小:1.57MB
阅读数:157
上传用户:Kayla
查看他发布的资源
下载次数
2
所需E币
1
资料介绍
The promise of quantum computers is that certain computational tasks might be executed exponentially faster on a quantum processor than on a classical processor1. A fundamental challenge is to build a high-fidelity processor capable of running quantum algorithms in an exponentially large computational space. Here we report the use of a processor with programmable superconducting qubits2–7 to create quantum states on 53 qubits, corresponding to a computational state-space of dimension 253 (about 1016). Measurements from repeated experiments sample the resulting probability distribution, which we verify using classical simulations. Our Sycamore processor takes about 200 seconds to sample one instance of a quantum circuit a million times—our benchmarks currently indicate that the equivalent task for a state-of-the-art classical supercomputer would take approximately 10,000 years. This dramatic increase in speed compared to all known classical algorithms is an experimental realization of quantum supremacy8–14 for this specific computational task, heralding a muchanticipated computing paradigm.

0
收藏 举报
相关评论 (下载后评价送E币 我要评论)
  • 没有更多评论了
  • 可能感兴趣
  • 关注本资料的网友还下载了
  • 技术白皮书