Rogers, C. (Caroline), Vedral, Vlatko and Nagarajan, Rajagopal (2008) Second quantized Kolmogorov complexity. International Journal of Quantum Information, Volume 6 (Number 4). pp. 907-928. doi:10.1142/S021974990800375X ISSN 0219-7499.

Research output not available from this repository.

Request-a-Copy directly from author or use local Library Get it For Me service.

Request Changes to record.

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.

Item Type:	Journal Article
Subjects:	Q Science > QA Mathematics > QA76 Electronic computers. Computer science. Computer software Q Science > QC Physics
Divisions:	Faculty of Science, Engineering and Medicine > Science > Computer Science
Library of Congress Subject Headings (LCSH):	Kolmogorov complexity
Journal or Publication Title:	International Journal of Quantum Information
Publisher:	World Scientific Publishing Co. Pte. Ltd.
ISSN:	0219-7499
Official Date:	August 2008
Dates:	Date Event August 2008 Published
Volume:	Volume 6
Number:	Number 4
Number of Pages:	22
Page Range:	pp. 907-928
DOI:	10.1142/S021974990800375X
Status:	Peer Reviewed
Publication Status:	Published
Access rights to Published version:	Restricted or Subscription Access
Funder:	Royal Society (Great Britain), Engineering and Physical Sciences Research Council (EPSRC), Wolfson Foundation

Data sourced from Thomson Reuters' Web of Knowledge

Request changes or add full text files to a record

Repository staff actions (login required)

View Item