Implementing 2-qubit pseudo-telepathy games on noisy intermediate scale quantum computers
Colm Kelleher, Mohammad Roomy, Fr\'ed\'eric Holweck

TL;DR
This paper explores implementing 2-qubit pseudo-telepathy games on noisy intermediate-scale quantum computers, demonstrating the challenges noise presents in revealing quantum non-locality through experimental games.
Contribution
It reviews two methods for implementing pseudo-telepathy games and introduces a new Doily game based on 2-qubit Pauli group geometry, highlighting practical challenges.
Findings
Quantum games nearly reveal non-classicality on IBM Quantum Experience
Noise in current quantum hardware hinders full demonstration of quantum non-locality
Proposed a new Doily game based on 2-qubit Pauli group geometry
Abstract
It is known that Mermin-Peres like proofs of quantum contextuality can furnish non-local games with a guaranteed quantum strategy, when classically no such guarantee can exist. This phenomenon, also called quantum pseudo-telepathy, has been studied in the case of the so-called Mermin Magic square game. In this paper we review in detail two different ways of implementing on a quantum computer such a game and propose a new Doily game based on the geometry of 2-qubit Pauli group. We show that the quantumness of these games are almost revealed when we play them on the IBM Quantum Experience, however the inherent noise in the available quantum machines prevents a full demonstration of the non-classical aspects.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture · Quantum Mechanics and Applications · Computability, Logic, AI Algorithms
