Playing quantum nonlocal games with six noisy qubits on the cloud

Abstract

Nonlocal games are extensions of Bell inequalities, aimed at demonstrating quantum advantage. These games are well suited for noisy quantum computers because they only require the preparation of a shallow circuit, followed by the measurement of non-commuting observable. Here, we consider the minimal implementation of the nonlocal game proposed in Science 362, 308 (2018). We test this game by preparing a 6-qubit cluster state using quantum computers on the cloud by IBM, Ionq, and Honeywell. Our approach includes several levels of optimization, such as circuit identities and error mitigation and allows us to cross the classical threshold and demonstrate quantum advantage in one quantum computer. We conclude by introducing a different inequality that allows us to observe quantum advantage in less accurate quantum computers, at the expense of probing a larger number of circuits.

References in corpus (7)

• Bell Inequalities for Graph States
• Symmetry-resolved entanglement in symmetry-protected topological phases
• Symmetry protection of measurement-based quantum computation in ground states
• Converting contextuality into nonlocality
• Mermin inequalities for perfect correlations
• On the relation between Bell inequalities and nonlocal games
• Mermin's Inequalities of Multiple qubits with Orthogonal Measurements on IBM Q 53-qubit system

Cited by in corpus (7)

• Quantum computational advantage attested by nonlocal games with the cyclic cluster state
• Playing nonlocal games across a topological phase transition on a quantum computer
• A multi-player, multi-team nonlocal game for the toric code
• Quantum advantage in temporally flat measurement-based quantum computation
• Testing the necessity of complex numbers in traditional quantum theory with quantum computers
• A Game-Theoretic Quantum Algorithm for Solving Magic Squares
• Nonunitary gates using measurements only