A most compendious and facile quantum de Finetti theorem
Preprint
Abstract
In its most basic form, the finite quantum de Finetti theorem states that the reduced k-partite density operator of an n-partite symmetric state can be approximated by a convex combination of k-fold product states. Variations of this result include Renner's "exponential" approximation by "almost-product" states, a theorem which deals with certain triples of representations of the unitary group, and D'Cruz et al.'s result for infinite-dimensional systems. We show how these theorems follow from a single, general de Finetti theorem for representations of symmetry groups, each instance corresponding to a particular choice of symmetry group and representation of that group. This gives some insight into the nature of the set of approximating states, and leads to some new results, including an exponential theorem for infinite-dimensional systems.Keywords
All Related Versions
This publication has 4 references indexed in Scilit:
- Lie Groups Beyond an Introduction1996
- Linear Analysis and Representation Theory1973
- Introduction to Lie Algebras and Representation Theory1972
- IV. A most compendious and facile method for constructing the logarithms, exemplified and demonstrated from the nature of numbers, without any regards to the hyperbola, with a speedy method for finding the number from the logarithm givenPhilosophical Transactions of the Royal Society of London, 1695