Quantum de Finetti theorems for states and channels in any distance measure
Abstract
Standard finite quantum de Finetti theorems approximate the $k$-system marginals of permutation-invariant states of $n$-systems by mixtures of independent and identically distributed (iid) states, usually in trace distance. We prove both standard and Renner's exponential de Finetti theorems in the stronger form of operator inequalities, implying bounds in every Schatten norm and for every quantum Rényi divergence satisfying data processing. In the standard case, for fixed local dimension, our $k...
Description / Details
Standard finite quantum de Finetti theorems approximate the -system marginals of permutation-invariant states of -systems by mixtures of independent and identically distributed (iid) states, usually in trace distance. We prove both standard and Renner's exponential de Finetti theorems in the stronger form of operator inequalities, implying bounds in every Schatten norm and for every quantum Rényi divergence satisfying data processing. In the standard case, for fixed local dimension, our error bound in max-relative entropy improves on the previously best known scaling, even in the classical setting. The operator-inequality approach is particularly suited to study channel de Finetti representations because operator order between Choi states is equivalent to completely positive (CP) order between the underlying channels. For permutation-covariant channels , where , we prove that the -system reduced channel is CP-dominated by a mixture of tensor-power channels with error and polynomial dependence on the local dimensions, addressing a question raised by Berta et al. [Math. Program. 194, 781-829 (2022)]. Under the no-signalling condition, we also prove an exponential channel de Finetti theorem where the approximating mixture consists of Choi-almost-iid channels, whose normalized Choi states are almost-iid in the sense of Mazzola-Sutter-Renner. In the case of defects, the representation error is at most and decays exponentially in for a suitable choice of parameters and .
Source: arXiv:2609.40343v1 - http://arxiv.org/abs/2609.40343v1 PDF: https://arxiv.org/pdf/2609.40343v1 Original Link: http://arxiv.org/abs/2609.40343v1
Please sign in to join the discussion.
No comments yet. Be the first to share your thoughts!
Oct 1, 2026
Quantum Computing
Quantum Physics
0