Privacy and interaction in quantum communication complexity and a theorem about the relative entropy of quantum states

Annual Symposium on Foundations of Computer Science - Proceedings

Volumn , Issue , 2002, Pages 429-438

  Jain, Rahul ^a   Radhakrishnan, Jaikumar ^a   Sen, Pranab ^b  

^a TATA INSTITUTE OF FUNDAMENTAL RESEARCH   (India)

^b Laboratoire Interdisciplinaire des Sciences du Numérique   (France)

Author keywords

[No Author keywords available]

Indexed keywords

BOUNDARY CONDITIONS; COMPUTATIONAL COMPLEXITY; DATA COMMUNICATION SYSTEMS; NETWORK PROTOCOLS; PROBABILITY DISTRIBUTIONS; QUANTUM THEORY; THEOREM PROVING;

INDEX FUNCTION PROBLEM; POINTER CHASING PROBLEM; QUANTUM COMMUNICATION; QUANTUM STATES; RELATIVE ENTROPY THEORY; SUBSTRATE THEOREM;

DATA PRIVACY;

EID: 0036949108     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (18)

1. T. Cover and J. Thomas. Elements of Information Theory. Wiley Series in Telecommunications. John Wiley and Sons, 1991.
2. R. Cleve, Wim van Dam, M. Nielsen, and A. Tapp. Quantum entanglement and the communication complexity of the inner product function. In Proceedings of the 1st NASA International Conference on Quantum Computing and Quantum Communications, Lecture Notes in Computer Science, vol. 1509, pages 61-74. Springer-Verlag, 1998. Also quant-ph/9708019.
3. P. Duris, Z. Galil, and G. Schnitger. Lower bounds on communication complexity. Information and Computation, 73:1-22, 1987.
4. C. Damm, S. Jukna, and J. Sgall. Some bounds on multiparty communication complexity of pointer jumping. Computational Complexity, 7:109-127, 1998.
5. C. A. Fuchs and C. M. Caves. Mathematical techniques for quantum communication theory. Open Systems and Information Dynamics, 3(3):345-356, 1995. Also quant-ph/9604001.
6. C. A. Fuchs and J. van de Graaf. Cryptographic distinguishability measures for quantum mechanical states. IEEE Transactions on Information Theory, 45(4):1216-1227, 1999. Also quant-ph/9712042.
7. R. Jozsa. Fidelity for mixed quantum states. J. Modern Optics, 41(12):2315-2323, 1994.
8. H. Klauck. On quantum and probabilistic communication: Las Vegas and one-way protocols. In Proceedings of the 32nd Annual ACM Symposium on Theory of Computing, pages 644-651, 2000.
9. H. Klauck. On quantum and approximate privacy. In Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science, Lecture Notes in Computer Science, vol. 2285, pages 335-346. Springer-Verlag, 2002. Also quant-ph/0110038.
10. H. Klauck, A. Nayak, Amnon Ta-Shma, and D. Zuckerman. Interaction in quantum communication and the complexity of set disjointness. In Proceedings of the 33rd Annual ACM Symposium on Theory of Computing, pages 124-133, 2001.
11. P. Bro Miltersen, N. Nisan, S. Safra, and A. Wigderson. On data structures and asymmetric communication complexity. Journal of Computer and System Sciences, 57(1):37-49, 1998.
12. A. Nayak. Optimal lower bounds for quantum automata and random access codes. In Proceedings of the 40th Annual IEEE Symposium on Foundations of Computer Science, pages 369-377, 1999.
13. M. Nielsen and I. Chuang. Quantum Computation and Quantum Information. Cambridge University Press, 2000.
14. N. Nisan and A. Wigderson. Rounds in communication complexity revisited. SIAM Journal of Computing, 22:211-219, 1993.
15. M. Osborne and A. Rubinstein. A Course in Game Theory. MIT Press, 1994.
16. S. J. Ponzio, Jaikumar Radhakrishnan, and S. Venkatesh. The communication complexity of pointer chasing. Journal of Computer and System Sciences, 62(2):323-355, 2001.
17. C. Papadimitriou and M. Sipser. Communication complexity. Journal of Computer and System Sciences, 28:260-269, 1984.
18. A. C.-C. Yao. Quantum circuit complexity. In Proceedings of the 34th Annual IEEE Symposium on Foundations of Computer Science, pages 352-361, 1993.