Distributed construction of quantum fingerprints

Authors:
Andris Ambainis;Yaoyun Shi
Affiliations:
School of Mathematics, Institute for Advanced Study, Princeton, NJ;Department of Electrical Engineering and Computer Science, University of Michigan, Ann Arbor, Michigan
Venue:
Quantum Information & Computation
Year:
2004

Citing 8
Cited 1

A fast quantum mechanical algorithm for database search

STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Public vs. private coin flips in one round communication games (extended abstract)

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
Quantum lower bounds by polynomials

Journal of the ACM (JACM)
Randomized Simultaneous Messages: Solution Of A Problem Of Yao In Communication Complexity

CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
Some complexity questions related to distributive computing(Preliminary Report)

STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
Quantum circuit complexity

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

Optimal fingerprinting strategies with one-sided error

Quantum Information & Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

Quantum fingerprints are useful quantum encodings introduced by Buhrman, Cleve, Watrous and de Wolf (Physical Review Letters, Volume 87, Number 16, Article 167902, 2001) to obtaia an efficient quantum communication protocol. We design a protocol for constructing the fingerprint in a dlstributed scenario. As an application, this protocol gives rise to a communication protocol more efficient than the best known classical protocol for a communicatioa problem.