Related Experiment Video
Updated: Apr 19, 2026

The HoneyComb Paradigm for Research on Collective Human Behavior
Published on: January 19, 2019
Characterizing the performance of XOR games and the Shannon capacity of graphs
Ravishankar Ramanathan1, Alastair Kay2, Gláucia Murta3
1National Quantum Information Center of Gdańsk, 81-824 Sopot, Poland and University of Gdańsk, 80-952 Gdańsk, Poland.
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.
Related Concept Videos
Graphical Representation of Inequalities
Graphs of Functions
Norton's Theorem
The Maximum Power Transfer Theorem
The load connected draws the current, and the circuit delivers the power to the load. The alternating current flowing through the load is determined using the rectangular form of voltages, currents, network impedance, and load impedance. The average power delivered to the load is obtained from the product of the square of current and load resistance.
Signal Flow Graphs
In a signal-flow graph, branches denote the system's transfer functions, while nodes represent the signals. The direction of signal flow is indicated by arrows, with the corresponding...
Network Function of a Circuit
