Operational axioms for diagonalizing states

Giulio Chiribella
(Department of Computer Science, University of Hong Kong, Hong Kong)
Carlo Maria Scandolo
(Department of Computer Science, University of Oxford, Oxford, UK)

In quantum theory every state can be diagonalized, i.e. decomposed as a convex combination of perfectly distinguishable pure states. This elementary structure plays an ubiquitous role in quantum mechanics, quantum information theory, and quantum statistical mechanics, where it provides the foundation for the notions of majorization and entropy. A natural question then arises: can we reconstruct these notions from purely operational axioms? We address this question in the framework of general probabilistic theories, presenting a set of axioms that guarantee that every state can be diagonalized. The first axiom is Causality, which ensures that the marginal of a bipartite state is well defined. Then, Purity Preservation states that the set of pure transformations is closed under composition. The third axiom is Purification, which allows to assign a pure state to the composition of a system with its environment. Finally, we introduce the axiom of Pure Sharpness, stating that for every system there exists at least one pure effect occurring with unit probability on some state. For theories satisfying our four axioms, we show a constructive algorithm for diagonalizing every given state. The diagonalization result allows us to formulate a majorization criterion that captures the convertibility of states in the operational resource theory of purity, where random reversible transformations are regarded as free operations.

In Chris Heunen, Peter Selinger and Jamie Vicary: Proceedings of the 12th International Workshop on Quantum Physics and Logic (QPL 2015), Oxford, U.K., July 15-17, 2015, Electronic Proceedings in Theoretical Computer Science 195, pp. 96–115.
Published: 4th November 2015.

ArXived at: http://dx.doi.org/10.4204/EPTCS.195.8 bibtex PDF
References in reconstructed bibtex, XML and HTML format (approximated).
Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org