Multi-party Quantum Communication Complexity with Routed Messages

Authors:
Seiichiro Tani;Masaki Nakanishi;Shigeru Yamashita
Affiliations:
NTT Communication Science Laboratories, NTT Corporation,;Graduate School of Information Science, Nara Institute of Science and Technology,;Graduate School of Information Science, Nara Institute of Science and Technology,
Venue:
COCOON '08 Proceedings of the 14th annual international conference on Computing and Combinatorics
Year:
2008

Citing 11
Cited 0

Lower bounds on communication complexity in distributed computer networks

Journal of the ACM (JACM)
Private vs. common random bits in communication complexity

Information Processing Letters
The probabilistic communication complexity of set intersection

SIAM Journal on Discrete Mathematics
A fast quantum mechanical algorithm for database search

STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Communication complexity

Communication complexity
Quantum vs. classical communication and computation

STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Exponential separation of quantum and classical communication complexity

STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Introduction to Algorithms

Introduction to Algorithms
Some complexity questions related to distributive computing(Preliminary Report)

STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
Exponential separations for one-way quantum communication complexity, with applications to cryptography

Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Quantum circuit complexity

SFCS '93 Proceedings of the 1993 IEEE 34th Annual Foundations of Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

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 distinctnessproblem of deciding whether there are at least two parties with identical inputs, on a k-party ring; almost matching upper bounds are also given.