Multi-party Quantum Communication Complexity with Routed Messages

DOI10.1007/978-3-540-69733-6_19MaRDI QIDQ3511326zbMATH OpenOpenAlexFDO

Authors Seiichiro Tani, Masaki Nakanishi, S. Yamasita

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

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

Recommendations

• Quantum Multiparty Communication Complexity and Circuit Lower Bounds
• Quantum multiparty communication complexity and circuit lower bounds
• Communication complexity of private simultaneous quantum messages protocols
• Bounds on oblivious multiparty quantum communication complexity
• Multipartite quantum correlation and communication complexities
• Multiparty quantum communication complexity of triangle finding
• Quantum communication complexity
• On the Multiplicativity Hypothesis for Quantum Communication Channels
• QUANTUM COMMUNICATION COMPLEXITY PROTOCOLS BASED ON HIGHER-DIMENSIONAL ENTANGLED SYSTEMS
• Experimental multipartner quantum communication complexity employing just one qubit

Cited in

(5)

• Experimental multipartner quantum communication complexity employing just one qubit
• Quantum multiparty communication complexity and circuit lower bounds
• A Quantum Multiparty Packing Lemma and the Relay Channel
• Quantum Multiparty Communication Complexity and Circuit Lower Bounds
• Bounds on oblivious multiparty quantum communication complexity

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

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