Multi-Party Quantum Communication Complexity with Routed Messages

This paper describes a general quantum lower bounding technique for the communication complexity of a function that depends on the inputs given to two parties connected via paths, which may be shared with other parties, on a network of any topology. The technique can also be employed to obtain a low...

Full description

Saved in:
Bibliographic Details
Published inIEICE Transactions on Information and Systems Vol. E92.D; no. 2; pp. 191 - 199
Main Authors TANI, Seiichiro, NAKANISHI, Masaki, YAMASHITA, Shigeru
Format Journal Article
LanguageEnglish
Published The Institute of Electronics, Information and Communication Engineers 2009
Subjects
Complexity
distributed computing
Matching
Messages
network topology
Networks
quantum communication complexity
Topology
Upper bounds
Online AccessGet full text

Cover

More Information
Summary:This paper describes a general quantum lower bounding technique for the communication complexity of a function that depends on the inputs given to two parties connected via paths, which may be shared with other parties, on a network of any topology. The technique can also be employed to obtain a lower-bound of the quantum communication complexity of some functions that depend on the inputs distributed over all parties on the network. As a typical application, we apply our technique to the distinctness problem of deciding whether there are a pair of parties with identical inputs, on a k-party ring; almost matching upper bounds are also given.
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:0916-8532
1745-1361
1745-1361
DOI:10.1587/transinf.E92.D.191