Two new non-equivalent three-qubit CHSH games
- URL: http://arxiv.org/abs/2312.00578v1
- Date: Fri, 1 Dec 2023 13:36:21 GMT
- Title: Two new non-equivalent three-qubit CHSH games
- Authors: Hamza Jaffali, Fr\'ed\'eric Holweck
- Abstract summary: We generalize to three players the well-known CHSH quantum game.
In particular we provide two new three players quantum games where, in one case, the best quantum strategy is obtained when the players share a $GHZ$ state.
In the other one the players have a better advantage when they use a $W$ state as their quantum resource.
- Score: 0.0
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: In this paper, we generalize to three players the well-known CHSH quantum
game. To do so, we consider all possible 3 variables Boolean functions and
search among them which ones correspond to a game scenario with a quantum
advantage (for a given entangled state). In particular we provide two new three
players quantum games where, in one case, the best quantum strategy is obtained
when the players share a $GHZ$ state, while in the other one the players have a
better advantage when they use a $W$ state as their quantum resource. To
illustrate our findings we implement our game scenarios on an online quantum
computer and prove experimentally the advantage of the corresponding quantum
resource for each game.
Related papers
- A bound on the quantum value of all compiled nonlocal games [49.32403970784162]
A cryptographic compiler converts any nonlocal game into an interactive protocol with a single computationally bounded prover.
We establish a quantum soundness result for all compiled two-player nonlocal games.
arXiv Detail & Related papers (2024-08-13T08:11:56Z) - Exploiting Finite Geometries for Better Quantum Advantages in Mermin-Like Games [0.0]
Quantum games embody non-intuitive consequences of quantum phenomena, such as entanglement and contextuality.
In this paper we look at the geometric structure behind such classical strategies, and borrow ideas from the geometry of symplectic polar spaces to maximise this quantum advantage.
arXiv Detail & Related papers (2024-03-14T15:56:43Z) - Photonic implementation of the quantum Morra game [69.65384453064829]
We study a faithful translation of a two-player quantum Morra game, which builds on previous work by including the classical game as a special case.
We propose a natural deformation of the game in the quantum regime in which Alice has a winning advantage, breaking the balance of the classical game.
We discuss potential applications of the quantum Morra game to the study of quantum information and communication.
arXiv Detail & Related papers (2023-11-14T19:41:50Z) - Decidability of fully quantum nonlocal games with noisy maximally
entangled states [5.076419064097734]
This paper considers the decidability of fully quantum nonlocal games with noisy maximally entangled states.
We prove that there is a computable upper bound on the copies of noisy maximally entangled states for the players to win a fully quantum nonlocal game with a probability arbitrarily close to the quantum value.
arXiv Detail & Related papers (2022-11-19T08:11:02Z) - Experimental Demonstration of Quantum Pseudotelepathy [8.366359388178546]
We report a faithful experimental demonstration of quantum pseudotelepathy via playing the non-local version of Mermin-Peres magic square game.
We adopt the hyperentanglement scheme and prepare photon pairs entangled in both the polarization and the orbital angular momentum degrees of freedom.
Our results show that quantum players can simultaneously win all the queries over any classical strategy.
arXiv Detail & Related papers (2022-06-24T02:35:55Z) - Efficient Bipartite Entanglement Detection Scheme with a Quantum
Adversarial Solver [89.80359585967642]
Proposal reformulates the bipartite entanglement detection as a two-player zero-sum game completed by parameterized quantum circuits.
We experimentally implement our protocol on a linear optical network and exhibit its effectiveness to accomplish the bipartite entanglement detection for 5-qubit quantum pure states and 2-qubit quantum mixed states.
arXiv Detail & Related papers (2022-03-15T09:46:45Z) - On exploring the potential of quantum auto-encoder for learning quantum systems [60.909817434753315]
We devise three effective QAE-based learning protocols to address three classically computational hard learning problems.
Our work sheds new light on developing advanced quantum learning algorithms to accomplish hard quantum physics and quantum information processing tasks.
arXiv Detail & Related papers (2021-06-29T14:01:40Z) - Playing quantum nonlocal games with six noisy qubits on the cloud [0.0]
Nonlocal games are extensions of Bell inequalities, aimed at demonstrating quantum advantage.
We consider the minimal implementation of the nonlocal game proposed in Science 362, 308.
We test this game by preparing a 6-qubit cluster state using quantum computers on the cloud by IBM, Ionq, and Honeywell.
arXiv Detail & Related papers (2021-05-11T18:00:08Z) - Quantum version of a generalized Monty Hall game and its possible
applications to quantum secure communications [0.0]
We propose a quantum version of a generalized Monty Hall game, in which the parameters of the game are left free, and not fixed on its regular values.
We extend our quantum scheme to include multiple independent players, and use this extension to sketch two possible application of the game mechanics to quantum networks.
arXiv Detail & Related papers (2020-10-26T17:57:12Z) - Operational Resource Theory of Imaginarity [48.7576911714538]
We show that quantum states are easier to create and manipulate if they only have real elements.
As an application, we show that imaginarity plays a crucial role for state discrimination.
arXiv Detail & Related papers (2020-07-29T14:03:38Z) - Quantum Gram-Schmidt Processes and Their Application to Efficient State
Read-out for Quantum Algorithms [87.04438831673063]
We present an efficient read-out protocol that yields the classical vector form of the generated state.
Our protocol suits the case that the output state lies in the row space of the input matrix.
One of our technical tools is an efficient quantum algorithm for performing the Gram-Schmidt orthonormal procedure.
arXiv Detail & Related papers (2020-04-14T11:05:26Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.