Reversible arithmetic coding for quantum data compression

IEEE Transactions on Information Theory

Volumn 46, Issue 3, 2000, Pages 1104-1116

  Chuang, Isaac L ^a   Modha, Dharmendra S ^a  

^a IBM ALMADEN RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CODES (SYMBOLS); DATA COMPRESSION; DIGITAL ARITHMETIC; EIGENVALUES AND EIGENFUNCTIONS; INFORMATION THEORY;

ARITHMETIC CODING; QUANTUM DATA COMPRESSION; SCHUMACHER CODING;

ENCODING (SYMBOLS);

EID: 0034188158     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/18.841192     Document Type: Article

References (35)

1. P.W. Shor, "Algorithms for quantum computation: Discrete logarithms and factoring," in Proc. 35th Annu. Symp. Foundations of Computer Science, Santa Fe, NM. Los Alamitos, CA: lEEEComp. Soc. Press, 1994, pp. 124-134.
2. L.K. Grover, "A fast quantum mechanical algorithm for database search," in Proc. 28th Annu. ACM Symp. Theory of Computation, Philadelphia, PA, 1996, pp. 212-219.
3. C.H. Bennett, G. Brassard, and A. K. Ekert, "Quantum cryptography," Sci. Amer., vol. 267, pp. 50-57, Oct. 1992.
4. C. Fuchs, "Nonorthogonal quantum states maximize classical information capacity," Phys. Rev. Lett., vol. 79, pp. 1162-1165, 1997.
5. A.R. Calderbank, E. M. Rains, P. W. Shor, and N. J. A. Sloane, "Quantum error correction via codes over GF(4)," IEEE Trans. Inform. Theory, vol. 44, pp. 1369-1387, July 1998.
6. C.H. Bennett and P. W. Shor, "Quantum information theory," IEEE Trans. Inform. Theory (Commemorative Issue, 1948-1998), vol. 44, pp. 2724-2742, Oct. 1998.
7. E. Rieffel and W. Polak. (1998) An introduction to quantum computing for nonphysicists. [Online] http://xxx.lanl.gov/abs/quant-ph/9809016.
8. A. Steane, "Quantum computing," Reps. Progr. Phys., vol. 61, pp. 117-173, 1998.
9. C.E. Shannon, "A mathematical theory of communication," Bell Syst. Tech. J., vol. 27, pp. 379-423, 1948.
10. T.M. Cover and J. A. Thomas, Elements of Information Theory. New York: Wiley , 1991.
11. B. Schumacher, "Quantum coding," Phys. Rev. A, vol. 51, pp. 2738-2747, 1995.
12. W.K. Wootters and W. H. Zurek, "A single quantum cannot be cloned," Nature, vol. 299, pp. 802-803, 1982.
13. D. Dieks, "Communication by EPR devices," Phys. Lett. A, vol. 92, no. 6, pp. 271-272, 1982.
14. [ 14] R. Cleve and D. P. DiVincenzo, "Schumacher's quantum data compression as a quantum computation," Phys. Rev. A, vol. 54, pp. 2636-2650, Oct. 1996.
15. T.M. Cover, "Enumerative source encoding," IEEE Trans. Inform. Theory, vol. IT-19, pp. 73-77, Jan. 1973.
16. J.P. M. Schalkwijk, "An algorithm for source coding," IEEE Trans. Inform. Theory, vol. IT-18, pp. 395-399, May 1972.
17. S.L. Braunstein, C. A. Fuchs, D. Gottesman, and H.-K. Lo, "A quantum analog of Huffman coding," in Proc, 1998 IEEE Int. Symp. Information Theory. Cambridge, MA, Aug. 16-21, 1998, [Online] http://xxx.lanl.gov/abs/quant-ph/9805080, p. 353.
18. R.C. Pasco, "Source coding algorithms for fast data compression," Ph.D. dissertation, Dep. Elec. Eng., Stanford Univ., Stanford, CA, 1976.
19. J. Rissanen, "Generalized Kraft inequality and arithmetic coding," IBM J. Res. Devel, vol. 20, no. 3, pp. 198-203, 1976.
20. T.C. Bell, J. G. Cleary, and I. H. Witten, Text Compression. Englewood Cliffs, NJ: Prentice-Hall, 1990.
21. G.G. Langdon Jr., "An introduction to arithmetic coding," IBM J. Res. Develop., vol. 28, no. 2, pp. 135-149, 1984.
22. J. Rissanen and G. G. Langdon Jr., "Arithmetic coding," IBM J. Res. Develop., vol. 23, no. 2, pp. 149-162, 1979.
23. C.H. Bennett, "Logical reversibility of computation," IBM J. Res. Develop., vol. 17, pp. 525-532, 1973.
24. "Time/space trade-offs for reversible computation," SIAM J. Comput., vol. 18, pp. 766-776, 1989.
25. T. Toffoli, "Reversible computing," in Automata, Languages, and Programming, W. de Bakker and J. van Leeuwen, Eds. New York: Springer, 1980, pp. 632-644.
26. D. Deutsch, "Quantum theory, the Church-Turing principle and the universal quantum computer," in Proc. Roy. Soc. London A, vol. 400, 1985, pp. 97-117.
27. A. Barenco, C. H. Bennett, R. Cleve, D. P. DiVincenzo, N. Margolus, P. W. Shor, T. Sleator, J. Smolin, and H. Weinfurther, "Elementary gates for quantum computation," Phys. Rev. A, vol. 52, no. 5, pp. 3457-3467, 1995.
28. A. Barenco, "A universal two-bit gate for quantum computation," in Proc. Roy. Soc. London A, vol. 449, 1995, pp. 679-683.
29. W. Hoeffding, "Probability inequalities for sums of bounded random variables," Amer. Statist. Assoc. J., vol. 58, pp. 13-30, 1963.
30. J. von Neumann, Mathematical Foundations of Quantum Mechanics. Princeton, NJ, USA: Princeton Univ. Press, 1955.
31. D. Beckman, A. N. Chad, S. Devabhaktuni, and J. Preskill, "Efficient networks for quantum factoring," Phys. Rev. A, vol. 54, no. 2, pp. 1034-1063, 1996.
32. E. Fredkin and T. Toffoli, "Conservative logic," Int. J. Theor. Phys., vol. 21, no. 3/4, pp. 219-253, 1982.
33. H.F. Chau and F. Wilczek, "Simple realization of the Fredkin gate using a series of two-body operators," Phys. Rev. Lett., vol. 75, no. 4, pp. 748-750, 1995.
34. I.L. Chuang and Y. Yamamoto, "Simple quantum computer," Phys. Rev. A, vol. 52, pp. 3489-3496, 1995.
35. S. Younis and T. Knight, "Non dissipative rail drivers for adiabatic circuits," in Proc. 16th Conf. Advanced Research in VLSI 1995. Los Alamitos, CA: IEEE Comput. Soc. Press, 1995, pp. 404-414.