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 at least two parties with identical inputs, on a k-party ring; almost matching upper bounds are also given. © 2008 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Tani, S., Nakanishi, M., & Yamashita, S. (2008). Multi-party quantum communication complexity with routed messages. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5092 LNCS, pp. 180–190). https://doi.org/10.1007/978-3-540-69733-6_19
Mendeley helps you to discover research relevant for your work.