Southwest Quantum Information and Technology

Provable quantum computational advantage with the cyclic cluster state

Presenting Author: Austin Daniel, University of New Mexico CQuIC
Contributing Author(s): Yingyue Zhu, Cinthia Huerta Alderete, Vikas Buchemmavari, Alaina M.Green, Nhung H. Nguyen, Tyler Thurtell, Andrew Zhao, Norbert M. Linke, Akimasa Miyake

We propose two Bell-type nonlocal games that can be used to prove quantum computational ad-vantage in an objective and hardware-agnostic manner. In these games, the capability of a quantumcomputer to prepare a cyclic cluster state and measure a subset of its Pauli stabilizers is comparedin terms of circuit depth to classical Boolean circuits with the same gate connectivity. Using acircuit-based trapped-ion quantum computer, we prepare and measure a six-qubit cyclic clusterstate with an overall fidelity of 60.6% and 66.4%, before and after correcting measurement-readouterrors respectively. Our experimental results indicate that while this fidelity readily passes conven-tional (or depth-0) Bell bounds for local hidden-variable models, it is on the cusp of demonstratingquantum advantage against depth-1 classical circuits. Our games offer a practical and scalable setof quantitative benchmarks for quantum computers in the pre-fault-tolerant regime as the numberof qubits available increases.

(Session 5 : Thursday from 12:00pm-2:00 pm)