On the power of quantum fingerprinting

Conference Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2003, Pages 77-81

  Yao, Andrew Chi Chih ^a  

^a Princeton University   (United States)

Author keywords

Communication complexity; Computational complexity; Public coin; Quantum protocol; Simultaneous message model

Indexed keywords

BOOLEAN FUNCTIONS; COMPUTATIONAL COMPLEXITY; MATHEMATICAL MODELS;

QUANTUM FINGERPRINTING;

QUANTUM THEORY;

EID: 0038447038     PISSN: 07349025     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/780551.780554     Document Type: Conference Paper

References (6)

1. A. Ambainis. Communication complexity in a 3-computer model. Algorithmica, 16:298-301, 1996.
2. L. Babai and P. Kimmel. Randomized simultaneous messages. In Proc. 12th IEEE Symp. on Computational Complexity, pages 239-246. IEEE, 1997.
3. H. Buhrman, R. Cleve, J. Watrous, and R. de Wolf. Quantum fingerprinting. Physical Review Letters, 87(16):167902, 2001.
4. E. Kushilevitz and N. Nisan. Communication Complexity. Cambridge University Press, Cambridge, UK, 1997.
5. I. Newman. Private vs. common random bits in communication complexity. Information Processing Letters, 39:67-71, 1991.
6. I. Newman and M. Szegedy. Public vs. private coin flips in one round communication games. In Proc. 28th ACM Symp. on Theory of Computing, pages 561-570. ACM, 1996.