Multi-party Quantum Communication Complexity with Routed Messages

DOI10.1007/978-3-540-69733-6_19zbMath1148.68383OpenAlexW1559461415MaRDI QIDQ3511326

Masaki Nakanishi, Shigeru Yamashita, Seiichiro Tani

Publication date: 10 July 2008

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

Full work available at URL: https://doi.org/10.1007/978-3-540-69733-6_19

Mathematics Subject Classification ID

Quantum computation (81P68) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (1)

Bounds on oblivious multiparty quantum communication complexity

This page was built for publication: Multi-party Quantum Communication Complexity with Routed Messages