Dense quantum coding and quantum finite automata

Journal of the ACM

Volumn 49, Issue 4, 2002, Pages 496-511

  Ambainis, Andris ^a   Nayak, Ashwin ^b,e   Ta Shma, Amnon ^c   Vazirani, Umesh ^d,f  

^a INSTITUTE FOR ADVANCED STUDY   (United States)

^b CALIFORNIA INSTITUTE OF TECHNOLOGY   (United States)

^c TEL AVIV UNIVERSITY   (Israel)

^d UNIVERSITY OF CALIFORNIA   (United States)

^e CALIFORNIA INSTITUTE OF TECHNOLOGY   (United States)

^f UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Automaton size; Communication complexity; Encoding; Finite automata; Quantum communication; Quantum computation

Indexed keywords

AUTOMATION SIZE; CLASSICAL AUTOMATA; QUANTUM COMMUNICATION; QUANTUM COMPUTATION;

AUTOMATA THEORY; COALESCENCE; CODES (SYMBOLS); COMPUTER SIMULATION; DATA COMPRESSION; ENCODING (SYMBOLS); ENTROPY; INFORMATION DISSEMINATION; MATHEMATICAL MODELS; QUADRATIC PROGRAMMING; QUANTUM THEORY;

FINITE AUTOMATA;

EID: 0942292954     PISSN: 00045411     EISSN: None     Source Type: Journal    
DOI: 10.1145/581771.581773     Document Type: Article

References (19)

1. AHARONOV, D., KITAEV, A., AND NISAN, N. 1998. Quantum circuits with mixed states. In Proceedings of the Thirtieth Annual ACM Symposium on Theory of Computing. ACM Press, New York, 20-30.
2. AMBAINIS, A., AND FREIVALDS, R. 1998. 1-way quantum finite automata: Strengths, weaknesses and generalizations. In Proceedings of the 39th Annual IEEE Symposium on Foundations of Computer Science. IEEE Computer Society Press, Los Alamitos, Calif., pp. 332-341.
3. AMBAINIS, A., NAYAK, A., TA-SHMA, A., AND VAZIRANI, U. 1999. Dense quantum coding and a lower bound for 1-way quantum automata. In Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing. ACM Press, New York, pp. 376-383.
4. BENNETT, C., BRASSARD, G., BREIDBART, S., AND WIESNER, S. 1982. Quantum cryptography, or unforgeable subway tokens. In Advances in Cryptology: Proceedings of Crypto'82 (1983). D. Chaum, R. L. Rivest, and A. T. Sherman, Eds. Plenum Press, New York, NY, pp. 267-275.
5. BUHRMAN, H., CLEVE, R., AND WIGDERSON, A. 1998. Quantum vs. classical communication and computation. In Proceedings of the Thirtieth Annual ACM Symposium on Theory of Computing. ACM Press, New York, pp. 63-68.
6. BUHRMAN, H., AND DE WOLF, R. 2001. Communication complexity lower bounds by polynomials. In Proceedings of the 16th Annual IEEE Conference on Computational Complexity. IEEE Computer Society Press, Los Alamitos, Calif., pp. 120-130.
7. CHUANG, I. 1997. Personal communication.
8. COHEN, G., HONKALA, I., LITSYN, S., AND LOBSTEIN, A. 1997. Covering Codes. North-Holland Mathematical Library, vol. 54. Elsevier, Amsterdam, The Netherlands.
9. COVER, T. M., AND THOMAS, J. A. 1991. Elements of Information Theory. Wiley Series in Telecommunications. John Wiley & Sons, New York.
10. HOLEVO, A. 1973. Some estimates of the information transmitted by quantum communication channels. Probl. Inform. Trans., 9, 3, 177-183.
11. KLAUCK, H., NAYAK, A., TA-SHMA, A., AND ZUCKERMAN, D. 2001. Interaction in quantum communication and the complexity of Set Disjointness. In Proceedings of the 33rd Annual ACM Symposium on Theory of Computing. ACM Press, New York, pp. 124-133.
12. KONDACS, A., AND WATROUS, J. 1997. On the power of quantum finite state automata. In Proceedings of the 38th Annual IEEE Symposium on Foundations of Computer Science. IEEE Computer Society Press, Los Alamitos, Calif., pp. 66-75.
13. MOORE, C., AND CRUTCHFIELD, J. 2000. Quantum automata and quantum grammars. Theor. Comput. Sci. 237, 1-2, 275-306.
14. NAYAK, A. 1999a. Lower Bounds for Quantum Computation and Communication. Ph.D. thesis, University of California, Berkeley, Calif.
15. NAYAK, A. 1999b. Optimal lower bounds for quantum automata and random access codes. In Proceedings of the 40th Annual IEEE Symposium on Foundations of Computer Science. IEEE Computer Society Press, Los Alamitos, Calif., pp. 369-376.
16. NIELSEN, M., AND CHUANG, I. 2000. Quantum Computation and Quantum Information. Cambridge University Press, Cambridge, England, Chapter 7.7, pp. 324-343.
17. PERES, A. 1995. Quantum Theory: Concepts and Methods. Kluwer Academic Publishers, Norwell, Mass.
18. PRESKILL, J. 1998. Lecture notes. Available online at http://www.theory.caltech.edu/people/preskill/ph229/.
19. WEHRL, A. 1978. General properties of entropy. Rev. Mod. Phys. 50, 2, 221-260.