Quantum communication and complexity
Theoretical Computer Science - Natural computing
Improved Quantum Communication Complexity Bounds for Disjointness and Equality
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
Splitting information securely with entanglement
Information and Computation
Tensor norms and the classical communication complexity of nonlocal quantum measurement
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
On the power of non-local boxes
Theoretical Computer Science
Quantum protocols for untrusted computations
Journal of Discrete Algorithms
Recasting mermin's multi-player game into the framework of pseudo-telepathy
Quantum Information & Computation
Communication complexity as a principle of quantum mechanics
UC'05 Proceedings of the 4th international conference on Unconventional Computation
Experimental multipartner quantum communication complexity employing just one qubit
Natural Computing: an international journal
Quantum entanglement and the communication complexity of the inner product function
Theoretical Computer Science
Classical, quantum and nonsignalling resources in bipartite games
Theoretical Computer Science
Towards characterizing the non-locality of entangled quantum states
Theoretical Computer Science
| Hi-index | 0.00 |
We consider a variation of the communication complexity scenario, where the parties are supplied with an extra resource: particles in an entangled quantum state. We note that "quantum nonlocality" can be naturally expressed in the language of communication complexity. These are communication complexity problems where the "output" is embodied in the correlations between the outputs of the individual parties. Without entanglement, the parties must communicate to produce the required correlations; whereas, with entanglement, no communication is necessary to produce the correlations. In this sense, nonlocality proofs can also be viewed as communication complexity problems where the presence of quantum entanglement reduces the amount of necessary communication. We show how to transform examples of nonlocality into more traditional communication complexity problems, where the output is explicitly determined by each individual party. The resulting problems require communication with or without entanglement, but the required communication is less when entanglement is available. All these results are a noteworthy contrast to the well-known fact that entanglement cannot be used to actually simulate or compress classical communication between remote parties.