Beating one bit of communication with quantum correlations in smaller dimensions

Abstract

As a consequence of Bell's theorem, the statistics of measurements on some entangled states cannot be simulated with local hidden variables alone. The amount of communication that must be supplied is an intuitive quantifier of nonclassicality. While it is obvious that this amount can be very large in general, it has been surprisingly difficult to find simple examples of quantum correlations, whose simulation requires more than one bit of communication. In this paper, we report the simplest example to date, which lives in the $(5,2,5,5)$ Bell scenario [the previously known smallest case living in the $(7,3,16,16)$ scenario]. The proof is built on the observation that finding the largest 1-bit score is equivalent to finding the bipartition of the inputs, in which the sum of the local scores of the two subgames is maximal.

6 pages, 1 figure, 1 table. Final published version

References in corpus (12)

• A convergent hierarchy of semidefinite programs characterizing the set of quantum correlations
• The Communication Cost of Simulating Bell Correlations
• Multi-path entanglement of two photons
• Native qudit entanglement in a trapped ion quantum processor
• Experimental access to higher-dimensional entangled quantum systems using integrated optics
• Multi-setting Bell inequality for qudits
• Simulation of partial entanglement with nonsignaling resources
• Simulation of bipartite qudit correlations
• Bell Inequalities with Communication Assistance
• Bell inequalities with one bit of communication
• Neural Network Approach to the Simulation of Entangled States with One Bit of Communication
• The minimal communication cost for simulating entangled qubits

Cited by in corpus (1)

• Beating one bit of communication with and without quantum pseudo-telepathy