Quantum communication complexity
From MaRDI portal
Abstract: Can quantum communication be more efficient than its classical counterpart? Holevo's theorem rules out the possibility of communicating more than n bits of classical information by the transmission of n quantum bits --- unless the two parties are entangled, in which case twice as many classical bits can be communicated but no more. In apparent contradiction, there are distributed computational tasks for which quantum communication cannot be simulated efficiently by classical means. In extreme cases, the effect of transmitting quantum bits cannot be achieved classically short of transmitting an exponentially larger number of bits. In a similar vein, can entanglement be used to save on classical communication? It is well known that entanglement on its own is useless for the transmission of information. Yet, there are distributed tasks that cannot be accomplished at all in a classical world when communication is not allowed, but that become possible if the non-communicating parties share prior entanglement. This leads to the question of how expensive it is, in terms of classical communication, to provide an exact simulation of the spooky power of entanglement.
Recommendations
- Quantum entanglement and communication complexity
- Quantum communication and complexity.
- scientific article; zbMATH DE number 1406113
- Quantum entanglement and the communication complexity of the inner product function
- QUANTUM COMMUNICATION COMPLEXITY PROTOCOLS BASED ON HIGHER-DIMENSIONAL ENTANGLED SYSTEMS
Cited in
(38)- Two party non-local games
- Strong simulation of linear optical processes
- Communication complexity as a principle of quantum mechanics
- Advantage of Quantum Theory over Nonclassical Models of Communication
- Limit on nonlocality in any world in which communication complexity is not trivial
- scientific article; zbMATH DE number 1512076 (Why is no real title available?)
- scientific article; zbMATH DE number 1860690 (Why is no real title available?)
- Quantum communication and complexity.
- Quantum entanglement and communication complexity
- Quantum computing without entanglement
- scientific article; zbMATH DE number 6851887 (Why is no real title available?)
- Quantum Multiparty Communication Complexity and Circuit Lower Bounds
- Matrix discrepancy from Quantum communication
- Quantum communication protocols as a benchmark for programmable quantum computers
- Quantum speed-up for unsupervised learning
- Quantum weakly nondeterministic communication complexity
- Communication Over Quantum Channels With Parameter Estimation
- The Morita theory of quantum graph isomorphisms
- A universal framework for entanglement detection under group symmetry
- scientific article; zbMATH DE number 1406113 (Why is no real title available?)
- Quantum entanglement as a new information processing resource
- Exponential quantum enhancement for distributed addition with local nonlinearity
- Communication complexity and the reality of the wave function
- Lifting Bell inequalities
- Lower bounds on the entanglement needed to play XOR non-local games
- Objective computation versus subjective computation
- A short review on quantum identity authentication protocols: how would Bob know that he is talking with Alice?
- Quantum pseudo-telepathy
- Generalizations of the distributed Deutsch-Jozsa promise problem
- Multi-party Quantum Communication Complexity with Routed Messages
- Non-local setting and outcome information for violation of Bell's inequality
- Brief announcement: What can be computed without communication?
- Entangled states cannot be classically simulated in generalized Bell experiments with quantum inputs
- QUANTUM COMMUNICATION COMPLEXITY PROTOCOLS BASED ON HIGHER-DIMENSIONAL ENTANGLED SYSTEMS
- Quantum Communication Complexity with Coherent States and Linear Optics
- scientific article; zbMATH DE number 5568623 (Why is no real title available?)
- Bell-type inequalities for nonlocal resources
- On the role of shared entanglement
This page was built for publication: Quantum communication complexity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q720535)
