1 November 2005 in Foundations of Physics
30 August 1999 in Physical Review Letters
We investigate the amount of communication that must augment classical local hidden variable models in order to simulate the behavior of entangled quantum systems. We consider the scenario where a bipartite measurement is given from a set of possibilities and the goal is to obtain exactly the same correlations that arise when the actual quantum system is measured. We show that, in the case of a single pair of qubits in a Bell state, a constant number of bits of communication is always sufficient—regardless of the number of measurements under consideration. We also show that, in the case of a system of Bell states, a constant times bits of communication is necessary.
1 October 1999 in Physical Review A
Quantum entanglement cannot be used to achieve direct communication between remote parties, but it can reduce the communication needed for some problems. Let each of parties hold some partial input data to some fixed -variable function The communication complexity of is the minimum number of classical bits required to be broadcasted for every party to know the value of on their inputs. We construct a function such that for the one-round communication model and three parties, can be computed with bits of communication when the parties share prior entanglement. We then show that without entangled particles, the one-round communication complexity of is Next we generalize this function to a function We show that if the parties share prior quantum entanglement, then the communication complexity of is exactly We also show that, if no entangled particles are provided, then the communication complexity of is roughly These two results prove communication complexity separations better than a constant number of bits.
1 April 2000 in Journal of Computer and System Sciences
1 June 1998 in Fortschritte der Physik