Center for Theoretical Physics, Massachusetts Institute of Technology, Cambridge, Massachusetts 02139, USA.
School of Mathematics, University of Bristol, Bristol BS8 1TW, UK.
Nature. 2017 Sep 13;549(7671):203-209. doi: 10.1038/nature23458.
The field of quantum algorithms aims to find ways to speed up the solution of computational problems by using a quantum computer. A key milestone in this field will be when a universal quantum computer performs a computational task that is beyond the capability of any classical computer, an event known as quantum supremacy. This would be easier to achieve experimentally than full-scale quantum computing, but involves new theoretical challenges. Here we present the leading proposals to achieve quantum supremacy, and discuss how we can reliably compare the power of a classical computer to the power of a quantum computer.
量子算法领域旨在通过使用量子计算机找到加速计算问题解决方案的方法。该领域的一个关键里程碑将是当通用量子计算机执行任何经典计算机都无法完成的计算任务时，这一事件被称为量子霸权。与全面的量子计算相比，这在实验上更容易实现，但涉及到新的理论挑战。在这里，我们提出了实现量子霸权的主要方案，并讨论了如何可靠地比较经典计算机和量子计算机的能力。
