Second quantized Kolmogorov complexity

Journal article

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.

Journal:: INTERNATIONAL JOURNAL OF QUANTUM INFORMATION More from this journal
Volume:: 6
Issue:: 4
Pages:: 907-928
Publication date:: 2008-08-01
DOI:: 10.1142/S021974990800375X
EISSN:: 1793-6918
ISSN:: 0219-7499

Language:: English
Keywords:: quantum Kolmogorov complexity

inequalities of von Neumann entropy

variable length compression

indeterminate length quantum strings
Pubs id:: pubs:158305
UUID:: uuid:a3cce266-6c28-4e1b-bf68-f191bf4bfa0d
Local pid:: pubs:158305
Source identifiers:: 158305
Deposit date:: 2012-12-19
ARK identifier:: ark:/29072/ora_a3cce2666c284e1bbf68f191bf4bfa0d

Licence:: Terms and Conditions of Use for Oxford University Research Archive

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