A most compendious and facile quantum de Finetti theorem

Details A most compendious and facile quantum de Finetti theorem A most compendious and facile quantum de Finetti theorem

2007-03-22

arxiv.org/abs/quant-ph/0703210v1

J. Math. Phys. 50, 012105 (2009)

Physics

Quantum Physics

17 pages, 3 figures

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

A most compendious and facile quantum de Finetti theorem does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A most compendious and facile quantum de Finetti theorem, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A most compendious and facile quantum de Finetti theorem will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-168761