Andris Ambainis
Abstract
We consider the possibility of encoding m classical bits into many fewer n quantum bits (qubits) so that an arbitrary bit from the original m bits can be recovered with good probability. We show that nontrivial quantum codes exist that have no classical counterparts. On the other hand, we show that quantum encoding cannot save more than a logarithmic additive factor over the best classical encoding. The proof is based on an entropy coalescence principle that is obtained by viewing Holevo's theorem from a new perspective.In the existing implementations of quantum computing, qubits are a very expensive resource. Moreover, it is difficult to reinitialize existing bits during the computation. In particular, reinitialization is impossible in NMR quantum computing, which is perhaps the most advanced implementation of quantum computing at the moment. This motivates the study of quantum computation with restricted memory and no reinitialization, that is, of quantum finite automata. It was known that there are languages that are recognized by quantum finite automata with sizes exponentially smaller than those of corresponding classical automata. Here, we apply our technique to show the surprising result that there are languages for which quantum finite automata take exponentially more states than those of corresponding classical automata.
- 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. Google Scholar
- 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. Google Scholar
- 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. Google Scholar
- 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.Google Scholar
- 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. Google Scholar
- 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. Google Scholar
- Chuang, I. 1997. Personal communication.Google Scholar
- Cohen, G., Honkala, I., Litsyn, S., and Lobstein, A. 1997. Covering Codes. North-Holland Mathematical Library, vol. 54. Elsevier, Amsterdam, The Netherlands.Google Scholar
- Cover, T. M., and Thomas, J. A. 1991. Elements of Information Theory. Wiley Series in Telecommunications. John Wiley & Sons, New York. Google Scholar
- Holevo, A. 1973. Some estimates of the information transmitted by quantum communication channels. Probl. Inform. Trans. 9, 3, 177--183.Google Scholar
- 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. Google Scholar
- 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. Google Scholar
- Moore, C., and Crutchfield, J. 2000. Quantum automata and quantum grammars. Theor. Comput. Sci. 237, 1-2, 275--306. Google Scholar
- Nayak, A. 1999a. Lower Bounds for Quantum Computation and Communication. Ph.D. thesis, University of California, Berkeley, Calif. Google Scholar
- 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. Google Scholar
- Nielsen, M., and Chuang, I. 2000. Quantum Computation and Quantum Information. Cambridge University Press, Cambridge, England, Chapter 7.7, pp. 324--343.Google Scholar
- Peres, A. 1995. Quantum Theory: Concepts and Methods. Kluwer Academic Publishers, Norwell, Mass.Google Scholar
- Preskill, J. 1998. Lecture notes. Available online at http://www.theory.caltech.edu/people/preskill/ph229/.Google Scholar
- Wehrl, A. 1978. General properties of entropy. Rev. Mod. Phys. 50, 2, 221--260.Google Scholar
Index Terms
- Dense quantum coding and quantum finite automata
Recommendations
Can quantum discord increase in a quantum communication task?
Quantum teleportation of an unknown quantum state is one of the few communication tasks which has no classical counterpart. Usually the aim of teleportation is to send an unknown quantum state to a receiver. But is it possible in some way that the ...
1-way quantum finite automata: strengths, weaknesses and generalizations
FOCS '98: Proceedings of the 39th Annual Symposium on Foundations of Computer ScienceWe study 1-way quantum finite automata (QFAs).First, we compare them with their classical counterparts. We show that, if an automaton is required to give the correct answer with a large probability (greater than 7/9), then any 1-way QFAs can be ...
Comments