Communication cost of classically simulating a quantum channel with subsequent rank-1 projective measurement

Abstract

A process of preparation, transmission and subsequent projective measurement of a qubit can be simulated by a classical model with only two bits of communication and some amount of shared randomness. However no model for n qubits with a finite amount of classical communication is known at present. A lower bound for the communication cost can provide useful hints for a generalization. It is known for example that the amount of communication must be greater than c 2^n, where c~0.01. The proof uses a quite elaborate theorem of communication complexity. Using a mathematical conjecture known as the "double cap conjecture", we strengthen this result by presenting a geometrical and extremely simple derivation of the lower bound 2^n-1. Only rank-1 projective measurements are involved in the derivation.

corrected some minor typos

References in corpus (3)

• The Communication Cost of Simulating Bell Correlations
• Exponential complexity and ontological theories of quantum mechanics
• State space dimensionality in short memory hidden variable theories

Cited by in corpus (10)

• Is the quantum state real? An extended review of $\psi$-ontology theorems
• No Return to Classical Reality
• Epistemic view of quantum states and communication complexity of quantum channels
• Simple Communication Complexity Separation from Quantum State Antidistinguishability
• Communication complexity and the reality of the wave-function
• Communication Complexity of Channels in General Probabilistic Theories
• Necessary and sufficient optimality conditions for classical simulations of quantum communication processes
• Exponential communication gap between weak and strong classical simulations of quantum communication
• Reality, Causality, and Quantum Theory
• Generalized Gleason theorem and finite amount of information for the context