Welcome to the new version of CaltechAUTHORS. Login is currently restricted to library staff. If you notice any issues, please email coda@library.caltech.edu
Published January 2009 | Published
Journal Article Open

A most compendious and facile quantum de Finetti theorem

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 et al. [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.

Additional Information

© 2009 American Institute of Physics. Received 24 March 2008; accepted 24 November 2008; published 12 January 2009. We thank Matthias Christandl, Ignacio Cirac, Tobias Osborne, and Renato Renner for helpful discussions. We also thank the reviewers for their comments. This work was supported by the EU project RESQ (Grant No. IST-2001-37559) and the European Commission through the FP6-FET Integrated Project SCALA, Grant No. CT-015714. R.K. acknowledges support from NSF Grant No. PHY-0456720 and PHY-0803371. G.M. acknowledges support from the project PROSECCO (Grant No. IST-2001-39227) of the IST-FET programme of the EC.

Attached Files

Published - Koenig2009p27110.10631.3049751.pdf

Files

Koenig2009p27110.10631.3049751.pdf
Files (344.7 kB)
Name Size Download all
md5:4055d2ed7cb621741a7bfc17510e627f
344.7 kB Preview Download

Additional details

Created:
August 20, 2023
Modified:
October 18, 2023