论文标题

Google的随机量子电路模拟实验有什么关于量子至上的?

What Have Google's Random Quantum Circuit Simulation Experiments Demonstrated about Quantum Supremacy?

论文作者

Horner, Jack K., Symons, John F.

论文摘要

量子计算引起了人们的兴趣,因为它承诺至少执行某种计算速度要比古典计算机快得多。 Arute等。 2019年(非正式地,“ Google Quantum团队”)报告了旨在证明“量子至上”的实验结果,即某些量子计算机的性能优于古典计算机在某些问题上的性能。这些结果是否结束了关于量子至高无上的辩论?我们认为他们没有。我们提供了Google Quantum团队实验的概述,然后确定一些开放问题,以证明量子至上。

Quantum computing is of high interest because it promises to perform at least some kinds of computations much faster than classical computers. Arute et al. 2019 (informally, "the Google Quantum Team") report the results of experiments that purport to demonstrate "quantum supremacy" -- the claim that the performance of some quantum computers is better than that of classical computers on some problems. Do these results close the debate over quantum supremacy? We argue that they do not. We provide an overview of the Google Quantum Team's experiments, then identify some open questions in the quest to demonstrate quantum supremacy.

扫码加入交流群

加入微信交流群

微信交流群二维码

扫码加入学术交流群,获取更多资源