← all papers · overview

Algorithmic Complexity And Entanglement Of Quantum States

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.

Related papers

Ranked by semantic similarity — how closely each paper's abstract matches this one (100% = near-identical topic).