APS » PROLA » Phys. Rev. Lett. » Volume 95 » Issue 20
< Previous article | Next article >

Phys. Rev. Lett. 95, 200503 (2005) [4 pages]

Algorithmic Complexity and Entanglement of Quantum States

Download: PDF (93 kB) or Buy this Article (Use Article Pack) Export: BibTeX or EndNote (RIS)

Caterina E. Mora1 and Hans J. Briegel1,2
1Institut für Quantenoptik und Quanteninformation der Österreichischen Akademie der Wissenschaften, Innsbruck, Austria
2Institut für Theoretische Physik, Universität Innsbruck, Technikerstraße 25, A-6020 Innsbruck, Austria

Received 30 May 2005; published 9 November 2005

We define the algorithmic complexity of a quantum state relative to a given precision parameter, and give upper bounds for various examples of states. We also establish a connection between the entanglement of a quantum state and its algorithmic complexity.


©2005 The American Physical Society

URL: http://link.aps.org/doi/10.1103/PhysRevLett.95.200503
DOI: 10.1103/PhysRevLett.95.200503
PACS: 03.67.Lx, 03.65.Ud, 03.67.Mn

[ Abstract  |  Previous article  |  Next article  |  Issue 20 ]