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

Exponential de Finetti Theorems for Fermionic Gaussian States

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

quant-phSubmitted Jul 28, 2026• Announced Jul 29, 2026• 1 citation• Revised Oct 2, 2026 (v2)
v1 · Jul 28, 2026v2 · Oct 2, 2026
arXivHTMLPDF

Abstract

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.

Comments
7+23 pages, 1 figure; v2 contains applications to optimisation over Fermionic Gaussian states

Related papers

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

Approximation theorems for fermionic Gaussian states

Amir-Reza Negari, Farzin Salek, Zoltán Zimborás +3 more

A recurring principle in many-body physics is that sufficiently distributed interactions or correlations lead to an effectively mean-field description. For fermionic Gaussian states, we establish a quantitative version of this principle directly at the level of Majorana covariance matrices. The main observation is that the admissibility condition for fermionic covariance matrices imposes a quantitative monogamy constraint on two-point correlations: a fixed region has only a bounded covariance budget to distribute among many disjoint regions. We use this principle in three directions. First, for quadratic fermionic Hamiltonians on finite simple graphs of high degree, we obtain product-state approximations to both the ground-state energy and the finite-temperature free energy, with error of order \(D^{-1/2}\) for \(D\)-regular graphs. Second, we prove a finite fermionic Gaussian de Finetti theorem: a \(k\)-copy Gaussian state that is \(n\)-exchangeable under graded fermionic copy permutations is \(O(k/n)\)-close in trace norm to the product of its one-copy marginal. In particular, infinite exchangeability within the Gaussian class implies exact product structure. Third, for spatial fermionic Gaussian states with exponentially clustering mutual information, we prove that the conditional mutual information across a separating buffer decays as \(O(r^{-1})\), and hence, by recoverability, the state admits an \(O(r^{-1/2})\) trace-norm approximation by a recovered state. These results show that product and de Finetti approximations and recoverability estimates for fermionic Gaussian systems can all be derived directly from covariance-level structure.

quant-pharXiv:2610.01860•Oct 2, 2026•1 citation

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

A dual de Finetti theorem

Graeme Mitchison

The quantum de Finetti theorem says that, given a symmetric state, the state obtained by tracing out some of its subsystems approximates a convex sum of power states. The more subsystems are traced out, the better this approximation becomes. Schur-Weyl duality suggests that there ought to be a dual result that applies to a unitarily invariant state rather than a symmetric state. Instead of tracing out a number of subsystems, one traces out part of every subsystem. The theorem then asserts that the resulting state approximates the fully mixed state, and the larger the dimension of the traced-out part of each subsystem, the better this approximation becomes. This paper gives a number of propositions together with their dual versions, to show how far the duality holds.

arXiv:quant-ph/0701064•Jan 11, 2007•3 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

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•34 citations
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.
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.
A recurring principle in many-body physics is that sufficiently distributed interactions or correlations lead to an effectively mean-field description. For fermionic Gaussian states, we establish a quantitative version of this principle directly at the level of Majorana covariance matrices. The main observation is that the admissibility condition for fermionic covariance matrices imposes a quantitative monogamy constraint on two-point correlations: a fixed region has only a bounded covariance budget to distribute among many disjoint regions. We use this principle in three directions. First, for quadratic fermionic Hamiltonians on finite simple graphs of high degree, we obtain product-state approximations to both the ground-state energy and the finite-temperature free energy, with error of order D−1/2D^{-1/2}D−1/2 for DDD-regular graphs. Second, we prove a finite fermionic Gaussian de Finetti theorem: a kkk-copy Gaussian state that is nnn-exchangeable under graded fermionic copy permutations is O(k/n)O(k/n)O(k/n)-close in trace norm to the product of its one-copy marginal. In particular, infinite exchangeability within the Gaussian class implies exact product structure. Third, for spatial fermionic Gaussian states with exponentially clustering mutual information, we prove that the conditional mutual information across a separating buffer decays as O(r−1)O(r^{-1})O(r−1), and hence, by recoverability, the state admits an O(r−1/2)O(r^{-1/2})O(r−1/2) trace-norm approximation by a recovered state. These results show that product and de Finetti approximations and recoverability estimates for fermionic Gaussian systems can all be derived directly from covariance-level structure.
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 says that, given a symmetric state, the state obtained by tracing out some of its subsystems approximates a convex sum of power states. The more subsystems are traced out, the better this approximation becomes. Schur-Weyl duality suggests that there ought to be a dual result that applies to a unitarily invariant state rather than a symmetric state. Instead of tracing out a number of subsystems, one traces out part of every subsystem. The theorem then asserts that the resulting state approximates the fully mixed state, and the larger the dimension of the traced-out part of each subsystem, the better this approximation becomes. This paper gives a number of propositions together with their dual versions, to show how far the duality holds.
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.
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.