License: 
Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.TQC.2014.67
URN: urn:nbn:de:0030-drops-48074
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2014/4807/
Chailloux, André ;
Mancinska, Laura ;
Scarpa, Giannicola ;
Severini, Simone
Graph-theoretical Bounds on the Entangled Value of Non-local Games
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.
BibTeX - Entry
@InProceedings{chailloux_et_al:LIPIcs:2014:4807,
author = {Andr{\'e} Chailloux and Laura Mancinska and Giannicola Scarpa and Simone Severini},
title = {{Graph-theoretical Bounds on the Entangled Value of Non-local Games}},
booktitle = {9th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2014)},
pages = {67--75},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-73-6},
ISSN = {1868-8969},
year = {2014},
volume = {27},
editor = {Steven T. Flammia and Aram W. Harrow},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2014/4807},
URN = {urn:nbn:de:0030-drops-48074},
doi = {10.4230/LIPIcs.TQC.2014.67},
annote = {Keywords: Graph theory, non-locality, entangled games}
}
|
Keywords: |
|
Graph theory, non-locality, entangled games |
|
Collection: |
|
9th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2014) |
|
Issue Date: |
|
2014 |
|
Date of publication: |
|
11.12.2014 |
