The Library
Second quantized Kolmogorov complexity
Tools
Tools
Tools
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. ISSN 0219-7499
Full text not available from this repository.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 > 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 |
| Date: | August 2008 |
| Volume: | Volume 6 |
| Number: | Number 4 |
| Number of Pages: | 22 |
| Page Range: | pp. 907-928 |
| Identification Number: | 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 |
| URI: | http://wrap.warwick.ac.uk/id/eprint/29405 |
Data sourced from Thomson Reuters' Web of Knowledge
Actions (login required)
 |
View Item |
