Quantum algorithmic entropy

Journal of Physics A: Mathematical and General

Volumn 34, Issue 35, 2001, Pages 6859-6880

  Gács, Peter ^a,b  

^a BOSTON UNIVERSITY   (United States)

^b CWI   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0035823457     PISSN: 03054470     EISSN: None     Source Type: Journal    
DOI: 10.1088/0305-4470/34/35/312     Document Type: Article

References (10)

1. Berthiaume A, van Dam W and Laplante S 2000 Quantum Kolmogorov complexity Proc. 15th IEEE Conf. on Computational Complexity (Piscataway, NJ: IEEE) pp 240-9
2. (Berthiaume A, van Dam W and Laplante S 2000 Preprint quant-ph/0005018)
3. Bhatia R 1996 Matrix Analysis (Graduate Texts in Mathematics) (Berlin: Springer)
4. Li M and Vitányi P M B 1993 Introduction to Kolmogorov Complexity and its Applications (Berlin: Springer)
5. Peres A 1995 Quantum Theory: Concepts and Methods (Fundamental Theories of Physics) (Dordrecht: Kluwer Academic)
6. Schumacher B and Westmoreland M D 2000 Indeterminate-length quantum coding Preprint quant-ph/0011014
7. Vitanyi PMB 2000 Three approaches to the quantitative definition of information in an individual pure quantum state Proc. 15th IEEE Conf. on Computational Complexity (Piscataway, NJ: IEEE) pp 263-70
8. (Vitányi P M B Preprint quant-ph/9907035)
9. Wehrl A 1978 General properties of entropy Rev. Mod. Phys. 50 221-60
10. Weyl H 1946 The Classical Groups, Their Invariants and Representations (Princeton, NJ: Princeton University Press)