Quantum communication complexity
From MaRDI portal
Publication:720535
DOI10.1023/A:1026009100467zbMath1222.81104arXivquant-ph/0101005OpenAlexW1793119275MaRDI QIDQ720535
Publication date: 17 October 2011
Published in: Foundations of Physics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/quant-ph/0101005
Quantum measurement theory, state operations, state preparations (81P15) Coding theorems (Shannon theory) (94A24) Quantum cryptography (quantum-theoretic aspects) (81P94)
Related Items
Quantum entanglement as a new information processing resource ⋮ Bell-type inequalities for nonlocal resources ⋮ Objective computation versus subjective computation ⋮ Quantum computing without entanglement ⋮ Strong simulation of linear optical processes ⋮ Quantum speed-up for unsupervised learning ⋮ Communication complexity as a principle of quantum mechanics ⋮ Generalizations of the distributed Deutsch–Jozsa promise problem ⋮ The Morita theory of quantum graph isomorphisms ⋮ Non-local setting and outcome information for violation of Bell's inequality ⋮ Entangled states cannot be classically simulated in generalized Bell experiments with quantum inputs ⋮ Exponential quantum enhancement for distributed addition with local nonlinearity ⋮ Quantum pseudo-telepathy ⋮ Two party non-local games ⋮ Limit on Nonlocality in Any World in Which Communication Complexity Is Not Trivial ⋮ Lower bounds on the entanglement needed to play XOR non-local games ⋮ A short review on quantum identity authentication protocols: how would Bob know that he is talking with Alice? ⋮ Lifting Bell inequalities
