Algorithmic complexity and entanglement of quantum states
arXiv:quant-ph/0505200 · doi:10.1103/PhysRevLett.95.200503
Abstract
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.
4 pages. Replaced with published version