Classical versus quantum communication in XOR games
From MaRDI portal
Publication:1654152
DOI10.1007/s11128-018-1883-0zbMath1395.81067arXiv1706.02653OpenAlexW2621938577WikidataQ62470978 ScholiaQ62470978MaRDI QIDQ1654152
Carlos Palazuelos, Ignacio Villanueva, Marius Junge
Publication date: 7 August 2018
Published in: Quantum Information Processing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1706.02653
Quantum computation (81P68) Communication theory (94A05) Quantum coherence, entanglement, quantum correlations (81P40) Decision theory for games (91A35) Quantum information, communication, networks (quantum-theoretic aspects) (81P45)
Related Items
Quantum one-way versus classical two-way communication in XOR games, Universal gaps for XOR games from estimates on tensor norm ratios, On the relation between completely bounded and \((1,{cb})\)-summing maps with applications to quantum XOR games
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Explicit lower and upper bounds on the entangled value of multiplayer XOR games
- Large violation of Bell inequalities with low entanglement
- Complexity measures of sign matrices
- Unbounded violation of tripartite Bell inequalities
- Survey on nonlocal games and operator space theory
- CB-Norm Estimates for Maps Between NoncommutativeLp-Spaces and Quantum Channel Theory
- Exponential separation of quantum and classical communication complexity
- Reducing the number of questions in nonlocal games
- Bell’s Inequalities and Quantum Communication Complexity
- Quantum communication complexity advantage implies violation of a Bell inequality
- Near-Optimal and Explicit Bell Inequality Violations
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Some estimates of norms of random matrices
- Communication Complexity
- Robust Bell inequalities from communication complexity
- Quantum one-way communication can be exponentially stronger than classical communication
- Lower bounds in communication complexity based on factorization norms
