scientific article; zbMATH DE number 5953454

MaRDI QIDQ3171603zbMATH OpenFDO

Authors Alexander A. Sherstov

Publication date 5 October 2011

zbMATH Keywords

lower boundsblock sensitivityquantum communication complexitypattern matrix methodquantum-classical equivalence

Mathematics Subject Classification ID

Quantum algorithms and complexity in the theory of computing (68Q12) Classical propositional logic (03B05) Quantum information, communication, networks (quantum-theoretic aspects) (81P45)

Recommendations

• On Converse Bounds for Classical Communication Over Quantum Channels
• Quantum Versus Classical Simultaneity in Communication Complexity
• Exponential separation of quantum and classical communication complexity
• Entangled Simultaneity Versus Classical Interactivity in Communication Complexity
• Entangled simultaneity versus classical interactivity in communication complexity
• Communication complexity as a principle of quantum mechanics
• Unconventional Computation
• On the near-optimality of one-shot classical communication over quantum channels
• Trading classical communication, quantum communication, and entanglement in quantum Shannon theory
• Unbounded-Error Classical and Quantum Communication Complexity

Cited in

(6)

• Quantum zero-error algorithms cannot be composed
• Classical communication and non-classical fidelity of quantum teleportation
• Composition theorems in communication complexity
• On communication relations for quons
• On the tightness of the Buhrman-Cleve-Wigderson simulation
• The multiparty communication complexity of set disjointness

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3171603)