Quantum Kolmogorov Complexity

Journal of Computer and System Sciences

Volumn 63, Issue 2, 2001, Pages 201-221

  Berthiaume, André ^a   Van Dam, Wim ^b   Laplante, Sophie ^c  

^a DEPAUL UNIVERSITY   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

^c UNIVERSITÉ PARIS SACLAY   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0039891915     PISSN: 00220000     EISSN: None     Source Type: Journal    
DOI: 10.1006/jcss.2001.1765     Document Type: Article

References (28)

1. Barenco A., Berthiaume A., Deutsch D., Ekert A., Jozsa R., Macchiavello C. Stabilisation of quantum computations by symmetrisation. SIAM J. Comput. 26:1997;1541-1557.
2. Bernstein E., Vazirani U. Quantum complexity theory. SIAM J. Comput. 26:1997;1411-1473.
3. Bennett C., Wiesner S. Communication via one- and two-particle operators on Einstein-Podolsky-Rosen states. Phys. Rev. Lett. 69:1992;2881-2884.
4. Chaitin G. On the length of programs for computing finite binary sequences. J. Assoc. Comput. Math. 13:1966;547-569.
5. Cover T. M., Thomas J. A. Elements of Information Theory. Wiley Series in Telecommunications. 1991;Wiley, New York.
6. Deutsch D. Quantum theory, the Church-Turing principle and the universal quantum computer. Proc. Roy. Soc. London A. 400:1985;97-117.
7. Fuchs C. A., van de Graaf J. Cryptographic distinguishability measures for quantum mechanical states. IEEE Trans. Inform. Theory. 45:1999;1216-1227.
8. Gács P. Quantum algorithmic entropy. J. Phys. A: Mathematical and General. 34:2001;6859-6880.
9. Garey M. R., Johnson D. S. Computers and Intractibility, A Guide to the Theory of NP Completeness. 1979;Freeman, New York.
10. Holevo A. S. Bounds for the quantity of information transmitted by a quantum communication channel. Probl. Peredachi Inform. 9:1973;3-11.
11. Horodecki M. Limits for compression of quantum information carried by ensembles mixed states. Phys. Rev. A. 57:1998;3364-3369.
12. Jozsa R., Horodecki M., Horodecki P., Horodecki R. Universal quantum information compression. Phys. Rev. Lett. 81:1998;1714-1717.
13. Jozsa R., Schumacher B. A new proof of the quantum noiseless coding theorem. J. Modern Optics. 41:1994;2343-2349.
14. Kolmogorov A. K. Three approaches to the quantitative definition of information. Probl. Inform. Transmission. 1:1965;1-7.
15. Li M., Vitányi P. An Introduction to Kolmogorov Complexity and its Applications. 1997;Springer-Verlag, Berlin/New York.
16. Lindblad G. Completely positive maps and entropy inequalities. Comm. Math. Phys. 40:1975;147-151.
17. M. A. Nielsen, Ph.D. thesis, University of New Mexico, 1998; arXiv:quant-ph/0011036, 2000.
18. Nielsen M. A., Chuang I. L. Quantum Computation and Quantum Information. 2000;Cambridge University Press, Cambrigde.
19. Preskill J. Quantum Computing. 1998.
20. Schumacher B. Quantum coding. Phys. Rev. A. 51:1995;2738-2747.
21. Shannon C. E., Weaver W. The Mathematical Theory of Communication. 1949;University of Illinois Press.
22. Solomonoff R. Technical Report. 1960.
23. Svozil K. Quantum algorithmic information theory. J. Universal Comput. Sci. 2:1996;311-346.
24. Uhlmann A. Relative entropy and the Wigner-Yanase-Dyson-Lieb concavity in a interpolation theory. Rev. Math. Phys. 54:1977;21-32.
25. Vitányi P. Quantum Kolmogorov complexity using classical descriptions. IEEE Trans. Inform Theory. 47:2001;2464-2479.
26. Wehrl A. General properties of entropy. Rev. Modern Phys. 50:1978;221-260.
27. Werner R. F. Optimal cloning of pure states. Phys. Rev. A. 58:1998;1827-1832.
28. Wootters W. K., Zurek W. H. A single quantum cannot be cloned. Nature. 229:1982;802-803.