text: Quantum information processing is at the crossroads of physics, mathematics and computer science. It is concerned with what we can and cannot do with quantum information that goes beyond the abilities of classical information processing devices. Communication complexity is an area of classical computer science that aims at quantifying the amount of communication necessary to solve distributed computational problems. Quantum communication complexity uses quantum mechanics to reduce the amount of communication that would be classically required.
  @cite_14: A proof of Bell’s theorem without inequalities and involving only two observers is given by suitably extending a proof of the Bell-Kochen-Specker theorem due to Mermin. This proof is generalized to obtain an inequality-free proof of Bell’s theorem for a set of n Bell states (with n odd) shared between two distant observers. A generalized CHSH inequality is formulated for n Bell states shared symmetrically between two observers and it is shown that quantum mechanics violates this inequality by an amount that grows exponentially with increasing n.
summary: Also, Aravind has generalized his own magic square idea @cite_14 to a two-player pseudo-telepathy game in which the players share @math Bell states, @math being an arbitrary odd number larger than 1.