pith. sign in

arxiv: 0907.3584 · v1 · pith:6LQH5TBEnew · submitted 2009-07-21 · 🪐 quant-ph

Non-locality and Communication Complexity

classification 🪐 quant-ph
keywords communicationquantumcomplexitycomputinginformationnon-localityphysicsused
0
0 comments X
read the original abstract

Quantum information processing is the emerging field that defines and realizes computing devices that make use of quantum mechanical principles, like the superposition principle, entanglement, and interference. In this review we study the information counterpart of computing. The abstract form of the distributed computing setting is called communication complexity. It studies the amount of information, in terms of bits or in our case qubits, that two spatially separated computing devices need to exchange in order to perform some computational task. Surprisingly, quantum mechanics can be used to obtain dramatic advantages for such tasks. We review the area of quantum communication complexity, and show how it connects the foundational physics questions regarding non-locality with those of communication complexity studied in theoretical computer science. The first examples exhibiting the advantage of the use of qubits in distributed information-processing tasks were based on non-locality tests. However, by now the field has produced strong and interesting quantum protocols and algorithms of its own that demonstrate that entanglement, although it cannot be used to replace communication, can be used to reduce the communication exponentially. In turn, these new advances yield a new outlook on the foundations of physics, and could even yield new proposals for experiments that test the foundations of physics.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. An Operational Framework for Nonclassicality in Quantum Communication Networks

    quant-ph 2024-03 unverdicted novelty 7.0

    A variational optimization framework computes linear classical bounds on network input/output probabilities whose violation certifies nonclassicality, finding entanglement necessary for nonclassicality in single-sende...

  2. Quantum Key Distribution with Imperfections: Recent Advances in Security Proofs

    quant-ph 2026-02 unverdicted novelty 2.0

    Overview of recent analytical and numerical advances in security proofs for QKD protocols that incorporate device imperfections to bridge theory and practice.