Quantum computational advantage attested by nonlocal games with the cyclic cluster state
Quantum computational advantage attested by nonlocal games with the cyclic cluster state
复制标题
DOI：
10.1103/physrevresearch.4.033068
复制
发表时间：
2021-10
影响因子：
4.2
通讯作者：
Austin K. Daniel;Yingyue Zhu;C. H. Alderete;Vikas Buchemmavari;Alaina M. Green;N. Nguyen;Tyler G. Thurtell;Andrew Zhao;N. Linke;A. Miyake
中科院分区：
文献类型：
--
作者：
Austin K. Daniel;Yingyue Zhu;C. H. Alderete;Vikas Buchemmavari;Alaina M. Green;N. Nguyen;Tyler G. Thurtell;Andrew Zhao;N. Linke;A. Miyake
我们提出了一组贝尔型非局域游戏，可以用来证明一个无条件的量子优势，在一个客观的和硬件不可知的方式。在这些游戏中，在量子计算机上准备一个循环团簇状态和测量其泡利稳定器的子集所需的电路深度与具有相同的最近邻门连通性的经典布尔电路进行了比较。使用基于电路的捕获离子量子计算机，我们制备并测量了一个六量子位循环团簇态，在校正测量读出误差之前和之后，总保真度分别为60.6%和66.4%。我们的实验结果表明，虽然这种保真度很容易通过传统的（或深度0）贝尔边界的局部隐藏变量模型，它是在尖端展示了更高的成功概率比深度1经典电路的可能性。随着可用量子比特数量的增加，我们的游戏为预容错机制中的量子计算机提供了一套实用且可扩展的定量基准。
We propose a set of Bell-type nonlocal games that can be used to prove an unconditional quantum advantage in an objective and hardware-agnostic manner. In these games, the circuit depth needed to prepare a cyclic cluster state and measure a subset of its Pauli stabilizers on a quantum computer is compared to that of classical Boolean circuits with the same, nearest-neighboring gate connectivity. Using a circuit-based trapped-ion quantum computer, we prepare and measure a six-qubit cyclic cluster state with an overall fidelity of 60.6% and 66.4%, before and after correcting for measurement-readout errors, respectively. Our experimental results indicate that while this fidelity readily passes conventional (or depth-0) Bell bounds for local hidden-variable models, it is on the cusp of demonstrating a higher probability of success than what is possible by depth-1 classical circuits. Our games offer a practical and scalable set of quantitative benchmarks for quantum computers in the pre-fault-tolerant regime as the number of qubits available increases.