Quantum Multiparty Communication Complexity and Circuit Lower Bounds

DOI10.1007/978-3-540-72504-6_28zbMath1198.68151arXivquant-ph/0504087OpenAlexW1518254600MaRDI QIDQ5425444

Iordanis Kerenidis

Publication date: 13 November 2007

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/quant-ph/0504087

Mathematics Subject Classification ID

Quantum computation (81P68) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items (1)

A broader view on the limitations of information processing and communication by nature

This page was built for publication: Quantum Multiparty Communication Complexity and Circuit Lower Bounds