Strengths and weaknesses of quantum fingerprinting

Proceedings of the Annual IEEE Conference on Computational Complexity

Volumn 2006, Issue , 2006, Pages 288-295

  Gavinsky, Dmitry ^a   Kempe, Julia ^b   De Wolf, Ronald ^c  

^a UNIVERSITY OF CALGARY   (Canada)

^b CNRS   (France)

^c CWI   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL LEARNING THEORY; QUANTUM FINGERPRINTING; QUANTUM PROTOCOLS; SIMULTANEOUS MESSAGE PASSING (SMP);

COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; FUNCTION EVALUATION; MESSAGE PASSING; NETWORK PROTOCOLS; RANDOM PROCESSES;

QUANTUM CRYPTOGRAPHY;

EID: 34247496907     PISSN: 10930159     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CCC.2006.39     Document Type: Conference Paper

References (22)

1. A. Ambainis. Communication complexity in a 3-computer model. Algorithmica, 16(3):298-301, 1996.
2. L. Babai and P. G. Kimmel. Randomized simultaneous messages: Solution of a problem of Yao in communication complexity. In Proceedings of the 12th IEEE Conference on Computational Complexity, pages 239-246, 1997.
3. H. Buhrman, R. Cleve, J. Watrous, and R. de Wolf. Quantum fingerprinting. Physical Review Letters, 87(16), September 26, 2001. quant-ph/0102001.
4. S. Dasgupta and A. Gupta. An elementary proof of the Johnson- Lindenstrauss Lemma. Technical Report TR-99-006, Berkeley, CA, 1999.
5. J. Feigenbaum, Y. Ishai, T. Malkin, K. Nissim, M. Strauss, and R. Wright. Secure multiparty computation of approximations. In Proceedings of 28th ICALP, volume 2076 of Lecture Notes in Computer Science, pages 927-938. Springer, 2001.
6. J. Forster. A linear lower bound on the unbounded error probabilistic communication complexity. In Proceedings of 16th IEEE Conference on Computational Complexity, pages 100-106, 2001.
7. J. Forster, M. Krause, S. Lokam, R. Mubarakzjanov, N. Schmitt, and H.-U. Simon. Relations between communication complexity, linear arrangements, and computational complexity. In Proceedings of 21th FSTTCS, pages 171-182, 2001.
8. J. Forster, N. Schmitt, H.-U. Simon, and T. Suttorp. Estimating the optimal margins of embeddings in Euclidean half spaces. Machine Learning, 51:263-281, 2003.
9. D. Gavinsky, J. Kempe, O. Regev, and R. de Wolf. Bounded-error quantum state identification and exponential separations in communication complexity. In Proceedings of 38th ACM STOC, 2006. quant-ph/0511013.
10. A. Golinsky and P. Sen. A note on the power of quantum fingerprinting, quant-ph/0510091, December 2003.
11. W. Johnson and J. Lindenstrauss. Extensions of Lipschitz maps into a Hilbert space. In Conference in modern analysis and probability, volume 26 of Contemporary Mathematics, pages 189-206, 1984.
12. R. Jain, J. Radhakrishnan, and P. Sen. Prior entanglement, message compression and privacy in quantum communication. In Proceedings of 20th IEEE Conference on Computational. Complexity, pages 285-296, 2005.
13. I. Kremer. Quantum communication. Master's thesis, Hebrew University, Computer Science Department, 1995.
14. N. Linial, S. Mendelson, G. Schechtman, and A. Shraibman. Complexity measures of sign matrices. Manuscript, 2005.
15. N. Linial and A. Shraibman. Manuscript, 2006.
16. I. Newman. Private vs. common random bits in communication complexity. Information Processing Letters, 39(2): 67-71, 1991.
17. I. Newman and M. Szegedy. Public vs. private coin flips in one round communication games. In Proceedings of 28th ACM STOC, pages 561-570, 1996.
18. R. Raz. Exponential separation of quantum and classical communication complexity. In Proceedings of 31st ACM STOC, pages 358-367, 1999.
19. A. Razborov. Quantum communication complexity of symmetric predicates. Izvestiya of the Russian Academy of Science, mathematics, 67(1): 159-176, 2003. quant-ph/0204025.
20. Y. Shi. Tensor norms and the classical communication complexity of nonlocal quantum measurement. In Proceedings of 37th ACM STOC, pages 460-467, 2005.
21. A. C.-C. Yao. Quantum circuit complexity. In Proceedings of 34th IEEE FOCS, pages 352-360, 1993.
22. A. C.-C. Yao. On the power of quantum fingerprinting. In Proceedings of 35th ACM STOC, pages 77-81, 2003.