Journal article icon

Journal article

Second quantized Kolmogorov complexity

Abstract:
The Kolmogorov complexity of a string is the length of its shortest description. We define a second quantized Kolmogorov complexity where the length of a description is defined to be the average length of its superposition. We discuss this complexity's basic properties. We define the corresponding prefix complexity and show that the inequalities obeyed by this prefix complexity are also obeyed by von Neumann entropy. © 2008 World Scientific Publishing Company.
Publication status:
Published

Actions


Access Document


Publisher copy:
10.1142/S021974990800375X

Authors


More by this author
Institution:
University of Oxford
Department:
Oxford, MPLS, Physics, Atomic and Laser Physics
Nagarajan, R More by this author
Journal:
INTERNATIONAL JOURNAL OF QUANTUM INFORMATION
Volume:
6
Issue:
4
Pages:
907-928
Publication date:
2008-08-05
DOI:
EISSN:
1793-6918
ISSN:
0219-7499
URN:
uuid:a3cce266-6c28-4e1b-bf68-f191bf4bfa0d
Source identifiers:
158305
Local pid:
pubs:158305

Terms of use


Metrics



If you are the owner of this record, you can report an update to it here: Report update to this record

TO TOP