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.
*We acknowledge support for this project by the NSF (STAQ PHY-1818914, PHY-1915011) and PFC (PHY-1430094), ARO (MAQP W911NF1920181), and ONR (N00014-20-1-2695). We also thank the UNM Center for Advanced Research Computing, supported in part by the National Science Foundation, for providing the high-performance computing resources used in this work.
–
Publication: manuscript QL10009 (submitted to PRXQ)
arXiv:2110.04277v1 [quant-ph] (arXiv preprint)
Presenters
-
Yingyue Zhu
- University of Maryland, College Park