Physics – Quantum Physics
Scientific paper
2006-03-20
Proc. 21st CCC (Complexity), p. 288-295 (2006)
Physics
Quantum Physics
13 pages, no figures, to appear in CCC'06
Scientific paper
We study the power of quantum fingerprints in the simultaneous message passing (SMP) setting of communication complexity. Yao recently showed how to simulate, with exponential overhead, classical shared-randomness SMP protocols by means of quantum SMP protocols without shared randomness ($Q^\parallel$-protocols). Our first result is to extend Yao's simulation to the strongest possible model: every many-round quantum protocol with unlimited shared entanglement can be simulated, with exponential overhead, by $Q^\parallel$-protocols. We apply our technique to obtain an efficient $Q^\parallel$-protocol for a function which cannot be efficiently solved through more restricted simulations. Second, we tightly characterize the power of the quantum fingerprinting technique by making a connection to arrangements of homogeneous halfspaces with maximal margin. These arrangements have been well studied in computational learning theory, and we use some strong results obtained in this area to exhibit weaknesses of quantum fingerprinting. In particular, this implies that for almost all functions, quantum fingerprinting protocols are exponentially worse than classical deterministic SMP protocols.
Gavinsky Dmitry
Kempe Julia
Wolf Ronald de
No associations
LandOfFree
Strengths and Weaknesses of Quantum Fingerprinting does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Strengths and Weaknesses of Quantum Fingerprinting, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Strengths and Weaknesses of Quantum Fingerprinting will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-451179