Explorer›Quantum Computing›Quantum Physics
Research PaperResearchia:202610.01072

Quantum de Finetti theorems for states and channels in any distance measure

Liuhang Ye

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...

Submitted: October 1, 2026Subjects: Quantum Physics; Quantum Computing

Description / Details

Standard finite quantum de Finetti theorems approximate the kk-system marginals of permutation-invariant states of nn-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/nk/n error bound in max-relative entropy improves on the previously best known k2/nk^2/n 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 N(n):A⊗n→B⊗nN^{(n)}:A^{\otimes n}\to B^{\otimes n}, where dA=dim⁡Ad_A=\dim A, we prove that the kk-system reduced channel is CP-dominated by a mixture of tensor-power channels with error O(k/n)O(k/\sqrt{n}) 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 rr defects, the representation error is at most poly(n)(2dA4k3/(nr2))(r+1)/2\mathrm{poly}(n)\bigl(2d_A^4k^3/(nr^2)\bigr)^{(r+1)/2} and decays exponentially in nn for a suitable choice of parameters rr and kk.


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!

Access Paper
View Source PDF
Submission Info
Date:
Oct 1, 2026
Topic:
Quantum Computing
Area:
Quantum Physics
Comments:
0
Bookmark