Pith. Sign in

RECORD

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

Quantum Physics · Submitted 18 Mar 2026

abstract compiled · 2026-09-23 · no language-model review

The authors' main claim We prove a lower bound of $\Omega(n^3/\varepsilon^2)$ for Gaussian measurements, matching the best known upper bound up to doubly-log energy dependence, and ${\Omega}(n^2/\varepsilon^2)$ for arbitrary measurements.

how it is stated · asserted 1.00 read the record →

Comment (0) Read on arXiv ↗
Cite ▾
arXiv ID2603.18136 (version 2)
Pith IDINZKDLNK, Pith's permanent record of this paper and its review
CitationAlfred Li, Francesco Anna Mele, Hsin-Yuan Huang, John Preskill, Marco Fanizza, Senrui Chen, Yanbei Chen, Zachary Mann. "What resources are needed for optimal learning of bosonic Gaussian states?." arXiv:2603.18136 (2026). https://pith.science/paper/INZKDLNK
Claim paper

The compiled record

The paper's own sentences, arranged. Each label is drawn from a closed vocabulary; the number beside it is the probability the classifier gave that label. Numbers in the tables are the authors', checked by code. No sentence in this record was written by a model.

Open the compiled record

Compiled by classifier-1.13.0 via TypeSafe API, question bank abstract-p1-20260923, 2026-09-23: 1 request, 8,378 input tokens.

What the abstract itself states, as probabilities: claims first 0.06 · states limitation 0.59 · human participants 0.01 · controlled comparison 0.04 · randomized assignment 0.01 · states quantitative result 0.99 · compares with prior results 0.91 · mentions code or data availability 0.02.

The abstract, sentence by sentence

arXiv listing abstract v2. Results and the main claim are underlined; .

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 $\Omega(n^3/\varepsilon^2)$ for Gaussian measurements, matching the best known upper bound up to doubly-log energy dependence, and ${\Omega}(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\Theta(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.

background contribution method result interpretation main claim

What the classifier reports for each sentence. The number is the probability it gave the label.
#sentencerolethe authors' own workstates the main conclusionstrength
s0 Continuous-variable systems enable key quantum technologies in computation, communication, and sensing. background 1.00 0.04 0.01 asserted 1.00
s1 Bosonic Gaussian states emerge naturally in various such applications, including gravitational-wave and dark-matter detection. background 1.00 0.05 0.01 asserted 0.99
s2 A fundamental question is how to characterize an unknown bosonic Gaussian state from as few samples as possible. background 0.85 0.04 0.02 asserted 0.84
s3 Despite decades-long exploration, the ultimate efficiency limit remains unclear. gap 0.99 0.03 0.02 asserted 0.98
s4 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. contribution 1.00 0.88 0.07 asserted 0.85
s5 We prove a lower bound of $\Omega(n^3/\varepsilon^2)$ for Gaussian measurements, matching the best known upper bound up to doubly-log energy dependence, and ${\Omega}(n^2/\varepsilon^2)$ for arbitrary measurements. result 1.00 0.94 0.62 asserted 1.00
s6 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. result 0.99 0.96 0.11 asserted 1.00
s7 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. result 0.92 0.93 0.19 asserted 1.00
s8 Finally, focusing on learning single-mode Gaussian states via non-entangling Gaussian measurements, we provide a nearly tight bound of $\widetilde\Theta(E/\varepsilon^2)$ for any non-adaptive schemes, showing adaptivity is indispensable for nearly energy-independent scaling. result 0.99 0.96 0.12 asserted 1.00
s9 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. result 0.94 0.96 0.07 asserted 1.00
s10 Our results significantly advance quantum learning theory in the bosonic regimes and have practical impact in quantum sensing and benchmarking applications. interpretation 1.00 0.45 0.12 asserted 0.99

What kind of paper the classifier reports this is: theoretical result 1.00 · evidence from proof or derivation 1.00.

What was examined, and what was not

sources read
  • arXiv listing abstract v2
not examined
  • full text
  • figures and tables
  • references and citing sentences
  • relations to other papers
levels run
  • P abstract
not run
  • S sections
  • T body sentences
  • C citations
  • R cross-paper relations

Every quoted sentence on this record is the authors'. Every label is from Pith's closed vocabulary, with the probability shown beside it. Every number in the measurements table is the authors', checked by code. Record as JSON

The paper
Original abstract

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 $\Omega(n^3/\varepsilon^2)$ for Gaussian measurements, matching the best known upper bound up to doubly-log energy dependence, and ${\Omega}(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\Theta(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.

Human review
References
How the literature uses it

5 arXiv papers cite this in 26 sentences

Each citing sentence is taken from the citing paper's LaTeX source and typed by Pith's classifier. A label appears at probability 0.8 or more (0.95 for support), a contest at 0.7 or more; the quoted words are the citing authors'. How each label was checked · JSON

Papers citing it · 21 sentences without a confident label

Compares with it 1 paper
  • Furthermore, [ref] derives a $Ω(m^2 / ^2)$ sample complexity lower bound for learning mixed Gaussian states and $Ω(m^2 / ^2)$ for pure Gaussian states, together with a $Ω(m^3/^2)$ lower bound for adaptive Gaussian measurements; <ref> improves by logarithmic factors for pure states (and uses a completely different argument).

    Optimal tomography of bosonic and fermionic Gaussian states · Related work · 0.93

Cites it as background 2 papers

What it cites · 59 sentences without a confident label

Uses the method or tool of 8 papers
  • For completeness, we describe their algorithm in below: * Run the learn-to-unsqueeze protocol [ref] in Lemma [ref] using Θ((n + log(loglogE̅/δ))loglogE̅) copies of $ρ$ to learn a symplectic matrix $S$ such that $ρ_unsqueezed(μ,Σ')U_S^-1ρ(μ,Σ) U^†_S^-1$ satisfies $Σ'^-1_op≤4$ with probability at least $1-δ/2$.

    Energy-independent tomography of Gaussian states · Nearly-tight bound on learning Gaussian Wigner distributions · 0.98

  • The key to achieving the $O(n^2/ε^2)$ upper bound is a recently developed toolkit known as the passive random purification channel [ref] , denoted by $Λ^(n,N)$, which is an extension of similar objects in discrete-variable quantum systems [ref] to the bosonic regime. $Λ^(n,N)$ is a quantum channel that maps $N$ copies of any $n$-mode passive Gaussian state, $ρ^⊗N$, to $N$ copies of its purification $Ψ^⊗N_O$, although $Ψ_O$ is random (but fixed among the $N$ copies) and is labeled by an orthogonal symplectic operator $O$.

    2511.15806 · Upper bounds on Gaussian state learning · 0.89

  • The key to achieving the $O(n^2/ε^2)$ upper bound is a recently developed toolkit known as the passive random purification channel [ref] , denoted by $Λ^(n,N)$, which is an extension of similar objects in discrete-variable quantum systems [ref] to the bosonic regime. $Λ^(n,N)$ is a quantum channel that maps $N$ copies of any $n$-mode passive Gaussian state, $ρ^⊗N$, to $N$ copies of its purification $Ψ^⊗N_O$, although $Ψ_O$ is random (but fixed among the $N$ copies) and is labeled by an orthogonal symplectic operator $O$.

    Random purification channel made simple · Upper bounds on Gaussian state learning · 0.89

Compares with 1 paper
Cites as support 1 paper
  • To our knowledge, this is the first provable and rigorous separation demonstrating a non-Gaussian advantage in quantum learning theory with continuous-variable systems [ref] .

    Energy-independent tomography of Gaussian states · Upper bounds on Gaussian state learning · 0.96

Cites as background 15 papers
  • Specifically, the problem of learning Gaussian states in trace distance has recently been investigated in Refs. [ref] , primarily with the goal of establishing upper bounds on the sample complexity.

    Efficient Hamiltonian, structure and trace distance learning of Gaussian states · Prior works and context of our results · 0.91

  • Specifically, the problem of learning Gaussian states in trace distance has recently been investigated in Refs. [ref] , primarily with the goal of establishing upper bounds on the sample complexity.

    Energy-independent tomography of Gaussian states · Prior works and context of our results · 0.91

  • Early bounds of this type were not tight [ref] , but were subsequently refined in [ref] , ultimately culminating in a tight characterization of the trace distance between mixed Gaussian states in [ref] (see also [ref] for an algorithm that computes the trace distance between two Gaussian states up to a prescribed precision).

    2603.05499 · Prior works and context of our results · 0.81

Discussion

Know something about this paper? Leave a comment, or highlight any passage above to comment on it.