Quantum supremacy using a programmable superconducting processor
Quantum supremacy using a programmable superconducting processor
复制标题
DOI：
10.1038/s41586-019-1666-5
复制
发表时间：
2019-10-24
期刊：
影响因子：
64.8
通讯作者：
Martinis, John M.
中科院分区：
文献类型：
--
作者：
Arute, Frank;Arya, Kunal;Martinis, John M.
量子计算机的前景是，某些计算任务在量子处理器上的执行速度可能比在经典处理器上快得多。一个根本的挑战是建立一个高保真处理器，能够在指数级大的计算空间中运行量子算法。在这里，我们报告了使用具有可编程超导量子位（2-7）的处理器在53个量子位上创建量子态，对应于2（53）维（约10（16））的计算状态空间。从重复实验的测量样本产生的概率分布，我们使用经典模拟验证。我们的西卡莫尔处理器大约需要200秒来对一个量子电路的一个实例进行一百万次采样--我们的基准测试目前表明，一台最先进的经典超级计算机的同等任务大约需要10,000年。与所有已知的经典算法相比，这种速度的显着提高是这种特定计算任务的量子霸权（8-14）的实验实现，预示着一种备受期待的计算范式。
The promise of quantum computers is that certain computational tasks might be executed exponentially faster on a quantum processor than on a classical processor(1). 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 qubits(2-7) to create quantum states on 53 qubits, corresponding to a computational state-space of dimension 2(53) (about 10(16)). 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 supremacy(8-14) for this specific computational task, heralding a much-anticipated computing paradigm.