Algorithmic complexity and entanglement of quantum states
classification
🪐 quant-ph
keywords
algorithmiccomplexityquantumentanglementstatestatesboundsconnection
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.