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

Optimal testing of fermionic and bosonic Gaussian states

Vishnu Iyer, Bryan O'Gorman, Ojas Parekh, Kevin Thompson, Andrew Zhao

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

Abstract

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.

AI Summary

The paper asks whether Gaussian structure in an unknown pure quantum state can be tested with a number of copies independent of the number of modes. It considers five classes: fermionic Gaussian states, Slater determinants, bosonic Gaussian states, zero-mean bosonic Gaussian states, and coherent states. For each class, it establishes optimal sample complexity $\Theta(1/\varepsilon^2)$ at constant success probability for distinguishing membership from trace distance at least $\varepsilon$ from the class. The protocols repeatedly measure two copies jointly, except for general bosonic Gaussian states, which require three. The tests project onto representation-theoretic “top” sectors; their perfect-completeness characterizations were largely known, while the analysis establishes dimension-independent soundness. The central framework relates rejection probability $q(\psi)$ to distance through $\alpha\,\mathrm{dist}(\psi,\mathcal C)^2\leq q(\psi)\leq k\,\mathrm{dist}(\psi,\mathcal C)^2$. It obtains this inequality from spectral gaps of symmetrically extended test operators, using a gradient-flow argument on projective Hilbert space. Representation theory and explicit diagonalization supply the required gaps. Matching lower bounds follow from binary discrimination between constructed nearby states. Tolerant testing uses $O(\log(1/\delta)/(\varepsilon_2-\beta\varepsilon_1)^2)$ copies, provided $\varepsilon_2>\beta\varepsilon_1$, with class-dependent constant $\beta$; thus the tolerant bounds do not cover arbitrary promise gaps. The results assume pure inputs, not general mixed Gaussian-state testing, and constant copy complexity does not mean constant total computation. The paper also notes simultaneous independent work establishing dimension-independent testing for the same classes.

No sign of AI-generated textAI use disclosedUnclear writing
In response, GPT 5.6 proposed a proof technique resembling the spectral gap technique outlined in \cref{sec:framework}, along with a candidate proof for the spectral gap for the fermionic Gaussian tester.

Error found: The introductory lower-bound theorem omits the ε₂ ≤ 1/√2 range established by its proof and nontrivial-size qualifications, and cannot apply to fermionic systems where every physical pure state is Gaussian. The gradient-inequality corollary incorrectly writes −7r for k = 3 and m = 7, whereas the proved formula gives −9r. The explicit fermionic eigenvalue and diagonalization formulas contain an extra factor of two relative to the defined Λ, without changing the tester's kernel. The alternative fermionic spectral-gap proof derives values inconsistent with its claimed spectrum and ends without establishing its proposed auxiliary identities.

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

Comments
91 pages, 1 table

Related papers

Testing quantum Gaussianity with constant sample complexity

Mahtab Yaghubi Rad, Ricard Puig, Saksham Hassanandani +4 more

Efficiently testing whether a quantum state possesses a given structure is both a fundamental and a practical task in quantum information. Among the most important structured families are Gaussian states, which underpin quantum optics and many-body physics while defining paradigmatic regimes of efficient classical simulation. Despite the central role of Gaussian states, optimal tests of Gaussianity have remained unknown. Here we give optimal and robust algorithms for testing fermionic and bosonic Gaussian states, with sample complexity independent of system size, particle number, and energy. Remarkably, the protocols implement experimentally feasible measurements associated with known exact symmetry characterizations of Gaussianity, using Bell sampling on two copies for fermions and passive interferometry with photon counting on three copies for bosons. We further obtain tolerant testers requiring joint measurements on a larger, but still constant, number of copies. At the heart of our analysis is a unified approach---which we call the gradient-flow method---that applies across all structured families considered here and underlies our optimal testers: representation theory turns approximate satisfaction of the defining symmetry into quantitative control of the gradient of the rejection probability, allowing a continuous descent from the input state to the target family whose length bounds their distance.

quant-pharXiv:2609.40270•Oct 1, 2026•3 citations

Fermionic Gaussianity can be tested with mode-independent sample-complexity

Maxwell West, Martin Larocca

Deciding whether an unknown quantum state either belongs to, or is far from, a given family of states is a natural question of quantum information theory. In many such cases, there is a natural 2-copy test which always accepts whenever the state indeed belongs to the target family; it is often much more difficult, however, to bound the probability of acceptance for states that are far from the family. Here we develop a simple new technique for upper bounding this probability for general families, and therefore upper bounding the sample-complexity of the decision problem itself. As a particularly striking example of this framework, we show that deciding whether an unknown pure $n$-mode state is fermionic Gaussian, or at least $\varepsilon$-far in trace distance from all Gaussian states, can be accomplished using the optimal number $Θ(\varepsilon^{-2})$ of copies. Remarkably, our analysis applies to the well-known Bell sampling procedure for testing fermionic Gaussianity, which we therefore show to be optimal, even compared to protocols making arbitrary collective and adaptive measurements. As a second example, we show that the analogous decision problem for the family of Slater determinant states can also be solved with mode-independent sample-complexity.

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

Testing bosonic and fermionic Gaussian states with a constant number of copies

Jop Briët, Davi Castro-Silva, Michael Walter +1 more

Bosonic and fermionic Gaussian quantum states are families of quantum states that play a central role in quantum physics and quantum information processing. We study the problem of testing whether a given state is either Gaussian, or has bounded overlap with any Gaussian state. Previous analyses of this testing problem led to tests that require a number of copies of the state that scales with the number of modes (the system size). In this work we show that a constant number of copies of the state suffices. We derive these results based on the symmetries of identical copies of Gaussian states, and by bounding the distance to the set of Gaussian states through a gradient flow and a spectral bound studied previously for the Kac random walk on a sphere.

quant-pharXiv:2610.06794•Oct 6, 2026•0 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

Is it Gaussian? Testing bosonic quantum states

Filippo Girardi, Freek Witteveen, Francesco Anna Mele +4 more

Gaussian states are widely regarded as one of the most relevant classes of continuous-variable (CV) quantum states, as they naturally arise in physical systems and play a key role in quantum technologies. This motivates a fundamental question: given copies of an unknown CV state, how can we efficiently test whether it is Gaussian? We address this problem from the perspective of representation theory and quantum learning theory, characterizing the sample complexity of Gaussianity testing as a function of the number of modes. For pure states, we prove that just a constant number of copies is sufficient to decide whether the state is exactly Gaussian. We then extend this to the tolerant setting, showing that a polynomial number of copies suffices to distinguish states that are close to Gaussian from those that are far. In contrast, we establish that testing Gaussianity of general mixed states necessarily requires exponentially many copies, thereby identifying a fundamental limitation in testing CV systems. Our approach relies on rotation-invariant symmetries of Gaussian states together with the recently introduced toolbox of CV trace-distance bounds.

arXiv:2510.07305•Oct 8, 2025•14 citations

Optimal tomography of bosonic and fermionic Gaussian states

Senrui Chen, Marco Fanizza, Filippo Girardi +4 more

The sample complexity is the minimum number of copies required to learn an accurate classical description of a quantum state. Bosonic and fermionic Gaussian quantum states are families of quantum states that play a key role in quantum science and technology, from quantum optics and many-body physics to quantum chemistry, quantum computing, and quantum information theory. Despite their importance, their sample complexity had not been fully determined. We settle this open problem and show that both bosonic and fermionic Gaussian states can be learned using a number of copies that scales quadratically in the number of modes, regardless of whether the state is pure or mixed, and independently of any energy bound on the state. We derive these results by using the representation theory of Gaussian unitaries and by putting forth a generalization of the random purification channel to this setting and beyond.

quant-pharXiv:2607.11847•Jul 14, 2026•21 citations
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.
The paper asks whether Gaussian structure in an unknown pure quantum state can be tested with a number of copies independent of the number of modes. It considers five classes: fermionic Gaussian states, Slater determinants, bosonic Gaussian states, zero-mean bosonic Gaussian states, and coherent states.
For each class, it establishes optimal sample complexity Θ(1/ε2)\Theta(1/\varepsilon^2)Θ(1/ε2) at constant success probability for distinguishing membership from trace distance at least ε\varepsilonε from the class. The protocols repeatedly measure two copies jointly, except for general bosonic Gaussian states, which require three. The tests project onto representation-theoretic “top” sectors; their perfect-completeness characterizations were largely known, while the analysis establishes dimension-independent soundness.
The central framework relates rejection probability q(ψ)q(\psi)q(ψ) to distance through α dist(ψ,C)2≤q(ψ)≤k dist(ψ,C)2\alpha\,\mathrm{dist}(\psi,\mathcal C)^2\leq q(\psi)\leq k\,\mathrm{dist}(\psi,\mathcal C)^2αdist(ψ,C)2≤q(ψ)≤kdist(ψ,C)2. It obtains this inequality from spectral gaps of symmetrically extended test operators, using a gradient-flow argument on projective Hilbert space. Representation theory and explicit diagonalization supply the required gaps. Matching lower bounds follow from binary discrimination between constructed nearby states.
Tolerant testing uses O(log⁡(1/δ)/(ε2−βε1)2)O(\log(1/\delta)/(\varepsilon_2-\beta\varepsilon_1)^2)O(log(1/δ)/(ε2​−βε1​)2) copies, provided ε2>βε1\varepsilon_2>\beta\varepsilon_1ε2​>βε1​, with class-dependent constant β\betaβ; thus the tolerant bounds do not cover arbitrary promise gaps. The results assume pure inputs, not general mixed Gaussian-state testing, and constant copy complexity does not mean constant total computation. The paper also notes simultaneous independent work establishing dimension-independent testing for the same classes.
Efficiently testing whether a quantum state possesses a given structure is both a fundamental and a practical task in quantum information. Among the most important structured families are Gaussian states, which underpin quantum optics and many-body physics while defining paradigmatic regimes of efficient classical simulation. Despite the central role of Gaussian states, optimal tests of Gaussianity have remained unknown. Here we give optimal and robust algorithms for testing fermionic and bosonic Gaussian states, with sample complexity independent of system size, particle number, and energy. Remarkably, the protocols implement experimentally feasible measurements associated with known exact symmetry characterizations of Gaussianity, using Bell sampling on two copies for fermions and passive interferometry with photon counting on three copies for bosons. We further obtain tolerant testers requiring joint measurements on a larger, but still constant, number of copies. At the heart of our analysis is a unified approach---which we call the gradient-flow method---that applies across all structured families considered here and underlies our optimal testers: representation theory turns approximate satisfaction of the defining symmetry into quantitative control of the gradient of the rejection probability, allowing a continuous descent from the input state to the target family whose length bounds their distance.
Deciding whether an unknown quantum state either belongs to, or is far from, a given family of states is a natural question of quantum information theory. In many such cases, there is a natural 2-copy test which always accepts whenever the state indeed belongs to the target family; it is often much more difficult, however, to bound the probability of acceptance for states that are far from the family. Here we develop a simple new technique for upper bounding this probability for general families, and therefore upper bounding the sample-complexity of the decision problem itself. As a particularly striking example of this framework, we show that deciding whether an unknown pure nnn-mode state is fermionic Gaussian, or at least ε\varepsilonε-far in trace distance from all Gaussian states, can be accomplished using the optimal number Θ(ε−2)Θ(\varepsilon^{-2})Θ(ε−2) of copies. Remarkably, our analysis applies to the well-known Bell sampling procedure for testing fermionic Gaussianity, which we therefore show to be optimal, even compared to protocols making arbitrary collective and adaptive measurements. As a second example, we show that the analogous decision problem for the family of Slater determinant states can also be solved with mode-independent sample-complexity.
Bosonic and fermionic Gaussian quantum states are families of quantum states that play a central role in quantum physics and quantum information processing. We study the problem of testing whether a given state is either Gaussian, or has bounded overlap with any Gaussian state. Previous analyses of this testing problem led to tests that require a number of copies of the state that scales with the number of modes (the system size). In this work we show that a constant number of copies of the state suffices. We derive these results based on the symmetries of identical copies of Gaussian states, and by bounding the distance to the set of Gaussian states through a gradient flow and a spectral bound studied previously for the Kac random walk on a sphere.
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.
Gaussian states are widely regarded as one of the most relevant classes of continuous-variable (CV) quantum states, as they naturally arise in physical systems and play a key role in quantum technologies. This motivates a fundamental question: given copies of an unknown CV state, how can we efficiently test whether it is Gaussian? We address this problem from the perspective of representation theory and quantum learning theory, characterizing the sample complexity of Gaussianity testing as a function of the number of modes. For pure states, we prove that just a constant number of copies is sufficient to decide whether the state is exactly Gaussian. We then extend this to the tolerant setting, showing that a polynomial number of copies suffices to distinguish states that are close to Gaussian from those that are far. In contrast, we establish that testing Gaussianity of general mixed states necessarily requires exponentially many copies, thereby identifying a fundamental limitation in testing CV systems. Our approach relies on rotation-invariant symmetries of Gaussian states together with the recently introduced toolbox of CV trace-distance bounds.
The sample complexity is the minimum number of copies required to learn an accurate classical description of a quantum state. Bosonic and fermionic Gaussian quantum states are families of quantum states that play a key role in quantum science and technology, from quantum optics and many-body physics to quantum chemistry, quantum computing, and quantum information theory. Despite their importance, their sample complexity had not been fully determined. We settle this open problem and show that both bosonic and fermionic Gaussian states can be learned using a number of copies that scales quadratically in the number of modes, regardless of whether the state is pure or mixed, and independently of any energy bound on the state. We derive these results by using the representation theory of Gaussian unitaries and by putting forth a generalization of the random purification channel to this setting and beyond.