Robust Bell inequalities from communication complexity
From MaRDI portal
Publication:5278346
DOI10.4230/LIPIcs.TQC.2016.5zbMath1370.81042arXiv1606.09514OpenAlexW2806961401MaRDI QIDQ5278346
Gabriel Senno, Jérémie Roland, Alexandre Nolin, Sophie Laplante, Mathieu Laurière
Publication date: 19 July 2017
Full work available at URL: https://arxiv.org/abs/1606.09514
Quantum computation (81P68) Quantum measurement theory, state operations, state preparations (81P15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Quantum information, communication, networks (quantum-theoretic aspects) (81P45)
Related Items
This page was built for publication: Robust Bell inequalities from communication complexity