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

Quantum Probability and Infinite Dimensional Analysis

ON QUANTUM DE FINETTI'S THEOREMS

Vitonofrio Crismale, Yun Gang Lu

Published Feb 1, 2010• 0 citations
Publisher

Abstract

We review some new results and developments about quantum De Finetti's type theorems.
DOI
10.1142/9789814295437_0009

Related papers

One-and-a-Half Quantum de Finetti Theorems

Matthias Christandl, Robert König, Graeme Mitchison +1 more

arXiv:quant-ph/0602130•Communications in Mathematical Physics•Mar 12, 2007•222 citations

Quantum de Finetti Theorems Under Local Measurements with Applications

Fernando G. S. L. Brandão, Aram W. Harrow

Communications in Mathematical Physics•Apr 19, 2017•46 citations

On Quantum Estimation, Quantum Cloning and Finite Quantum de Finetti Theorems

Giulio Chiribella

arXiv:1010.1875•Lecture notes in computer science•Jan 1, 2011•55 citations

Asymptotic Compression of Interactive Quantum Communication using Type-Constrained de Finetti Reduction

Louis Desruisseaux, Simon Ducharme, Gurleen Padda +1 more

For many information processing tasks, de Finetti-style theorems can often simplify the analysis in worst-case input scenarios for which the task exhibits some permutation-invariance symmetry, as they can allow for a reduction from an analysis on worst-case inputs to that of i.i.d. inputs. If further information is available on the inputs, it might be advantageous to reflect this information in the de Finetti reduction. In our work, we focus on a form of such constraint, based on the type of the input. This allows us to obtain a conceptually simple proof of a new de Finetti reduction for classical probability distributions, derived from elementary properties from the method of types. We apply our constrained de Finetti reduction to the compression of quantum interactive communication protocols with classical inputs, and prove that the prior-free quantum information cost equals the worst-case input amortized quantum communication cost.

quant-pharXiv:2606.24746•Jun 24, 2026•0 citations

Analogs of de Finetti's theorem and interpretative problems of quantum mechanics

R. L. Hudson

Foundations of Physics•Oct 1, 1981•32 citations

Ground state energy of the Bose--Hubbard model with large coordination number with a polaron-type quantum de Finetti theorem

Shahnaz Farhat, Denis Périce, Sören Petrat

We consider the ground state energy of the Bose--Hubbard model on a graph with large and homogeneous coordination number. In the limit of infinite coordination number, we prove convergence of the ground state energy to the minimizer of a mean-field energy functional. This functional is obtained by averaging the hopping term over the large number of connected sites, while the interaction energy is not averaged. Hence, the resulting mean-field description is in the strong coupling regime, and is expected to provide a qualitatively correct picture of the phase diagram of the Bose--Hubbard model for large enough coordination number. For our proof, we develop a new version of a de Finetti-type theorem, which we call the polaron-type quantum de Finetti theorem, and which we expect to be a more broadly useful extension of existing quantum de Finetti results. Our theorem covers the case where the Hilbert space is a tensor product of some Hilbert space with a bosonic Fock space. This theorem is applied to the convergence of the ground state energy of the Bose--Hubbard model after reducing it to a polaron-type model.

arXiv:2603.29562•Mar 31, 2026•1 citation
For many information processing tasks, de Finetti-style theorems can often simplify the analysis in worst-case input scenarios for which the task exhibits some permutation-invariance symmetry, as they can allow for a reduction from an analysis on worst-case inputs to that of i.i.d. inputs. If further information is available on the inputs, it might be advantageous to reflect this information in the de Finetti reduction. In our work, we focus on a form of such constraint, based on the type of the input. This allows us to obtain a conceptually simple proof of a new de Finetti reduction for classical probability distributions, derived from elementary properties from the method of types. We apply our constrained de Finetti reduction to the compression of quantum interactive communication protocols with classical inputs, and prove that the prior-free quantum information cost equals the worst-case input amortized quantum communication cost.
We consider the ground state energy of the Bose--Hubbard model on a graph with large and homogeneous coordination number. In the limit of infinite coordination number, we prove convergence of the ground state energy to the minimizer of a mean-field energy functional. This functional is obtained by averaging the hopping term over the large number of connected sites, while the interaction energy is not averaged. Hence, the resulting mean-field description is in the strong coupling regime, and is expected to provide a qualitatively correct picture of the phase diagram of the Bose--Hubbard model for large enough coordination number. For our proof, we develop a new version of a de Finetti-type theorem, which we call the polaron-type quantum de Finetti theorem, and which we expect to be a more broadly useful extension of existing quantum de Finetti results. Our theorem covers the case where the Hilbert space is a tensor product of some Hilbert space with a bosonic Fock space. This theorem is applied to the convergence of the ground state energy of the Bose--Hubbard model after reducing it to a polaron-type model.