One-and-a-half quantum de finetti theorems

123Citations
Citations of this article
82Readers
Mendeley users who have this article in their library.
Get full text

Abstract

When n - k systems of an n-partite permutation-invariant state are traced out, the resulting state can be approximated by a convex combination of tensor product states. This is the quantum de Finetti theorem. In this paper, we show that an upper bound on the trace distance of this approximation is given by 2\frackd2 , where d is the dimension of the individual system, thereby improving previously known bounds. Our result follows from a more general approximation theorem for representations of the unitary group. Consider a pure state that lies in the irreducible representation Uu+v ⊂ U Uu ⊗ Uvof the unitary group U(d), for highest weights μ, ν and μ + ν. Let ξμ be the state obtained by tracing out U ν. Then ξμ is close to a convex combination of the coherent states Uμ(g)|vμ〉, where g ε U(d) and |vμ〉 is the highest weight vector in U μ. For the class of symmetric Werner states, which are invariant under both the permutation and unitary groups, we give a second de Finetti-style theorem (our "half" theorem). It arises from a combinatorial formula for the distance of certain special symmetric Werner states to states of fixed spectrum, making a connection to the recently defined shifted Schur functions [1]. This formula also provides us with useful examples that allow us to conclude that finite quantum de Finetti theorems (unlike their classical counterparts) must depend on the dimension d. The last part of this paper analyses the structure of the set of symmetric Werner states and shows that the product states in this set do not form a polytope in general. © Springer-Verlag 2007.

Cite

CITATION STYLE

APA

Christandl, M., König, R., Mitchison, G., & Renner, R. (2007). One-and-a-half quantum de finetti theorems. Communications in Mathematical Physics, 273(2), 473–498. https://doi.org/10.1007/s00220-007-0189-3

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