scientific article; zbMATH DE number 1512076

MaRDI QIDQ4505702zbMATH OpenFDO

Authors Harry Buhrman

Publication date 4 September 2001

zbMATH Keywords

quantum communication complexityquantum computing

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Quantum computation (81P68)

Recommendations

• scientific article; zbMATH DE number 1860690
• Quantum communication complexity
• Quantum information, computation and communication
• scientific article; zbMATH DE number 1315402
• Quantum communication and complexity.
• scientific article; zbMATH DE number 1944610
• Quantum entanglement and communication complexity
• scientific article; zbMATH DE number 1145846
• Elements of quantum computation and quantum communication
• Quantum computation and quantum information

Cited in

(12)

• Quantum communication and complexity.
• The multiparty communication complexity of set disjointness
• Can quantum communication speed up distributed computation?
• scientific article; zbMATH DE number 5568623 (Why is no real title available?)
• Quantum weakly nondeterministic communication complexity
• scientific article; zbMATH DE number 1502104 (Why is no real title available?)
• QUANTUM COMPLEXITY THEORY GOALS AND CHALLENGES
• scientific article; zbMATH DE number 1860690 (Why is no real title available?)
• Mathematical Foundations of Computer Science 2003
• Preface
• Quantum communication protocols as a benchmark for programmable quantum computers
• Exponential separation of quantum and classical online space complexity

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 Q4505702)