Phys. Rev. Lett. 95, 200503 (2005) [4 pages]Algorithmic Complexity and Entanglement of Quantum StatesReceived 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
|
|
About | Terms and Conditions | Subscriptions | Search | Help
Use of the American Physical Society websites and journals implies that the user has read and agrees to our Terms and Conditions and any applicable Subscription Agreement. Physical Review®, Physical Review Letters®, Reviews of Modern Physics®, and Physical Review Special Topics® are trademarks of the American Physical Society.