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

Abstract

According to Bell's theorem, certain entangled states cannot be simulated classically using local hidden variables (LHV). But if can we augment LHV by classical communication, how many bits are needed to simulate them? There is a strong evidence that a single bit of communication is powerful enough to simulate projective measurements on any two-qubit entangled state. In this study, we present Bell-like scenarios where bipartite correlations resulting from projective measurements on higher dimensional states cannot be simulated with a single bit of communication. These include a three-input, a four-input, a seven-input, and a 63-input bipartite Bell-like inequality with 80089, 64, 16, and 2 outputs, respectively. Two copies of emblematic Bell expressions, such as the Magic square pseudo-telepathy game, prove to be particularly powerful, requiring a $16\times 16$ state to beat the one-bit classical bound, and look a promising candidate for implementation on an optical platform.

arXiv comment11 pages, 4 tables

References in corpus (34)

• Bell nonlocality
• Device-independent security of quantum cryptography against collective attacks
• Random Numbers Certified by Bell's Theorem
• Bell inequalities for arbitrarily high dimensional systems
• The Communication Cost of Simulating Bell Correlations
• Quantum non-locality in two three-level systems
• The cost of exactly simulating quantum entanglement with classical communication
• Grothendieck's constant and local models for noisy entangled quantum states
• Quantum Pseudo-Telepathy
• Bell's theorem without inequalities and without probabilities for two observers
• Quantum nonlocality, Bell inequalities and the memory loophole
• Maximal violation of the CGLMP inequality for infinite dimensional states
• Bell inequalities tailored to maximally entangled states
• Device-independent parallel self-testing of two singlets
• Classical Teleportation of a Quantum Bit
• Towards Quantifying Non-Local Information Transfer: Finite-Bit Non-Locality
• Bell Inequalities with Auxiliary Communication
• On the power of non-local boxes
• Qutrit witness from the Grothendieck constant of order four
• Bell scenarios with communication
• Classical communication cost of quantum steering
• Bell nonlocality with a single shot
• Classical Cost of Transmitting a Qubit
• The Platonic solids and fundamental tests of quantum mechanics
• Bell Inequalities with Communication Assistance
• EPR Steering inequalities with Communication Assistance
• Bell inequalities with one bit of communication
• Lower bound on the communication cost of simulating bipartite quantum correlations
• A tight Tsirelson inequality for infinitely many outcomes
• Bounding the detection efficiency threshold in Bell tests using multiple copies of the maximally entangled two-qubit state carried by a single pair of particles
• Neural Network Approach to the Simulation of Entangled States with One Bit of Communication
• The minimal communication cost for simulating entangled qubits
• Beating one bit of communication with quantum correlations in smaller dimensions
• Beating one bit of communication with and without quantum pseudo-telepathy

Cited by in corpus (1)

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