LIPIcs.TQC.2014.67.pdf
- Filesize: 368 kB
- 9 pages
Document
Graph-theoretical Bounds on the Entangled Value of Non-local Games
Authors
-
Part of:
Volume:
9th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2014)
Series: Leibniz International Proceedings in Informatics (LIPIcs)
Conference: Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC) - License:
Creative Commons Attribution 3.0 Unported license
- Publication Date: 2014-12-11
Cite AsGet BibTex
André Chailloux, Laura Mancinska, Giannicola Scarpa, and Simone Severini. Graph-theoretical Bounds on the Entangled Value of Non-local Games. In 9th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2014). Leibniz International Proceedings in Informatics (LIPIcs), Volume 27, pp. 67-75, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2014)
https://doi.org/10.4230/LIPIcs.TQC.2014.67
https://doi.org/10.4230/LIPIcs.TQC.2014.67
Abstract
We introduce a novel technique to give bounds to the entangled value of non-local games. The technique is based on a class of graphs used by Cabello, Severini and Winter in 2010. The upper bound uses the famous Lovàsz theta number and is efficiently computable; the lower one is based on the quantum independence number, which is a quantity used in the study of entanglement-assisted channel capacities and graph homomorphism games.
Keywords
- Graph theory
- non-locality
- entangled games
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads