Quantum multiparty communication complexity and circuit lower bounds

DOI10.1017/S0960129508007263zbMath1178.68266MaRDI QIDQ3616221

Iordanis Kerenidis

Publication date: 24 March 2009

Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)

zbMATH Keywords

simulation theorem

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Quantum computation (81P68)

Cites Work

• On the power of small-depth threshold circuits
• Multiparty protocols, pseudorandom generators for Logspace, and time- space trade-offs
• The BNS lower bound for multi-party protocols is nearly optimal
• On ACC
• Lower Bounds on Matrix Rigidity Via a Quantum Argument
• Quasi‐random classes of hypergraphs
• Quantum computing, postselection, and probabilistic polynomial-time
• The BNS-Chung criterion for multi-party communication complexity

This page was built for publication: Quantum multiparty communication complexity and circuit lower bounds