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

Sample complexity of learning fermionic and bosonic Gaussian states with single-copy and entangled measurements

Ron Rubin

Published Nov 10, 2026• 0 citations
arXivHTMLPDF

Abstract

With single-copy measurements, every mixed fermionic Gaussian state on $m$ modes, pure modes included, is learned to trace distance $ε$ from $Θ(m^3/ε^2)$ copies, with no logarithmic factor, against the known $Θ(m^2/ε^2)$ for collective measurements. We prove the upper bound, resolving Conjecture 10.1 of arXiv:2609.23189 (lower bound for $ε\le1/3600$), and fill most open entries of the sample-complexity table of fermionic and bosonic Gaussian states, for single-copy, $k$-copy and collective measurements. The single-copy measurement's noise is matched to the metric at every occupation scale. With blocks of $k$ copies, the covariant highest-weight measurement of arXiv:2611.07271, read out through the Weyl-shift estimator, is exactly unbiased for every state; it gives $Θ(\max\{m^3/k,m^2\}/ε^2)$ in Frobenius norm on all states and in trace distance on every class at a fixed distance from the pure boundary. The gain $1/k$ ($k\le m$) away from the pure boundary, against $1/\sqrt k$ on cold number-conserving states, is therefore attained. For bosonic Gaussian states with bounded covariance, any displacement and squeezing, and occupations $n_1\le\dots\le n_m$, $O((m^2+r^3+\sum_{i,j>r}1/(n_i+n_j))/ε^2)$ single-copy measurements suffice, $r$ the largest index with $r\,n_r\le2$; this is the minimax rate on dyadic-interval classes, with no spectral gap or cold-mode count assumed, and holds with no covariance bound for displaced passive states. With no bound on energy or squeezing, non-Gaussian measurements learn centred one-mode states, mixed included, from $O(ε^{-2})$ and centred pure $m$-mode states from $O(m^2/ε^2)$ single copies, free of the $\log\log E$ term of Gaussian measurements, and $m$-mode states from $O(m^3/ε^2)$ copies, entangled only in a first round on blocks of $4m+6$.

DOI
10.48550/arxiv.2611.13428

Related papers

Entangled measurements are necessary for optimal tomography of mixed fermionic Gaussian states and of bosonic Gaussian states near the vacuum

Ron Rubin

We prove that learning an unknown mixed fermionic Gaussian state on $m$ modes to trace distance $ε$ requires $Ω(m^3/ε^2)$ copies when measurements act on one copy at a time, even with arbitrary POVMs, fresh ancillas and classical adaptivity, but without quantum memory between copies. The bound holds for $0<ε\le1/3600$ and separates this model from the known collective rate $Θ(m^2/ε^2)$. It follows from a uniform single-copy Fisher-information budget and a dimension-independent comparison between trace distance and Gaussian parameters. On covariance matrices of operator norm at most $1-c$, we prove a Frobenius-to-trace-norm continuity bound with constant $[2c(2-c)]^{-1/2}$; matchgate shadows then attain $O(m^3/(cε^2))$ copies. This also gives explicit error certificates for thermal free-fermion states. For a class of mixed passive bosonic Gaussian states with total mean photon number at most one, a reduction to bounded-block qudit tomography gives a single-copy lower bound $Ω(m^3/(ε^2\sqrt{\log(m/ε)}))$, versus collective complexity $Θ(m^2/ε^2)$. These separations answer the mixed-state measurement-resource question posed by Chen et al. A two-mode example has optimal two-copy Fisher trace $5$, versus the separable ceiling $4$. An IBM replication gave a pre-registered witness lower bound $4.12$ at one-sided $95\%$ shot-noise confidence; its interpretation assumes the prescribed preparations and a common measurement channel and does not bound preparation systematics.

quant-pharXiv:2609.23189•Sep 22, 2026•4 citations

What resources are needed for optimal learning of bosonic Gaussian states?

Senrui Chen, Francesco Anna Mele, Marco Fanizza +5 more

Continuous-variable systems enable key quantum technologies in computation, communication, and sensing. Bosonic Gaussian states emerge naturally in various such applications, including gravitational-wave and dark-matter detection. A fundamental question is how to characterize an unknown bosonic Gaussian state from as few samples as possible. Despite decades-long exploration, the ultimate efficiency limit remains unclear. In this work, we study the necessary and sufficient number of copies to learn an $n$-mode Gaussian state, with energy less than $E$, to $\varepsilon$ trace distance with high probability. We prove a lower bound of $Ω(n^3/\varepsilon^2)$ for Gaussian measurements, matching the best known upper bound up to doubly-log energy dependence, and $Ω(n^2/\varepsilon^2)$ for arbitrary measurements. We further show an upper bound of $\widetilde{O}(n^2/\varepsilon^2)$ given that the Gaussian state is promised to be either pure or passive. Interestingly, while Gaussian measurements suffice for nearly optimal learning of pure Gaussian states, non-Gaussian measurements are provably required for optimal learning of passive Gaussian states. Finally, focusing on learning single-mode Gaussian states via non-entangling Gaussian measurements, we provide a nearly tight bound of $\widetildeΘ(E/\varepsilon^2)$ for any non-adaptive schemes, showing adaptivity is indispensable for nearly energy-independent scaling. As a byproduct, we establish sharp bounds on the trace distance between Gaussian states in terms of the total variation distance between their Wigner distributions, and obtain a nearly tight sample complexity bound for learning the Wigner distribution of any Gaussian state to $\varepsilon$ total variation distance. Our results significantly advance quantum learning theory in the bosonic regimes and have practical impact in quantum sensing and benchmarking applications.

quant-pharXiv:2603.18136•Mar 20, 2026•14 citations

When are bosonic Gaussian states classical to learn?

Senrui Chen, Antonio Anna Mele, Francesco Anna Mele +1 more

A fundamental question in physics is: When does classical behavior emerge from quantum systems? Bosonic Gaussian states provide a natural setting to explore this quantum-classical boundary, as they capture both the classical field behavior and the intrinsic quantum nature of light. Here, we address this problem from a learning-theoretic perspective by asking: When are bosonic Gaussian states classical to learn? That is, under what conditions (if any) can an n-mode bosonic Gaussian state be learned with as few samples, and with operations as simple, as are needed to learn a classical 2n-variate Gaussian distribution? We establish a smooth crossover in learnability governed by the state's thermal fluctuations: - Cold Gaussian states are non-classical to learn: When the covariance matrix satisfies $Σ\le(\frac12+O(\frac1n))I$, i.e. close to the vacuum covariance, tomography under single-copy (i.e., non-entangled) measurements fundamentally requires $Ω(n^3)$ copies, strictly exceeding the sample complexity $Θ(n^2)$ of learning classical Gaussian distributions. We show that this hardness persists even when few-copy entangled measurements are allowed. - Warm Gaussian states are classical to learn: When thermal fluctuations exceed the vacuum noise, parameterized by $Σ\ge(\frac12+ν)I$ for any parameter $ν>0$, we prove that single-copy tomography requires $N=Θ\left(n^2\min(n,1+ν^{-1})\right)$ copies. This bound is tight and is achieved by simple, non-adaptive, unentangled heterodyne measurements. Crucially, for $ν=Ω(1)$, the sample complexity drops to $Θ(n^2)$, matching the classical case. Our results tightly characterize a quantum-to-classical crossover in the learnability of bosonic Gaussian states, reveal a novel connection between fundamental physics and statistical learning theory, and have implications for real-world sensing experiments.

quant-pharXiv:2609.26705•Sep 23, 2026•3 citations

The log log jam in Gaussian state tomography

Sitan Chen, Weiyuan Gong, Qi Ye +1 more

Unlike in finite dimensions, quantum information in continuous-variable systems has the peculiar feature that without imposing physical constraints, the sample complexity of state tomography can be unbounded. Remarkably, this is even the case for state-of-the-art protocols for learning Gaussian states, which have finite-dimensional descriptions: the best known rates scale with $\log \log E$, where $E$ is the energy of the system. We prove this is not an artifact of existing analyses, but a fundamental limitation of the measurements used. We show: (1) Any protocol that uses Gaussian measurements, even entangled or adaptively chosen ones, must incur a $\log \log E$ dependence. This answers an open question posed by a number of previous works. (2) There is a smooth tradeoff between the number of rounds of adaptivity and the energy dependence, and we give a matching protocol achieving this interpolated rate. (3) With highly entangled, non-Gaussian measurements, one can learn $n$-mode pure Gaussian states with $O(n^2 / ε^2)$ samples, independent of $E$. This answers an open question posed by Chen et al. (4) A simple protocol based on the single-copy canonical phase POVM of Holevo and Helstrom learns single-mode pure Gaussian states with $O(1/ε^2)$ samples, again independent of $E$. Our results clarify the role of energy in bosonic state tomography and shed new light on the intriguing interplay between adaptivity, entanglement, and magic in quantum learning.

quant-pharXiv:2607.12983•Jul 15, 2026•7 citations

Certifying fermionic Gaussian states (and a little more) with optimal precision dependence

Ninnat Dangniam, Laphas Premcharoen, Metrasit Sripech +1 more

Fermionic Gaussian states are the workhorse reference states for qubit-based quantum simulation of fermionic systems, yet existing certification protocols either proceed via fidelity estimation, leading to suboptimal sample complexity in the target precision $ε$, only apply to Haar-typical states, or require adaptive measurements on a large fraction of qubits. We give an adaptive protocol that certifies any $d$-mode pure fermionic Gaussian state using $O(d^2ε^{-1})$ copies, single-qubit measurements with only one qubit measured adaptively per copy, and $O(d^3)$ classical processing time per copy. The $ε^{-1}$ dependence is optimal for the certification problem, even among strategies using entangled measurements. The sample complexity is controlled by the spectral gap of a $d\leftrightarrow d-2$ down-up walk---a Markov chain studied in the theory of high-dimensional expanders, equivalent to a two-site Glauber dynamics in statistical physics---relating certification efficiency to relaxation time to equilibrium. The worst-case bound is tight for this protocol and is attained by physically relevant states, including ground states of the fully dimerized Su-Schrieffer-Heeger (SSH) chain and BCS pair states. In contrast, numerics up to $d=14$ suggest that $O(d ε^{-1})$ copies suffice to certify Haar-typical Gaussian states, a factor of $d$ improvement over the worst-case bound. Finally, because the bound depends only on the target's computational-basis distribution, the protocol extends to efficiently phase-dressed states---states obtained by injecting an efficiently computable diagonal phase to Gaussian states---with the same sample complexity. The class includes a continuous family of four-mode non-Gaussian magic states for matchgate computation.

quant-pharXiv:2609.28233•Sep 24, 2026•1 citation

Optimal testing of fermionic and bosonic Gaussian states

Vishnu Iyer, Bryan O'Gorman, Ojas Parekh +2 more

We study the problem of property testing quantum states: given a pure state $|ψ\rangle$ that either (A) belongs to some class $C$ of pure states, or (B) is $\varepsilon$-far in trace distance from all states in $C$, determine which is the case with high probability. It is known that there exists classes $C$ for which the sample complexity of property testing necessarily scales with the size of the system. In this work, we identify classes for which testing only requires a size-independent number of samples. We prove a tight sample complexity of $Θ(1/\varepsilon^2)$ for the property testing of five important classes of Gaussian quantum states: 1) Fermionic Gaussian states, 2) Slater determinants, 3) bosonic Gaussian states, 4) zero-mean bosonic Gaussian states, and 5) bosonic coherent states. While property testers for some of these classes have been studied previously, those analyses only gave upper bounds scaling polynomially in the number of modes. In each case, our tester is the projection onto the ``top'' irrep of two or three copies. We get to constant sample complexity by lower bounding how quickly the rejection probability increases with distance from the class; the main technical component involves bounding the spectral gap of symmetric extension of the test projector. We then establish optimality by proving matching lower bounds based on binary state discrimination for each class. Our testers and optimality claims also extend to the tolerant setting, wherein $ψ$ may be $O(\varepsilon)$-close to $C$ in case (A), rather than lying exactly inside.

quant-pharXiv:2609.39113•Oct 1, 2026•3 citations
With single-copy measurements, every mixed fermionic Gaussian state on mmm modes, pure modes included, is learned to trace distance εεε from Θ(m3/ε2)Θ(m^3/ε^2)Θ(m3/ε2) copies, with no logarithmic factor, against the known Θ(m2/ε2)Θ(m^2/ε^2)Θ(m2/ε2) for collective measurements. We prove the upper bound, resolving Conjecture 10.1 of arXiv:2609.23189 (lower bound for ε≤1/3600ε\le1/3600ε≤1/3600), and fill most open entries of the sample-complexity table of fermionic and bosonic Gaussian states, for single-copy, kkk-copy and collective measurements. The single-copy measurement's noise is matched to the metric at every occupation scale. With blocks of kkk copies, the covariant highest-weight measurement of arXiv:2611.07271, read out through the Weyl-shift estimator, is exactly unbiased for every state; it gives Θ(max⁡{m3/k,m2}/ε2)Θ(\max\{m^3/k,m^2\}/ε^2)Θ(max{m3/k,m2}/ε2) in Frobenius norm on all states and in trace distance on every class at a fixed distance from the pure boundary. The gain 1/k1/k1/k (k≤mk\le mk≤m) away from the pure boundary, against 1/k1/\sqrt k1/k​ on cold number-conserving states, is therefore attained. For bosonic Gaussian states with bounded covariance, any displacement and squeezing, and occupations n1≤⋯≤nmn_1\le\dots\le n_mn1​≤⋯≤nm​, O((m2+r3+∑i,j>r1/(ni+nj))/ε2)O((m^2+r^3+\sum_{i,j>r}1/(n_i+n_j))/ε^2)O((m2+r3+∑i,j>r​1/(ni​+nj​))/ε2) single-copy measurements suffice, rrr the largest index with r nr≤2r\,n_r\le2rnr​≤2; this is the minimax rate on dyadic-interval classes, with no spectral gap or cold-mode count assumed, and holds with no covariance bound for displaced passive states. With no bound on energy or squeezing, non-Gaussian measurements learn centred one-mode states, mixed included, from O(ε−2)O(ε^{-2})O(ε−2) and centred pure mmm-mode states from O(m2/ε2)O(m^2/ε^2)O(m2/ε2) single copies, free of the log⁡log⁡E\log\log EloglogE term of Gaussian measurements, and mmm-mode states from O(m3/ε2)O(m^3/ε^2)O(m3/ε2) copies, entangled only in a first round on blocks of 4m+64m+64m+6.
We prove that learning an unknown mixed fermionic Gaussian state on mmm modes to trace distance εεε requires Ω(m3/ε2)Ω(m^3/ε^2)Ω(m3/ε2) copies when measurements act on one copy at a time, even with arbitrary POVMs, fresh ancillas and classical adaptivity, but without quantum memory between copies. The bound holds for 0<ε≤1/36000<ε\le1/36000<ε≤1/3600 and separates this model from the known collective rate Θ(m2/ε2)Θ(m^2/ε^2)Θ(m2/ε2). It follows from a uniform single-copy Fisher-information budget and a dimension-independent comparison between trace distance and Gaussian parameters. On covariance matrices of operator norm at most 1−c1-c1−c, we prove a Frobenius-to-trace-norm continuity bound with constant [2c(2−c)]−1/2[2c(2-c)]^{-1/2}[2c(2−c)]−1/2; matchgate shadows then attain O(m3/(cε2))O(m^3/(cε^2))O(m3/(cε2)) copies. This also gives explicit error certificates for thermal free-fermion states. For a class of mixed passive bosonic Gaussian states with total mean photon number at most one, a reduction to bounded-block qudit tomography gives a single-copy lower bound Ω(m3/(ε2log⁡(m/ε)))Ω(m^3/(ε^2\sqrt{\log(m/ε)}))Ω(m3/(ε2log(m/ε)​)), versus collective complexity Θ(m2/ε2)Θ(m^2/ε^2)Θ(m2/ε2). These separations answer the mixed-state measurement-resource question posed by Chen et al. A two-mode example has optimal two-copy Fisher trace 555, versus the separable ceiling 444. An IBM replication gave a pre-registered witness lower bound 4.124.124.12 at one-sided 95%95\%95% shot-noise confidence; its interpretation assumes the prescribed preparations and a common measurement channel and does not bound preparation systematics.
Continuous-variable systems enable key quantum technologies in computation, communication, and sensing. Bosonic Gaussian states emerge naturally in various such applications, including gravitational-wave and dark-matter detection. A fundamental question is how to characterize an unknown bosonic Gaussian state from as few samples as possible. Despite decades-long exploration, the ultimate efficiency limit remains unclear. In this work, we study the necessary and sufficient number of copies to learn an nnn-mode Gaussian state, with energy less than EEE, to ε\varepsilonε trace distance with high probability. We prove a lower bound of Ω(n3/ε2)Ω(n^3/\varepsilon^2)Ω(n3/ε2) for Gaussian measurements, matching the best known upper bound up to doubly-log energy dependence, and Ω(n2/ε2)Ω(n^2/\varepsilon^2)Ω(n2/ε2) for arbitrary measurements. We further show an upper bound of O~(n2/ε2)\widetilde{O}(n^2/\varepsilon^2)O(n2/ε2) given that the Gaussian state is promised to be either pure or passive. Interestingly, while Gaussian measurements suffice for nearly optimal learning of pure Gaussian states, non-Gaussian measurements are provably required for optimal learning of passive Gaussian states. Finally, focusing on learning single-mode Gaussian states via non-entangling Gaussian measurements, we provide a nearly tight bound of Θ~(E/ε2)\widetildeΘ(E/\varepsilon^2)Θ(E/ε2) for any non-adaptive schemes, showing adaptivity is indispensable for nearly energy-independent scaling. As a byproduct, we establish sharp bounds on the trace distance between Gaussian states in terms of the total variation distance between their Wigner distributions, and obtain a nearly tight sample complexity bound for learning the Wigner distribution of any Gaussian state to ε\varepsilonε total variation distance. Our results significantly advance quantum learning theory in the bosonic regimes and have practical impact in quantum sensing and benchmarking applications.
A fundamental question in physics is: When does classical behavior emerge from quantum systems? Bosonic Gaussian states provide a natural setting to explore this quantum-classical boundary, as they capture both the classical field behavior and the intrinsic quantum nature of light. Here, we address this problem from a learning-theoretic perspective by asking: When are bosonic Gaussian states classical to learn? That is, under what conditions (if any) can an n-mode bosonic Gaussian state be learned with as few samples, and with operations as simple, as are needed to learn a classical 2n-variate Gaussian distribution? We establish a smooth crossover in learnability governed by the state's thermal fluctuations: - Cold Gaussian states are non-classical to learn: When the covariance matrix satisfies Σ≤(12+O(1n))IΣ\le(\frac12+O(\frac1n))IΣ≤(21​+O(n1​))I, i.e. close to the vacuum covariance, tomography under single-copy (i.e., non-entangled) measurements fundamentally requires Ω(n3)Ω(n^3)Ω(n3) copies, strictly exceeding the sample complexity Θ(n2)Θ(n^2)Θ(n2) of learning classical Gaussian distributions. We show that this hardness persists even when few-copy entangled measurements are allowed. - Warm Gaussian states are classical to learn: When thermal fluctuations exceed the vacuum noise, parameterized by Σ≥(12+ν)IΣ\ge(\frac12+ν)IΣ≥(21​+ν)I for any parameter ν>0ν>0ν>0, we prove that single-copy tomography requires N=Θ(n2min⁡(n,1+ν−1))N=Θ\left(n^2\min(n,1+ν^{-1})\right)N=Θ(n2min(n,1+ν−1)) copies. This bound is tight and is achieved by simple, non-adaptive, unentangled heterodyne measurements. Crucially, for ν=Ω(1)ν=Ω(1)ν=Ω(1), the sample complexity drops to Θ(n2)Θ(n^2)Θ(n2), matching the classical case. Our results tightly characterize a quantum-to-classical crossover in the learnability of bosonic Gaussian states, reveal a novel connection between fundamental physics and statistical learning theory, and have implications for real-world sensing experiments.
Unlike in finite dimensions, quantum information in continuous-variable systems has the peculiar feature that without imposing physical constraints, the sample complexity of state tomography can be unbounded. Remarkably, this is even the case for state-of-the-art protocols for learning Gaussian states, which have finite-dimensional descriptions: the best known rates scale with log⁡log⁡E\log \log EloglogE, where EEE is the energy of the system. We prove this is not an artifact of existing analyses, but a fundamental limitation of the measurements used. We show: (1) Any protocol that uses Gaussian measurements, even entangled or adaptively chosen ones, must incur a log⁡log⁡E\log \log EloglogE dependence. This answers an open question posed by a number of previous works. (2) There is a smooth tradeoff between the number of rounds of adaptivity and the energy dependence, and we give a matching protocol achieving this interpolated rate. (3) With highly entangled, non-Gaussian measurements, one can learn nnn-mode pure Gaussian states with O(n2/ε2)O(n^2 / ε^2)O(n2/ε2) samples, independent of EEE. This answers an open question posed by Chen et al. (4) A simple protocol based on the single-copy canonical phase POVM of Holevo and Helstrom learns single-mode pure Gaussian states with O(1/ε2)O(1/ε^2)O(1/ε2) samples, again independent of EEE. Our results clarify the role of energy in bosonic state tomography and shed new light on the intriguing interplay between adaptivity, entanglement, and magic in quantum learning.
Fermionic Gaussian states are the workhorse reference states for qubit-based quantum simulation of fermionic systems, yet existing certification protocols either proceed via fidelity estimation, leading to suboptimal sample complexity in the target precision εεε, only apply to Haar-typical states, or require adaptive measurements on a large fraction of qubits. We give an adaptive protocol that certifies any ddd-mode pure fermionic Gaussian state using O(d2ε−1)O(d^2ε^{-1})O(d2ε−1) copies, single-qubit measurements with only one qubit measured adaptively per copy, and O(d3)O(d^3)O(d3) classical processing time per copy. The ε−1ε^{-1}ε−1 dependence is optimal for the certification problem, even among strategies using entangled measurements. The sample complexity is controlled by the spectral gap of a d↔d−2d\leftrightarrow d-2d↔d−2 down-up walk---a Markov chain studied in the theory of high-dimensional expanders, equivalent to a two-site Glauber dynamics in statistical physics---relating certification efficiency to relaxation time to equilibrium. The worst-case bound is tight for this protocol and is attained by physically relevant states, including ground states of the fully dimerized Su-Schrieffer-Heeger (SSH) chain and BCS pair states. In contrast, numerics up to d=14d=14d=14 suggest that O(dε−1)O(d ε^{-1})O(dε−1) copies suffice to certify Haar-typical Gaussian states, a factor of ddd improvement over the worst-case bound. Finally, because the bound depends only on the target's computational-basis distribution, the protocol extends to efficiently phase-dressed states---states obtained by injecting an efficiently computable diagonal phase to Gaussian states---with the same sample complexity. The class includes a continuous family of four-mode non-Gaussian magic states for matchgate computation.
We study the problem of property testing quantum states: given a pure state ∣ψ⟩|ψ\rangle∣ψ⟩ that either (A) belongs to some class CCC of pure states, or (B) is ε\varepsilonε-far in trace distance from all states in CCC, determine which is the case with high probability. It is known that there exists classes CCC for which the sample complexity of property testing necessarily scales with the size of the system. In this work, we identify classes for which testing only requires a size-independent number of samples. We prove a tight sample complexity of Θ(1/ε2)Θ(1/\varepsilon^2)Θ(1/ε2) for the property testing of five important classes of Gaussian quantum states: 1) Fermionic Gaussian states, 2) Slater determinants, 3) bosonic Gaussian states, 4) zero-mean bosonic Gaussian states, and 5) bosonic coherent states. While property testers for some of these classes have been studied previously, those analyses only gave upper bounds scaling polynomially in the number of modes. In each case, our tester is the projection onto the ``top'' irrep of two or three copies. We get to constant sample complexity by lower bounding how quickly the rejection probability increases with distance from the class; the main technical component involves bounding the spectral gap of symmetric extension of the test projector. We then establish optimality by proving matching lower bounds based on binary state discrimination for each class. Our testers and optimality claims also extend to the tolerant setting, wherein ψψψ may be O(ε)O(\varepsilon)O(ε)-close to CCC in case (A), rather than lying exactly inside.