论文标题
量子至上示范的统计方面
Statistical Aspects of the Quantum Supremacy Demonstration
论文作者
论文摘要
Google团队在2019年提出的量子至高无上的著名主张包括证明量子电路产生的能力，尽管噪音相当大，但分布中的斑点被认为很难在古典计算机上进行模拟。验证生成的数据确实来自声称的分布，并评估电路的噪声水平，其保真度是纯粹的统计工作。本文的目的是解释量子计算与统计学家，计算机科学家和数学家可以访问的量子至上涉及的一些统计方面之间的关系。从Google的演示中的统计分析开始，我们可以解释说，我们研究了忠诚度的各种估计值，以及测试量子计算机生成的分布的不同方法。我们提出了不同的噪声模型，并讨论了它们的含义。在整个论文中讨论了Google数据的初步研究，主要集中在12个和14个Qubit的电路上。
The notable claim of quantum supremacy presented by Google's team in 2019 consists of demonstrating the ability of a quantum circuit to generate, albeit with considerable noise, bitstrings from a distribution that is considered hard to simulate on classical computers. Verifying that the generated data is indeed from the claimed distribution and assessing the circuit's noise level and its fidelity is a purely statistical undertaking. The objective of this paper is to explain the relations between quantum computing and some of the statistical aspects involved in demonstrating quantum supremacy in terms that are accessible to statisticians, computer scientists, and mathematicians. Starting with the statistical analysis in Google's demonstration, which we explain, we study various estimators of the fidelity, and different approaches to testing the distributions generated by the quantum computer. We propose different noise models, and discuss their implications. A preliminary study of the Google data, focusing mostly on circuits of 12 and 14 qubits is discussed throughout the paper.
