A most compendious and facile quantum de Finetti theorem

dc.creatorKoenig, Robert
dc.creatorMitchison, Graeme
dc.date2007-03-22
dc.date.accessioned2026-07-07T12:28:09Z
dc.date.available2026-07-07T12:28:09Z
dc.descriptionIn 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.
dc.description17 pages, 3 figures
dc.identifierhttps://arxiv.org/abs/quant-ph/0703210
dc.identifierhttp://arxiv.org/abs/quant-ph/0703210
dc.identifierJ. Math. Phys. 50, 012105 (2009)
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/215444
dc.subjectQuantum Physics
dc.titleA most compendious and facile quantum de Finetti theorem
dc.typetext

Files

Collections