Provable quantum advantage in Bell-type nonlocal games with the cyclic cluster state
ORAL
Abstract
We propose two Bell-type nonlocal games and perform proof-of-principle demonstrations on a trapped-ion quantum computer. These games can be used to prove quantum computational advantage in an objective and hardware-agnostic manner, as well as offer a practical and scalable set of quantitative benchmarks for quantum computers in the pre-fault-tolerant regime. The experimental result surpasses the conventional depth-0 classical bounds by a significant margin for the cubic Boolean function games, and is on the cusp of demonstrating advantage against the more difficult depth-1 classical bounds in the stabilizer submeasurement games.
–
Publication: manuscript QL10009 (submitted to PRXQ)<br>arXiv:2110.04277v1 [quant-ph] (arXiv preprint)
Presenters
-
Yingyue Zhu
University of Maryland, College Park
Authors
-
Yingyue Zhu
University of Maryland, College Park
-
Austin K Daniel
University of New Mexico
-
Cinthia H Alderete
Joint Quantum Institute, University of Maryland, Los Alamos National Lab
-
Vikas Buchemmavari
University of New Mexico
-
Alaina Green
Joint Quantum Institute, University of Maryland, University of Washington, University of Maryland, College Park
-
Nhung H Nguyen
University of Maryland, College Park
-
Tyler G Thurtell
University of New Mexico
-
Andrew Zhao
University of New Mexico
-
Norbert M Linke
University of Maryland, College Park
-
Akimasa Miyake
University of New Mexico