Rank-one quantum games

DOI10.1007/s00037-014-0096-xzbMath1328.81063arXiv1112.3563OpenAlexW1984695477WikidataQ59474322 ScholiaQ59474322MaRDI QIDQ2353189

Marius Junge, David Pérez-García, Carlos Palazuelos, Tom Cooney

Publication date: 8 July 2015

Published in: Computational Complexity (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1112.3563

zbMATH Keywords

combinatorial optimizationquantum gamesoperator spacesparallel repetitionefficient approximationmodels for rank one gamequantum informations

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) 2-person games (91A05) Operator spaces (= matricially normed spaces) (47L25) Quantum coherence, entanglement, quantum correlations (81P40) Quantum information, communication, networks (quantum-theoretic aspects) (81P45)

Related Items (7)

Failure of the trilinear operator space Grothendieck theorem ⋮ Explicit lower and upper bounds on the entangled value of multiplayer XOR games ⋮ The connected wedge theorem and its consequences ⋮ Survey on nonlocal games and operator space theory ⋮ Unnamed Item ⋮ On the relation between completely bounded and \((1,{cb})\)-summing maps with applications to quantum XOR games ⋮ Synchronicity for quantum non-local games

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unbounded violations of bipartite Bell inequalities via operator space theory
• Large violation of Bell inequalities with low entanglement
• Multiplicativity of completely bounded \(p\)-norms implies a new additivity result
• Perfect parallel repetition theorem for quantum XOR proof systems
• The Effros-Ruan conjecture for bilinear forms on \(C^{*}\)-algebras
• Completely bounded and ideal norms of multiplication operators and Schur multipliers
• Pointwise domination of matrices and comparison of \(F_ p\) norms
• Geometric algorithms and combinatorial optimization.
• The Grothendieck-Pietsch and Dvoretzky-Rogers theorems for operator spaces
• Grothendieck's theorem for operator spaces
• Quantum multi-prover interactive proof systems with limited prior entanglement.
• Facial structure of the trace class
• PSPACE has constant-round quantum interactive proof systems
• Minimal and maximal operator spaces and operator systems in entanglement theory
• On the best constants in noncommutative Khintchine-type inequalities
• On the power of quantum, one round, two prover interactive proof systems
• Embedding of the operator space OH and the logarithmic `little Grothendieck inequality'
• Unbounded violation of tripartite Bell inequalities
• Representation of certain homogeneous Hilbertian operator spaces and applications
• Three-Player Entangled XOR Games are NP-Hard to Approximate
• Quantum XOR Games
• Entangled Games Are Hard to Approximate
• Proof verification and the hardness of approximation problems
• Quantum Multiprover Interactive Proofs with Communicating Provers
• Parallelization, amplification, and exponential time simulation of quantum interactive proof systems
• Completely Bounded Maps between C^∗ -Algebras
• Probabilistic checking of proofs
• Quantum computations: algorithms and error correction
• A Parallel Repetition Theorem
• Elementary proofs of Grothendieck theorems for completely bounded norms
• Position-Based Quantum Cryptography: Impossibility and Constructions
• Connes' embedding problem and Tsirelson's problem
• Grothendieck’s Theorem, past and present
• Unique Games with Entangled Provers Are Easy
• Parallel repetition of entangled games

This page was built for publication: Rank-one quantum games