Rounding near-optimal quantum strategies for nonlocal games to strategies using maximally entangled states

• URL: http://arxiv.org/abs/2203.02525v3
• Date: Wed, 20 Mar 2024 21:38:25 GMT
• Title: Rounding near-optimal quantum strategies for nonlocal games to strategies using maximally entangled states
• Authors: Connor Paddock,
• Abstract summary: In particular, we show that near-perfect quantum strategies are approximate representations of the corresponding BCS algebra in the little Frobenius norm. For the class of XOR nonlocal games, we show that near-optimal quantum strategies are approximate representations of the corresponding *-algebra associated with the game.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We establish approximate rigidity results for boolean constraint system (BCS) nonlocal games. In particular, we show that near-perfect quantum strategies are approximate representations of the corresponding BCS algebra in the little Frobenius norm. Likewise, for the class of XOR nonlocal games, we show that near-optimal quantum strategies are approximate representations of the corresponding *-algebra associated with the game. In both cases, the norm of the approximate representations is independent of the quantum state employed in the strategy. We also show that approximate representations of the BCS (resp. XOR-algebra) are close to near-perfect (resp. near-optimal) quantum strategies employing a maximally entangled state for the corresponding game. As a corollary, any near-perfect BCS (resp. near-optimal XOR) quantum strategy is close to a near-perfect (resp. near-optimal) quantum strategy using a maximally entangled state. Lastly, we show that every synchronous algebra is *-isomorphic to a certain BCS algebra, allowing us to apply our results to the class of synchronous nonlocal games as well.

Related papers

• Lossy-and-Constrained Extended Non-Local Games with Applications to Cryptography: BC, QKD and QPV [0.0]
  We show that if one extends such games by considering constraints and loss, the convergence of the SDPs to the optimal value still holds. We give applications of this result, and we compute SDPs that show tighter security of protocols for relativistic bit commitment, quantum key distribution, and quantum position verification.
  arXiv  Detail & Related papers  (2024-05-22T15:09:30Z)
• Transitive Nonlocal Games [0.0]
  We study a class of nonlocal games, called transitive games, for which the set of perfect strategies forms a semigroup. We prove that the existence of a C*-strategy, the existence of a quantum commuting strategy, and the existence of a classical strategy are all equivalent.
  arXiv  Detail & Related papers  (2023-12-19T10:49:41Z)
• A Quadratic Speedup in Finding Nash Equilibria of Quantum Zero-Sum Games [102.46640028830441]
  We introduce the Optimistic Matrix Multiplicative Weights Update (OMMWU) algorithm and establish its average-iterate convergence complexity as $mathcalO(d/epsilon)$ to $epsilon$-Nash equilibria. This quadratic speed-up sets a new benchmark for computing $epsilon$-Nash equilibria in quantum zero-sum games.
  arXiv  Detail & Related papers  (2023-11-17T20:38:38Z)
• 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 Gate Optimization for Rydberg Architectures in the Weak-Coupling Limit [55.05109484230879]
  We demonstrate machine learning assisted design of a two-qubit gate in a Rydberg tweezer system. We generate optimal pulse sequences that implement a CNOT gate with high fidelity. We show that local control of single qubit operations is sufficient for performing quantum computation on a large array of atoms.
  arXiv  Detail & Related papers  (2023-06-14T18:24:51Z)
• 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)
• The quantum commuting model (Ia): The CHSH game and other examples: Uniqueness of optimal states [91.3755431537592]
  We use the universal description of quantum commuting correlations as state space on the universal algebra for two player games. We find that the CHSH game leaves a single optimal state on this common algebra.
  arXiv  Detail & Related papers  (2022-10-07T17:38:31Z)
• A Quantum Optimal Control Problem with State Constrained Preserving Coherence [68.8204255655161]
  We consider a three-level $Lambda$-type atom subjected to Markovian decoherence characterized by non-unital decoherence channels. We formulate the quantum optimal control problem with state constraints where the decoherence level remains within a pre-defined bound.
  arXiv  Detail & Related papers  (2022-03-24T21:31:34Z)
• On the relation between completely bounded and $(1,cb)$-summing maps with applications to quantum XOR games [65.51757376525798]
  We show that given a linear map from a general operator space into the dual of a C$*$-algebra, its completely bounded norm is upper bounded by a universal constant times its $(''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''
  arXiv  Detail & Related papers  (2021-12-09T21:06:52Z)
• Synchronicity for quantum non-local games [0.7646713951724009]
  We show that quantum homomorphisms of quantum graphs can be viewed as entanglement assisted classical homomorphisms of the graphs. We give descriptions of the perfect quantum commuting and the perfect approximately quantum strategies for the quantum graph homomorphism game.
  arXiv  Detail & Related papers  (2021-06-22T02:40:41Z)

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.