Quantum XOR games
From MaRDI portal
Publication:2828211
Abstract: We introduce quantum XOR games, a model of two-player one-round games that extends the model of XOR games by allowing the referee's questions to the players to be quantum states. We give examples showing that quantum XOR games exhibit a wide range of behaviors that are known not to exist for standard XOR games, such as cases in which the use of entanglement leads to an arbitrarily large advantage over the use of no entanglement. By invoking two deep extensions of Grothendieck's inequality, we present an efficient algorithm that gives a constant-factor approximation to the best performance players can obtain in a given game, both in case they have no shared entanglement and in case they share unlimited entanglement. As a byproduct of the algorithm we prove some additional interesting properties of quantum XOR games, such as the fact that sharing a maximally entangled state of arbitrary dimension gives only a small advantage over having no entanglement at all.
Recommendations
- Quantum games
- Quantum strategies for simple two-player XOR games
- Quantum Parrondo's games
- QUANTUM OCTAL GAMES
- scientific article; zbMATH DE number 2103535
- Quantum game simulation
- Algorithms, bounds, and strategies for entangled XOR games
- Nonlocal Quantum XOR Games for Large Number of Players
- Connes' embedding problem and winning strategies for quantum XOR games
- Classical versus quantum communication in XOR games
Cites work
- scientific article; zbMATH DE number 1579275 (Why is no real title available?)
- scientific article; zbMATH DE number 6096706 (Why is no real title available?)
- scientific article; zbMATH DE number 4195163 (Why is no real title available?)
- scientific article; zbMATH DE number 3571163 (Why is no real title available?)
- scientific article; zbMATH DE number 729680 (Why is no real title available?)
- scientific article; zbMATH DE number 1993745 (Why is no real title available?)
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- scientific article; zbMATH DE number 883395 (Why is no real title available?)
- scientific article; zbMATH DE number 6292749 (Why is no real title available?)
- A framework for bounding nonlocality of state discrimination
- A new upper bound for the complex Grothendieck constant
- Approximating the Cut-Norm via Grothendieck's Inequality
- Comparison of quantum statistical models: Equivalent conditions for sufficiency
- Constantes de Grothendieck et fonctions de type positif sur les sphères
- Efficient rounding for the noncommutative Grothendieck inequality
- Elementary proofs of Grothendieck theorems for completely bounded norms
- Explicit lower and upper bounds on the entangled value of multiplayer XOR games
- Generalizing the Singular Value Decomposition
- Grothendieck's theorem for noncommutative \(C^*\)-algebras, with an appendix on Grothendieck's constants
- Grothendieck's theorem for operator spaces
- Grothendieck’s Theorem, past and present
- Interactive proofs and the hardness of approximating cliques
- Large violation of Bell inequalities with low entanglement
- Lower bounds on the entanglement needed to play XOR non-local games
- Near-optimal and explicit Bell inequality violations
- Non-deterministic exponential time has two-prover interactive protocols
- On the Completely Bounded Map of a C* -Algebra to its Dual Space
- On the power of unique 2-prover 1-round games
- Perfect parallel repetition theorem for quantum XOR proof systems
- Probabilistic checking of proofs
- Proof verification and the hardness of approximation problems
- Proposed experiment to test local hidden-variable theories
- Quantum analogues of the Bell inequalities. The case of two spatially separated domains
- Some optimal inapproximability results
- The Effros-Ruan conjecture for bilinear forms on \(C^{*}\)-algebras
- The Grothendieck Constant is Strictly Smaller than Krivine's Bound
- The Grothendieck inequality for bilinear forms on \(C^*\)-algebras
- Towards a Generalized Singular Value Decomposition
- Unbounded violation of tripartite Bell inequalities
- Unbounded violations of bipartite Bell inequalities via operator space theory
- Unique games with entangled provers are easy
Cited in
(24)- The quantum-to-classical graph homomorphism game
- 3XOR games with perfect commuting operator strategies have perfect tensor product strategies and are decidable in polynomial time
- Hadamard's matrices, Grothendieck's constant, and root two
- The set of quantum correlations is not closed
- Quantum strategies are better than classical in almost any XOR game
- scientific article; zbMATH DE number 7250160 (Why is no real title available?)
- Universal gaps for XOR games from estimates on tensor norm ratios
- Synchronous values of games
- Quantum strategies for simple two-player XOR games
- Tsirelson's problem and an embedding theorem for groups arising from non-local games
- Synchronicity for quantum non-local games
- Dimensionality distinguishers
- Rank-one quantum games
- Extended non-local games and monogamy-of-entanglement games
- On the power of quantum entanglement in multipartite quantum XOR games
- Connes' embedding problem and winning strategies for quantum XOR games
- The Hilbertian tensor norm and entangled two-prover games
- Lower bounds on the entanglement needed to play XOR non-local games
- On the relation between completely bounded and \((1,{cb})\)-summing maps with applications to quantum XOR games
- A lower bound on the value of entangled binary games
- Failure of the trilinear operator space Grothendieck theorem
- Unbounded entanglement can be needed to achieve the optimal success probability
- Geometry and optimization in quantum information. Abstracts from the workshop held October 3--9, 2021 (hybrid meeting)
- Geometry of Banach spaces: a new route towards position based cryptography
This page was built for publication: Quantum XOR games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2828211)
