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:2610.25280

De Finetti Structures in Networks of Quantum Systems

Gavin Hull, Marco Merkli

math-phquant-phSubmitted Oct 18, 2026• Announced Oct 20, 2026• 0 citations
arXivHTMLPDF

Abstract

Consider $N$ identical quantum systems at the vertices of a graph, interacting via pairwise edge couplings. We designate $K$ vertices as a system of interest $\mathrm S$ and the remaining $N-K$ as a reservoir $\mathrm R$. Under generic connectivity assumptions between $\mathrm S$ and $\mathrm R$, we show that for $N\to\infty$, the reduced state of $\mathrm S$ converges to a convex combination of symmetric product states of $K$ single-vertex density matrices -- called a de Finetti representation. Unlike in standard derivations for symmetric (exchangeable) systems, we establish de Finetti representations for quantum networks, which are inherently non-exchangeable. We construct the representations explicitly and quantify the convergence rate. We show that Erdős--Rényi random graphs exhibit the de Finetti structure: as the reservoir grows, the reduced state of any fixed finite subgraph converges almost surely to an explicit deterministic product state. As applications, we establish a general area law for the entanglement entropy of $\mathrm S$, analyze mean-field and fluctuation scalings of the $\mathrm S$-$\mathrm R$ interaction, and illustrate our results on qubit networks. We also derive quantitative convergence estimates for information-theoretic quantities, including von Neumann entropy, mutual information, and entanglement within $\mathrm S$ and between $\mathrm S$ and $\mathrm R$.

Comments
37 pages, 3 figures

Related papers

Flexible constrained de Finetti reductions and applications

Cécilia Lancien, Andreas Winter

De Finetti theorems show how sufficiently exchangeable states are well-approximated by convex combinations of independent identically distributed states. Recently, it was shown that in many quantum information applications, a more relaxed de Finetti reduction (i.e., only a matrix inequality between the symmetric state and one of the de Finetti forms) is enough and that it leads to more concise and elegant arguments. Here we show several uses and general flexible applicability of a constrained de Finetti reduction in quantum information theory, which was recently discovered by Duan, Severini, and Winter. In particular, we show that the technique can accommodate other symmetries commuting with the permutation action and permutation-invariant linear constraints. We then demonstrate that, in some cases, it is also fruitful with convex constraints, in particular separability in a bipartite setting. This is a constraint particularly interesting in the context of the complexity class QMA(2) of interactive quantum Merlin-Arthur games with unentangled provers, and our results relate to the soundness gap amplification of QMA(2) protocols by parallel repetition. It is also relevant for the regularization of certain entropic channel parameters. As an aside, we present an alternative way of attacking this problem, relying on an entanglement measure theory rather than the de Finetti approach. Finally, we explore an extension to infinite-dimensional systems, which usually pose inherent problems to de Finetti techniques in the quantum case.

arXiv:1605.09013•Journal of Mathematical Physics•Sep 1, 2017•15 citations

A most compendious and facile quantum de Finetti theorem

Robert König, Graeme Mitchison

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.

arXiv:quant-ph/0703210•Journal of Mathematical Physics•Jan 1, 2009•29 citations

A de Finetti representation for finite symmetric quantum states

Robert König, Renato Renner

Consider a symmetric quantum state on an n-fold product space, that is, the state is invariant under permutations of the n subsystems. We show that, conditioned on the outcomes of an informationally complete measurement applied to a number of subsystems, the state in the remaining subsystems is close to having product form. This immediately generalizes the so-called de Finetti representation to the case of finite symmetric quantum states.

arXiv:quant-ph/0410229•Journal of Mathematical Physics•Dec 1, 2005•124 citations

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

Liuhang Ye, Bjarne Bergh, Nilanjana Datta

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

quant-pharXiv:2609.40343•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

Remarks on the Quantum de Finetti Theorem for Bosonic Systems

Mathieu Lewin B, Phan Thành Nam, Nicolas Rougerie

The quantum de Finetti theorem asserts that the |$k$|-body density matrices of an |$N$|-body bosonic state approach a convex combination of Hartree states (pure tensor powers) when |$N$| is large and |$k$| fixed. In this note, we review a construction due to Christandl et al. [8] valid for finite-dimensional Hilbert spaces, which gives a quantitative version of the theorem. We first propose a variant of their proof that leads to a slightly improved estimate. Next we provide an alternative proof of an explicit formula due to Chiribella [7], which gives the density matrices of the constructed state as a function of those of the original state.

arXiv:1310.2200•Applied Mathematics Research eXpress•Oct 9, 2014•34 citations
Consider NNN identical quantum systems at the vertices of a graph, interacting via pairwise edge couplings. We designate KKK vertices as a system of interest S\mathrm SS and the remaining N−KN-KN−K as a reservoir R\mathrm RR. Under generic connectivity assumptions between S\mathrm SS and R\mathrm RR, we show that for N→∞N\to\inftyN→∞, the reduced state of S\mathrm SS converges to a convex combination of symmetric product states of KKK single-vertex density matrices -- called a de Finetti representation. Unlike in standard derivations for symmetric (exchangeable) systems, we establish de Finetti representations for quantum networks, which are inherently non-exchangeable. We construct the representations explicitly and quantify the convergence rate. We show that Erdős--Rényi random graphs exhibit the de Finetti structure: as the reservoir grows, the reduced state of any fixed finite subgraph converges almost surely to an explicit deterministic product state. As applications, we establish a general area law for the entanglement entropy of S\mathrm SS, analyze mean-field and fluctuation scalings of the S\mathrm SS-R\mathrm RR interaction, and illustrate our results on qubit networks. We also derive quantitative convergence estimates for information-theoretic quantities, including von Neumann entropy, mutual information, and entanglement within S\mathrm SS and between S\mathrm SS and R\mathrm RR.
De Finetti theorems show how sufficiently exchangeable states are well-approximated by convex combinations of independent identically distributed states. Recently, it was shown that in many quantum information applications, a more relaxed de Finetti reduction (i.e., only a matrix inequality between the symmetric state and one of the de Finetti forms) is enough and that it leads to more concise and elegant arguments. Here we show several uses and general flexible applicability of a constrained de Finetti reduction in quantum information theory, which was recently discovered by Duan, Severini, and Winter. In particular, we show that the technique can accommodate other symmetries commuting with the permutation action and permutation-invariant linear constraints. We then demonstrate that, in some cases, it is also fruitful with convex constraints, in particular separability in a bipartite setting. This is a constraint particularly interesting in the context of the complexity class QMA(2) of interactive quantum Merlin-Arthur games with unentangled provers, and our results relate to the soundness gap amplification of QMA(2) protocols by parallel repetition. It is also relevant for the regularization of certain entropic channel parameters. As an aside, we present an alternative way of attacking this problem, relying on an entanglement measure theory rather than the de Finetti approach. Finally, we explore an extension to infinite-dimensional systems, which usually pose inherent problems to de Finetti techniques in the quantum case.
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.
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.
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.
The quantum de Finetti theorem asserts that the |kkk|-body density matrices of an |NNN|-body bosonic state approach a convex combination of Hartree states (pure tensor powers) when |NNN| is large and |kkk| fixed. In this note, we review a construction due to Christandl et al. [8] valid for finite-dimensional Hilbert spaces, which gives a quantitative version of the theorem. We first propose a variant of their proof that leads to a slightly improved estimate. Next we provide an alternative proof of an explicit formula due to Chiribella [7], which gives the density matrices of the constructed state as a function of those of the original state.