Characterizing the Performance of <span class="sc">xor</span> Games and the Shannon Capacity of Graphs
Abstract
In this Letter we give a set of necessary and sufficient conditions such that quantum players of a two-party xor game cannot perform any better than classical players. With any such game, we associate a graph and examine its zero-error communication capacity. This allows us to specify a broad new class of graphs for which the Shannon capacity can be calculated. The conditions also enable the parametrization of new families of games that have no quantum advantage for arbitrary input probability distributions, up to certain symmetries. In the future, these might be used in information-theoretic studies on reproducing the set of quantum nonlocal correlations.
Citations
-
9
CrossRef
-
0
Web of Science
-
1 0
Scopus
Authors (4)
Cite as
Full text
full text is not available in portal
Keywords
Details
- Category:
- Articles
- Type:
- artykuł w czasopiśmie wyróżnionym w JCR
- Published in:
-
PHYSICAL REVIEW LETTERS
no. 113,
pages 1 - 5,
ISSN: 0031-9007 - Language:
- English
- Publication year:
- 2014
- Bibliographic description:
- Ramanathan R., Kay A., Murta G., Horodecki P.: Characterizing the Performance of <span class="sc">xor</span> Games and the Shannon Capacity of Graphs// PHYSICAL REVIEW LETTERS. -Vol. 113, nr. 240401 (2014), s.1-5
- DOI:
- Digital Object Identifier (open in new tab) 10.1103/physrevlett.113.240401
- Verified by:
- Gdańsk University of Technology
seen 121 times
Recommended for you
Bound on Bell inequalities by fraction of determinism and reverse triangle inequality
- P. Joshi,
- K. Horodecki,
- M. Horodecki
- + 5 authors
Elemental and tight monogamy relations in nonsignaling theories
- R. Augusiak,
- M. Demianowicz,
- M. Pawłowski
- + 2 authors