Quantum computing resources have been known to provide speed-ups in computational complexity in many algorithms. The impact of these resources in communication, however, has not attracted much attention. We investigate the impact of
quantum entanglement on communication complexity. We provide a positive result,
by presenting a class of multi-party communication problems wherein the presence of
a suitable quantum entanglement lowers the classical communication complexity. We
show that, in evaluating certains function whose parameters are distributed among
various parties, the presence of prior entanglement can help in reducing the required
communication. We also present an outline of realizing the required entanglement
through optical photon quantum computing. We also suggest the possible impact of
our results on network information flow problems, by showing an instance of a lower
bound which can be broken by adding limited power to the communication model.
| Identifer | oai:union.ndltd.org:tamu.edu/oai:repository.tamu.edu:1969.1/86008 |
| Date | 10 October 2008 |
| Creators | Kamat, Angad Mohandas |
| Contributors | Klappenecker, Andreas |
| Publisher | Texas A&M University |
| Source Sets | Texas A and M University |
| Language | en_US |
| Detected Language | English |
| Type | Book, Thesis, Electronic Thesis, text |
| Format | electronic, born digital |
Page generated in 0.0019 seconds