Improvements in communication complexity using quantum entanglement

dc.contributorKlappenecker, Andreas
dc.creatorKamat, Angad Mohandas
dc.date.accessioned2008-10-10T20:59:54Z
dc.date.accessioned2017-04-07T19:54:01Z
dc.date.available2008-10-10T20:59:54Z
dc.date.available2017-04-07T19:54:01Z
dc.date.created2008-08
dc.date.issued2008-10-10
dc.description.abstractQuantum 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.
dc.identifier.urihttp://hdl.handle.net/1969.1/86008
dc.language.isoen_US
dc.publisherTexas A&M University
dc.subjectmulti-party
dc.subjectcommunication complexity
dc.subjectquantum computing
dc.subjectentanglement
dc.titleImprovements in communication complexity using quantum entanglement
dc.typeBook
dc.typeThesis

Files