Entangling capabilities and unitary quantum games

• URL: http://arxiv.org/abs/2308.09673v2
• Date: Thu, 21 Sep 2023 04:06:19 GMT
• Title: Entangling capabilities and unitary quantum games
• Authors: Rebecca Erbanni, Antonios Varvitsiotis, Dario Poletti
• Abstract summary: We consider a class of games between two competing players that take turns acting on the same many-body quantum register. This class of zero-sum games has a clear second mover advantage if both players can entangle the same portion of the register. We show, however, that if the first player can entangle a larger number of qubits than the second player (which we refer to as having quantum advantage), then the second mover advantage can be significantly reduced.
• Score: 1.8416014644193066
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We consider a class of games between two competing players that take turns acting on the same many-body quantum register. Each player can perform unitary operations on the register, and after each one of them acts on the register the energy is measured. Player A aims to maximize the energy while player B to minimize it. This class of zero-sum games has a clear second mover advantage if both players can entangle the same portion of the register. We show, however, that if the first player can entangle a larger number of qubits than the second player (which we refer to as having quantum advantage), then the second mover advantage can be significantly reduced. We study the game for different types of quantum advantage of player A versus player B and for different sizes of the register, in particular, scenarios in which absolutely maximally entangled states cannot be achieved. In this case, we also study the effectiveness of using random unitaries. Last, we consider mixed initial preparations of the register, in which case the player with a quantum advantage can rely on strategies stemming from the theory of ergotropy of quantum batteries.

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)
• Quantum Bayesian Games [0.09208007322096534]
  We apply a Bayesian agent-based framework inspired by QBism to iterations of two quantum games, the CHSH game and the quantum prisoners' dilemma. In each two-player game, players hold beliefs about an amount of shared entanglement and about the actions or beliefs of the other player. We simulate iterated play to see if and how players can learn about the presence of shared entanglement and to explore how their performance, their beliefs, and the game's structure interrelate.
  arXiv  Detail & Related papers  (2024-08-04T15:15:42Z)
• Two new non-equivalent three-qubit CHSH games [0.0]
  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.
  arXiv  Detail & Related papers  (2023-12-01T13:36:21Z)
• 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)
• Quantum advantage in a unified scenario and secure detection of resources [55.2480439325792]
  We consider a single task to study different approaches of having quantum advantage. We show that the optimal success probability in the overall process for a qubit communication might be higher than that for a cbit communication.
  arXiv  Detail & Related papers  (2023-09-22T23:06:20Z)
• Quantum Tapsilou -- a quantum game inspired from the traditional Greek coin tossing game tapsilou [0.0]
  This paper introduces a new quantum game called Quantum Tapsilou. It is inspired by the classical traditional Greek coin tossing game tapsilou. The two most important novelties of Quantum Tapsilou can be attributed to its implementation of entanglement.
  arXiv  Detail & Related papers  (2023-09-03T16:45:16Z)
• Entanglement and coherence in Bernstein-Vazirani algorithm [58.720142291102135]
  Bernstein-Vazirani algorithm allows one to determine a bit string encoded into an oracle. We analyze in detail the quantum resources in the Bernstein-Vazirani algorithm. We show that in the absence of entanglement, the performance of the algorithm is directly related to the amount of quantum coherence in the initial state.
  arXiv  Detail & Related papers  (2022-05-26T20:32:36Z)
• 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)
• An Instance-Dependent Analysis for the Cooperative Multi-Player Multi-Armed Bandit [93.97385339354318]
  We study the problem of information sharing and cooperation in Multi-Player Multi-Armed bandits. First, we show that a simple modification to a successive elimination strategy can be used to allow the players to estimate their suboptimality gaps. Second, we leverage the first result to design a communication protocol that successfully uses the small reward of collisions to coordinate among players.
  arXiv  Detail & Related papers  (2021-11-08T23:38:47Z)
• Conditions that enable a player to surely win in sequential quantum games [0.0]
  This paper studies sequential quantum games under the assumption that the moves of the players are drawn from groups and not just plain sets. The main conclusion of this paper is that the specific rules of a game are absolutely critical.
  arXiv  Detail & Related papers  (2021-06-13T15:16:31Z)
• 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)

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.