Algorithmic Complexity and Entanglement of Quantum States

Caterina E. Mora and Hans J. Briegel

Phys. Rev. Lett. 95, 200503 – Published 9 November 2005

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.

Received 30 May 2005

DOI:https://doi.org/10.1103/PhysRevLett.95.200503

Authors & Affiliations

Caterina E. Mora¹ and Hans J. Briegel^1,2

¹Institut für Quantenoptik und Quanteninformation der Österreichischen Akademie der Wissenschaften, Innsbruck, Austria
²Institut für Theoretische Physik, Universität Innsbruck, Technikerstraße 25, A-6020 Innsbruck, Austria