Classical and quantum fingerprinting with shared randomness and one-sided error

Quantum Information and Computation

Volumn 5, Issue 3, 2005, Pages 258-271

  Horn, Rolf T ^a   Scott, A J ^a   Walgate, Jonathan ^a   Cleve, Richard ^a,b   Lvovsky, A I ^a   Sanders, Barry C ^a  

^a UNIVERSITY OF CALGARY   (Canada)

^b UNIVERSITY OF WATERLOO   (Canada)

Author keywords

Communication complexity; Quantum fingerprinting

Indexed keywords

COMPUTATIONAL COMPLEXITY; MESSAGE PASSING; PROBABILITY; QUANTUM ENTANGLEMENT;

COMMUNICATION COMPLEXITY; ERROR PROBABILITIES; FINGERPRINTING PROTOCOL; MESSAGE PASSING MODELS; QUANTUM FINGERPRINTING; SIMULTANEOUS MESSAGES; WORST CASE ERROR;

ERRORS;

EID: 20744438318     PISSN: 15337146     EISSN: None     Source Type: Journal    
DOI: 10.26421/qic5.3-6     Document Type: Article

References (17)

1. A. C.-C. Yao,"Some complexity questions related to distributive computing," in Proceedings of the 11th Annual ACM Symposium on Theory of Computing, Atlanta, 1979, edited by M. J. Fischer et al. (ACM, New York, 1979), p. 209.
2. E. Kushilevitz and N. Nisan, Communication Complexity (Cambridge University Press, Cambridge, 1997).
3. H. Buhrman, R. Cleve, J. Watrous, and R. de Wolf, "Quantum Fingerprinting," Phys. Rev. Lett. 87, 167902 (2001).
4. J. Niel de Beaudrap, "One-qubit fingerprinting schemes," Phys. Rev. A 69, 022307 (2004).
5. A. C.-C. Yao, "On the power of quantum fingerprinting," in Proceedings of the 35th Annual ACM Symposium on Theory of Computing, Atlanta, 1999, edited by J. S. Vitter et al. (ACM, New York, 2003), p. 77.
6. A. Ambainis and Y. Shi, "Distributed construction of quantum fingerprints," e-print quant-ph/0305022.
7. D. Gavinsky, J. Kempe, and R. de Wolf, "Quantum Communication Cannot Simulate a Public Coin," e-print quant-ph/0411051.
8. H. Nishimura, "Quantum Simultaneous Protocol with Prior Entanglement," in Proceedings of the 2004 ERATO Conference on Quantum Information Science, Tokyo, 2004, p. 140.
9. A. Ambainis, "Communication Complexity in a 3-Computer Model," Algorithmica 16, 298 (1996).
10. I. Newman and M. Szegedy, "Public vs. private coin flips in one round communication games," in Proceedings of the 28th Annual ACM Symposium on Theory of Computing, Philadelphia, 1996, edited by G. L. Miller (ACM, New York, 1996), p. 561.
11. L. Babai and P. G. Kimmel, "Randomized simultaneous messages: solution of a problem of Yao in communication complexity," in Proceedings of the 12th Annual IEEE Conference on Computa tional Complexity, Ulm, Germany, 1997, (IEEE Comp. Soc., Los Alamitos CA, 1997), p. 239.
12. I. Newman, "Private vs. common random bits in communication complexity," Inf. Process. Lett. 39, 67 (1991).
13. R. T. Horn, S. A. Babichev, K.-P. Marzlin, A. I. Lvovsky, and B. C. Sanders, "Single-qubit optical quantum fingerprinting," e-print quant-ph/0410232.
14. J. Du, P. Zou, D. K. L. Oi, X. Peng, L. C. Kwek, C. H. Oh, and A. Ekert, "Experimental Demonstration of Quantum State Multi-meter and One-qubit Fingerprinting in a Single Quantum Device," e-print quant-ph/0411180.
15. L. R. Welch, "Lower bounds on the maximum cross correlation of signals," IEEE Trans. Inf. Theory 20, 397 (1974).
16. J. J. Benedetto and M. Fickus, "Finite Normalized Tight Frames," Adv. Comp. Math. 18, 357 (2003).
17. A. J. Scott, in preparation.