A most compendious and facile quantum de Finetti theorem

25Citations
Citations of this article
26Readers
Mendeley users who have this article in their library.

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 the result of D'Cruz [e-print quant-ph/0606139; Phys. Rev. Lett. 98, 160406 (2007)] 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. © 2009 American Institute of Physics.

Cite

CITATION STYLE

APA

König, R., & Mitchison, G. (2009). A most compendious and facile quantum de Finetti theorem. Journal of Mathematical Physics, 50(1). https://doi.org/10.1063/1.3049751

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free