Unbounded Entanglement Can Be Needed to Achieve the Optimal Success Probability
From MaRDI portal
Publication:5167796
DOI10.1007/978-3-662-43948-7_69zbMath1410.68134OpenAlexW1546906715WikidataQ59792672 ScholiaQ59792672MaRDI QIDQ5167796
Laura Mančinska, Thomas Vidick
Publication date: 1 July 2014
Published in: Automata, Languages, and Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-662-43948-7_69
Applications of game theory (91A80) Quantum coherence, entanglement, quantum correlations (81P40) Quantum algorithms and complexity in the theory of computing (68Q12)
Related Items (3)
THE SET OF QUANTUM CORRELATIONS IS NOT CLOSED ⋮ Survey on nonlocal games and operator space theory ⋮ Tsirelson’s problem and an embedding theorem for groups arising from non-local games
This page was built for publication: Unbounded Entanglement Can Be Needed to Achieve the Optimal Success Probability