Einstein meets Turing: the computability of nonlocal games

DOI10.1007/978-3-030-80049-9_47OpenAlexW3186913891MaRDI QIDQ2117813FDOQ2117813

Henry C. Yuen

Publication date: 22 March 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-80049-9_47

zbMATH Keywords

quantum entanglementnonlocal gamesuncomputability

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Classification of injective factors. Cases \(\mathrm{II}_1\), \(\mathrm{II}_\infty\), \(\mathrm{III}_\lambda\), \(\lambda\neq 1\)
• Proposed Experiment to Test Local Hidden-Variable Theories
• About the Connes embedding conjecture
• Tsirelson’s problem and an embedding theorem for groups arising from non-local games
• THE SET OF QUANTUM CORRELATIONS IS NOT CLOSED
• From Operator Algebras to Complexity Theory and Back

Cited In (1)

• Nonlocal Games with Noisy Maximally Entangled States are Decidable

This page was built for publication: Einstein meets Turing: the computability of nonlocal games

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2117813)