Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2609.40343

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

Liuhang Ye, Bjarne Bergh, Nilanjana Datta

quant-phSubmitted Sep 30, 2026• Announced Oct 1, 2026• 0 citations
arXivHTMLPDF

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/n$ error bound in max-relative entropy improves on the previously best known $k^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^{\otimes n}\to B^{\otimes n}$, where $d_A=\dim A$, we prove that the $k$-system reduced channel is CP-dominated by a mixture of tensor-power channels with error $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 $r$ defects, the representation error is at most $\mathrm{poly}(n)\bigl(2d_A^4k^3/(nr^2)\bigr)^{(r+1)/2}$ and decays exponentially in $n$ for a suitable choice of parameters $r$ and $k$.

AI Summary

Finite quantum de Finetti theorems usually approximate symmetric-state marginals in trace distance. This paper asks whether analogous representations hold in stronger distinguishability measures and whether channel versions can avoid the exponential-in-$k$ loss from converting Choi-state trace distance to diamond norm. For a permutation-invariant $n$-partite state of local dimension $d$, it proves $(1-\varepsilon)\rho^{(k)}\leq\int\omega_\sigma^{(k,r)}\,d\mu(\sigma)$, where the atoms are almost-iid with at most $r$ defects and $\varepsilon\leq(n-k+1)^{d^2-1}e^{-(n-k)(r+1)/n}$. For $r=0$, the atoms are iid and $\varepsilon\leq d^2k/n$, improving the previous $k^2/n$ max-relative-entropy scaling at fixed dimension, including classically. Operator domination yields bounds for all Schatten norms and suitable divergences, including data-processing Rényi divergences. For permutation-covariant channels, the reduced channel is CP-dominated by an iid-channel mixture with error $O(k/\sqrt n)$ at fixed dimensions and polynomial dimension dependence; diamond distance is at most twice this error. Without no-signalling, reduction means supplying maximally mixed discarded inputs. Under no-signalling, an almost-iid-channel representation has error at most $4(n+1)^{3d_A^2d_B^2/2-1}[2d_A^4k^3/(nr^2)]^{(r+1)/2}$. The proofs compute Haar-averaged defect-sector operator identities. Channel representations additionally enforce trace-preserving Choi marginals through completion constructions; the exponential result uses constrained Haar integration and marginal repair preserving almost-iid support. Almost-iid channels are defined through their Choi states. The standard channel bound vanishes for $k=o(\sqrt n)$. The exponential bound requires substantial discarding and does not cover retaining nearly all systems; that regime remains open.

No sign of AI-generated textAI use disclosed
GPT-6 Astra later helped improve the estimation of several error bounds in the appendices, and Claude Fable 5.1 was used to improve parts of the introduction.

Error found: The corollary's purified-distance smoothing bound is false: for pure ρ and σ=ρ, D_max^ε(ρ‖ρ)=log(1−ε²)>log(1−ε), so its correction term must instead be log(1−ε²). The smoothing proof incorrectly asserts that λρ is feasible without restricting λ relative to the smoothing radius; under purified distance, feasibility requires √(1−λ)≤ε.

Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.

Comments
52 pages

Related papers

Robust classical and quantum communication over almost-iid channels

Liuhang Ye, Bjarne Bergh, Nilanjana Datta

The independent and identically distributed (iid) paradigm for asymptotic communication through quantum channels describes $n$ uses of a channel $Φ$ by $Φ^{\otimes n}$. Since exact tensor-power behaviour is an idealization, we ask whether the asymptotic capacities of $Φ$ remain achievable for channel sequences that are almost-iid along $Φ$. We consider sequences of Choi-almost-iid channels whose normalized Choi states are Mazzola-Sutter-Renner (MSR) almost-iid along the normalized Choi state of $Φ$, with defect parameters $r_n=o(n)$. In Renner's exponential de Finetti theorem for quantum states, almost-iid states appear in the approximating mixture and motivate the MSR almost-iid class. Choi-almost-iid channels play the corresponding role in an exponential de Finetti theorem for quantum channels established in a companion paper. In this paper, we prove that the universal unassisted classical and quantum capacities of the class of Choi-almost-iid channels along $Φ$ equal those of the channel $Φ$. Here universality is within this class: for each rate below the relevant capacity, a code sequence depending on $Φ$ and the rate, but not on the particular channel sequence, achieves vanishing error for every sequence in the class.

quant-pharXiv:2610.00442•Oct 1, 2026•0 citations

Fixed points in de Finetti hierarchies

Gereon Kossmann, Julius A. Zeiss

De Finetti theorems convert permutation symmetry into approximate mixtures of product states and thereby justify a wide range of reductions in classical and quantum statistics. In this work we study de Finetti hierarchies in which the feasible states are additionally constrained to be fixed points of quantum channels, a condition that subsumes invariance under arbitrary compact symmetry groups. Combining the mean-ergodic theorem with the structure theory of conditional expectations, we prove a tight bound on the entanglement-assisted classical capacity of the dual of a conditional expectation, block-wise distortion bounds for informationally complete measurements adapted to fixed point algebras, and an exact type-based refinement of the chain rule for permutation-invariant states. From these tools we derive several de Finetti theorems: a double-sided extension theorem with $O\left(\sqrt{\log n}/n\right)$ convergence, an interpolation theorem whose dimension dependence is governed solely by the block structure of the fixed point algebras and which recovers the dimension-independent classical behavior for maximal tori, and a Bose-symmetric variant. Exploiting Schur-Weyl duality and Gelfand-Tsetlin bases, we further show that the rounding scheme producing certifiably good separable inner approximations for (constrained) separability problems can be implemented in time polynomial in $1/ε$ for fixed local dimensions, complementing the known efficient outer hierarchies. Applications to bilinear optimization under symmetries and to approximate quantum error correction are discussed.

quant-pharXiv:2607.23689•Jul 28, 2026•0 citations

Optimal Quantum de Finetti Theorems via Argmax Rounding

Fernando Granha Jeronimo, Pei Wu, Haochen Xu

We prove optimal finite quantum de Finetti upper bounds. Given a bosonic state $ρ_N\in D(\mathrm{Sym}^N(\mathbb C^d))$, there is a probability measure $ν$ on the unit sphere such that \[ \left\| ρ_N^{(2)}-\int |u\rangle\langle u|^{\otimes 2}\,dν(u) \right\|_1 \le \frac{\sqrt{d-1}}{N-1}. \] By purification, the bosonic theorem also gives the optimal $O(d/N)$ upper bound for arbitrary exchangeable states. These results settle the dimension dependence left open by Christandl, König, Mitchison, and Renner (CMP 2007). The proof casts de Finetti approximation as sum-of-squares rounding and applies the argmax method of Jeronimo, Wu, and Xu (manuscript 2026). More generally, $t$-site marginals satisfy $O(t\sqrt d/N)$ bosonic and $O(td/N)$ permutation-invariant bounds. Our proof formulates de Finetti approximation as the integrality gap of a symmetric-extension semidefinite program and rounds an optimum by the argmax principle. The sharp bounds have several consequences. For every fixed $\varepsilon\in(0,1)$, we construct a channel with input dimension $D=\exp(O_\varepsilon(\sqrt d\log d))=\exp(o(d))$ whose outputs are $\varepsilon$-close to separable states of local dimension $d$ and whose image contains every such separable state, thereby refuting Watrous's disentangler conjecture. We also obtain deterministic $\exp(\widetilde O(\sqrt d/\varepsilon))$-time algorithms for explicit Best Separable State without perfect completeness and for trace-distance separability testing. Finally, spectral truncation gives the first dimension-free bosonic de Finetti theorem in Hilbert--Schmidt distance, with the optimal rate $Θ(N^{-1/2})$ when the dimension may grow.

quant-pharXiv:2608.02590•Aug 4, 2026•5 citations

Quantum de Finetti theorem in phase-space representation

Anthony Leverrier, Nicolas J. Cerf

The quantum versions of de Finetti's theorem derived so far express the convergence of $n$-partite symmetric states, i.e., states that are invariant under permutations of their $n$ parties, toward probabilistic mixtures of independent and identically distributed (IID) states of the form ${\ensuremath{\sigma}}^{\ensuremath{\bigotimes}n}$. Unfortunately, these theorems only hold in finite-dimensional Hilbert spaces, and their direct generalization to infinite-dimensional Hilbert spaces is known to fail. Here, we address this problem by considering invariance under orthogonal transformations in phase space instead of permutations in state space, which leads to a quantum de Finetti theorem particularly relevant to continuous-variable systems. Specifically, an $n$-mode bosonic state that is invariant with respect to this continuous symmetry in phase space is proven to converge toward a probabilistic mixture of IID Gaussian states (actually, $n$ identical thermal states).

arXiv:0904.4862•Physical Review A•Jul 28, 2009•13 citations

Exponential de Finetti Theorems for Fermionic Gaussian States

Jędrzej Burkat, Michał Studziński, Sergii Strelchuk

We prove an exponential variant of the Gaussian de Finetti theorem: the subsystems of permutation-invariant, free-fermionic Gaussian states are well approximated by convex combinations of almost-i.i.d. states that are Gaussian on subsets of their parts. Our result provides an error bound between the original state and its approximants that decays exponentially in the number of unconstrained parts, becoming super-exponential when the subsystem under consideration is small. The dependence of our bound on the local Hilbert space dimension is polylogarithmic, giving an exponential improvement over the standard de Finetti theorem of [Nat. Phys. 3, 645-649]. Previous works considered Gaussian-symmetric states, which are supported on the trivial irrep of the tensor matchgate representation. We extend these results to the broader class of Gaussian-invariant states, which contains, for example, i.i.d. copies of single-replica mixed Gaussian states. We show that Gaussian-invariant states are precisely the partial traces of Gaussian-symmetric states on locally enlarged replicas and always admit a purification into a larger Gaussian-symmetric state. As an application, we derive explicit convergence bounds for a hierarchy of convex relaxations of polynomial optimisation over fermionic Gaussian states. For variational energy minimisation, the hierarchy gives lower bounds converging to the global Gaussian minimum. Combined with upper bounds from Gaussian trial states, these bounds quantify how far a variational calculation can be from the best energy attainable within the Gaussian family.

quant-pharXiv:2607.25779•Jul 29, 2026•1 citation

Studying Stabilizer de Finetti Theorems and Possible Applications in Quantum Information Processing

Paula Belzig

Symmetries are of fundamental interest in many areas of science. In quantum information theory, if a quantum state is invariant under permutations of its subsystems, it is a well-known and widely used result that its marginal can be approximated by a mixture of tensor powers of a state on a single subsystem. Applications of this quantum de Finetti theorem range from quantum key distribution (QKD) to quantum state tomography and numerical separability tests. Recently, it has been discovered by Gross, Nezami and Walter that a similar observation can be made for a larger symmetry group than permutations: states that are invariant under stochastic orthogonal symmetry are approximated by tensor powers of stabilizer states, with an exponentially smaller overhead than previously possible. This naturally raises the question if similar improvements could be found for applications where this symmetry appears (or can be enforced). Here, two such examples are investigated.

arXiv:2403.10592•Mar 15, 2024•7 citations
Standard finite quantum de Finetti theorems approximate the kkk-system marginals of permutation-invariant states of nnn-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/nk/n error bound in max-relative entropy improves on the previously best known k2/nk^2/nk2/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}N(n):A⊗n→B⊗n, where dA=dim⁡Ad_A=\dim AdA​=dimA, we prove that the kkk-system reduced channel is CP-dominated by a mixture of tensor-power channels with error O(k/n)O(k/\sqrt{n})O(k/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 rrr 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}poly(n)(2dA4​k3/(nr2))(r+1)/2 and decays exponentially in nnn for a suitable choice of parameters rrr and kkk.
Finite quantum de Finetti theorems usually approximate symmetric-state marginals in trace distance. This paper asks whether analogous representations hold in stronger distinguishability measures and whether channel versions can avoid the exponential-in-kkk loss from converting Choi-state trace distance to diamond norm.
For a permutation-invariant nnn-partite state of local dimension ddd, it proves (1−ε)ρ(k)≤∫ωσ(k,r) dμ(σ)(1-\varepsilon)\rho^{(k)}\leq\int\omega_\sigma^{(k,r)}\,d\mu(\sigma)(1−ε)ρ(k)≤∫ωσ(k,r)​dμ(σ), where the atoms are almost-iid with at most rrr defects and ε≤(n−k+1)d2−1e−(n−k)(r+1)/n\varepsilon\leq(n-k+1)^{d^2-1}e^{-(n-k)(r+1)/n}ε≤(n−k+1)d2−1e−(n−k)(r+1)/n. For r=0r=0r=0, the atoms are iid and ε≤d2k/n\varepsilon\leq d^2k/nε≤d2k/n, improving the previous k2/nk^2/nk2/n max-relative-entropy scaling at fixed dimension, including classically. Operator domination yields bounds for all Schatten norms and suitable divergences, including data-processing Rényi divergences.
For permutation-covariant channels, the reduced channel is CP-dominated by an iid-channel mixture with error O(k/n)O(k/\sqrt n)O(k/n​) at fixed dimensions and polynomial dimension dependence; diamond distance is at most twice this error. Without no-signalling, reduction means supplying maximally mixed discarded inputs. Under no-signalling, an almost-iid-channel representation has error at most 4(n+1)3dA2dB2/2−1[2dA4k3/(nr2)](r+1)/24(n+1)^{3d_A^2d_B^2/2-1}[2d_A^4k^3/(nr^2)]^{(r+1)/2}4(n+1)3dA2​dB2​/2−1[2dA4​k3/(nr2)](r+1)/2.
The proofs compute Haar-averaged defect-sector operator identities. Channel representations additionally enforce trace-preserving Choi marginals through completion constructions; the exponential result uses constrained Haar integration and marginal repair preserving almost-iid support. Almost-iid channels are defined through their Choi states. The standard channel bound vanishes for k=o(n)k=o(\sqrt n)k=o(n​). The exponential bound requires substantial discarding and does not cover retaining nearly all systems; that regime remains open.
The independent and identically distributed (iid) paradigm for asymptotic communication through quantum channels describes nnn uses of a channel ΦΦΦ by Φ⊗nΦ^{\otimes n}Φ⊗n. Since exact tensor-power behaviour is an idealization, we ask whether the asymptotic capacities of ΦΦΦ remain achievable for channel sequences that are almost-iid along ΦΦΦ. We consider sequences of Choi-almost-iid channels whose normalized Choi states are Mazzola-Sutter-Renner (MSR) almost-iid along the normalized Choi state of ΦΦΦ, with defect parameters rn=o(n)r_n=o(n)rn​=o(n). In Renner's exponential de Finetti theorem for quantum states, almost-iid states appear in the approximating mixture and motivate the MSR almost-iid class. Choi-almost-iid channels play the corresponding role in an exponential de Finetti theorem for quantum channels established in a companion paper. In this paper, we prove that the universal unassisted classical and quantum capacities of the class of Choi-almost-iid channels along ΦΦΦ equal those of the channel ΦΦΦ. Here universality is within this class: for each rate below the relevant capacity, a code sequence depending on ΦΦΦ and the rate, but not on the particular channel sequence, achieves vanishing error for every sequence in the class.
De Finetti theorems convert permutation symmetry into approximate mixtures of product states and thereby justify a wide range of reductions in classical and quantum statistics. In this work we study de Finetti hierarchies in which the feasible states are additionally constrained to be fixed points of quantum channels, a condition that subsumes invariance under arbitrary compact symmetry groups. Combining the mean-ergodic theorem with the structure theory of conditional expectations, we prove a tight bound on the entanglement-assisted classical capacity of the dual of a conditional expectation, block-wise distortion bounds for informationally complete measurements adapted to fixed point algebras, and an exact type-based refinement of the chain rule for permutation-invariant states. From these tools we derive several de Finetti theorems: a double-sided extension theorem with O(log⁡n/n)O\left(\sqrt{\log n}/n\right)O(logn​/n) convergence, an interpolation theorem whose dimension dependence is governed solely by the block structure of the fixed point algebras and which recovers the dimension-independent classical behavior for maximal tori, and a Bose-symmetric variant. Exploiting Schur-Weyl duality and Gelfand-Tsetlin bases, we further show that the rounding scheme producing certifiably good separable inner approximations for (constrained) separability problems can be implemented in time polynomial in 1/ε1/ε1/ε for fixed local dimensions, complementing the known efficient outer hierarchies. Applications to bilinear optimization under symmetries and to approximate quantum error correction are discussed.
We prove optimal finite quantum de Finetti upper bounds. Given a bosonic state ρN∈D(SymN(Cd))ρ_N\in D(\mathrm{Sym}^N(\mathbb C^d))ρN​∈D(SymN(Cd)), there is a probability measure ννν on the unit sphere such that ∥ρN(2)−∫∣u⟩⟨u∣⊗2 dν(u)∥1≤d−1N−1. \left\| ρ_N^{(2)}-\int |u\rangle\langle u|^{\otimes 2}\,dν(u) \right\|_1 \le \frac{\sqrt{d-1}}{N-1}. ​ρN(2)​−∫∣u⟩⟨u∣⊗2dν(u)​1​≤N−1d−1​​. By purification, the bosonic theorem also gives the optimal O(d/N)O(d/N)O(d/N) upper bound for arbitrary exchangeable states. These results settle the dimension dependence left open by Christandl, König, Mitchison, and Renner (CMP 2007). The proof casts de Finetti approximation as sum-of-squares rounding and applies the argmax method of Jeronimo, Wu, and Xu (manuscript 2026). More generally, ttt-site marginals satisfy O(td/N)O(t\sqrt d/N)O(td​/N) bosonic and O(td/N)O(td/N)O(td/N) permutation-invariant bounds. Our proof formulates de Finetti approximation as the integrality gap of a symmetric-extension semidefinite program and rounds an optimum by the argmax principle. The sharp bounds have several consequences. For every fixed ε∈(0,1)\varepsilon\in(0,1)ε∈(0,1), we construct a channel with input dimension D=exp⁡(Oε(dlog⁡d))=exp⁡(o(d))D=\exp(O_\varepsilon(\sqrt d\log d))=\exp(o(d))D=exp(Oε​(d​logd))=exp(o(d)) whose outputs are ε\varepsilonε-close to separable states of local dimension ddd and whose image contains every such separable state, thereby refuting Watrous's disentangler conjecture. We also obtain deterministic exp⁡(O~(d/ε))\exp(\widetilde O(\sqrt d/\varepsilon))exp(O(d​/ε))-time algorithms for explicit Best Separable State without perfect completeness and for trace-distance separability testing. Finally, spectral truncation gives the first dimension-free bosonic de Finetti theorem in Hilbert--Schmidt distance, with the optimal rate Θ(N−1/2)Θ(N^{-1/2})Θ(N−1/2) when the dimension may grow.
The quantum versions of de Finetti's theorem derived so far express the convergence of nnn-partite symmetric states, i.e., states that are invariant under permutations of their nnn parties, toward probabilistic mixtures of independent and identically distributed (IID) states of the form ${\ensuremath{\sigma}}^{\ensuremath{\bigotimes}n}$. Unfortunately, these theorems only hold in finite-dimensional Hilbert spaces, and their direct generalization to infinite-dimensional Hilbert spaces is known to fail. Here, we address this problem by considering invariance under orthogonal transformations in phase space instead of permutations in state space, which leads to a quantum de Finetti theorem particularly relevant to continuous-variable systems. Specifically, an nnn-mode bosonic state that is invariant with respect to this continuous symmetry in phase space is proven to converge toward a probabilistic mixture of IID Gaussian states (actually, nnn identical thermal states).
We prove an exponential variant of the Gaussian de Finetti theorem: the subsystems of permutation-invariant, free-fermionic Gaussian states are well approximated by convex combinations of almost-i.i.d. states that are Gaussian on subsets of their parts. Our result provides an error bound between the original state and its approximants that decays exponentially in the number of unconstrained parts, becoming super-exponential when the subsystem under consideration is small. The dependence of our bound on the local Hilbert space dimension is polylogarithmic, giving an exponential improvement over the standard de Finetti theorem of [Nat. Phys. 3, 645-649]. Previous works considered Gaussian-symmetric states, which are supported on the trivial irrep of the tensor matchgate representation. We extend these results to the broader class of Gaussian-invariant states, which contains, for example, i.i.d. copies of single-replica mixed Gaussian states. We show that Gaussian-invariant states are precisely the partial traces of Gaussian-symmetric states on locally enlarged replicas and always admit a purification into a larger Gaussian-symmetric state. As an application, we derive explicit convergence bounds for a hierarchy of convex relaxations of polynomial optimisation over fermionic Gaussian states. For variational energy minimisation, the hierarchy gives lower bounds converging to the global Gaussian minimum. Combined with upper bounds from Gaussian trial states, these bounds quantify how far a variational calculation can be from the best energy attainable within the Gaussian family.
Symmetries are of fundamental interest in many areas of science. In quantum information theory, if a quantum state is invariant under permutations of its subsystems, it is a well-known and widely used result that its marginal can be approximated by a mixture of tensor powers of a state on a single subsystem. Applications of this quantum de Finetti theorem range from quantum key distribution (QKD) to quantum state tomography and numerical separability tests. Recently, it has been discovered by Gross, Nezami and Walter that a similar observation can be made for a larger symmetry group than permutations: states that are invariant under stochastic orthogonal symmetry are approximated by tensor powers of stabilizer states, with an exponentially smaller overhead than previously possible. This naturally raises the question if similar improvements could be found for applications where this symmetry appears (or can be enforced). Here, two such examples are investigated.