Second Quantized Kolmogorov Complexity

Simple item page
dc.creatorRogers, Caroline
dc.creatorVedral, Vlatko
dc.creatorNagarajan, Rajagopal
dc.date2008-09-16
dc.date.accessioned2026-07-07T10:03:13Z
dc.date.available2026-07-07T10:03:13Z
dc.descriptionThe Kolmogorov complexity of a string is the length of its shortest description. We define a second quantised 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.
dc.description14 pages, 0 figures
dc.identifierhttps://arxiv.org/abs/0809.2642
dc.identifierhttp://arxiv.org/abs/0809.2642
dc.identifierVolume No. 06, Issue No. 04 of IJQI, Pg 907 - 928, 2008
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/169207
dc.subjectQuantum Physics
dc.titleSecond Quantized Kolmogorov Complexity
dc.typetext

Files

Collections

arXiv