Simulating Quantum Correlations with Finite Communication

DOI10.1137/080723909zbMath1205.68181arXiv0708.0827OpenAlexW1989658026MaRDI QIDQ3586191

Ben Toner, Oded Regev

Publication date: 6 September 2010

Published in: SIAM Journal on Computing (Search for Journal in Brave)

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

zbMATH Keywords

quantum entanglementcommunication complexity

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Quantum computation (81P68)

Related Items (8)

Grothendieck-Type Inequalities in Combinatorial Optimization ⋮ The Communication Complexity of Non-signaling Distributions ⋮ Classical, quantum and nonsignalling resources in bipartite games ⋮ A generalized Grothendieck inequality and nonlocal correlations that require high entanglement ⋮ Bell scenarios with communication ⋮ Grothendieck’s Theorem, past and present ⋮ Entangled states cannot be classically simulated in generalized Bell experiments with quantum inputs ⋮ Grothendieck constant is norm of Strassen matrix multiplication tensor

This page was built for publication: Simulating Quantum Correlations with Finite Communication