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.
AI Summary
The paper asks whether collective measurements are necessary for copy-optimal tomography of mixed Gaussian states. For $m$-mode fermionic Gaussian states, it proves that arbitrary adaptive single-copy POVMs require $\Omega(m^3/\epsilon^2)$ copies for trace-distance error $\epsilon\le1/3600$, versus the known collective rate $\Theta(m^2/\epsilon^2)$. Fresh ancillas and unlimited classical feedforward are allowed, but quantum memory between copies is excluded; estimates need not be Gaussian.
The fermionic proof bounds the single-copy classical Fisher-information trace by $2m$ uniformly on a parameter ball near the maximally mixed state. It combines a covariance constraint valid for arbitrary states, an information-budget chain rule for adaptive measurements, a dimension-independent comparison between trace distance and Euclidean Gaussian parameters, and a vector van Trees inequality. For covariance matrices satisfying $\|\Gamma\|_{\rm op}\le1-c$, a continuity bound $\|\rho_\Gamma-\rho_{\Gamma'}\|_1\le[2c(2-c)]^{-1/2}\|\Gamma-\Gamma'\|_F$ yields a matching single-copy rate for fixed $c$, using matchgate shadows, and thermal-state error certificates.
For a passive bosonic class with total mean photon number at most one, a second-quantisation reduction to bounded-block qudit tomography gives $\Omega(m^3/[\epsilon^2\sqrt{\log(m/\epsilon)}])$ single-copy complexity, versus collective $\Theta(m^2/\epsilon^2)$. Removing the logarithmic loss is stated conditionally.
The worst-case fermionic single-copy rate remains between $m^3$ and $m^4$ in mode scaling, with near-pure modes unresolved. Memory tradeoffs and unrestricted bosonic upper bounds are not settled. A two-mode illustration achieves Fisher trace $5$ versus the separable ceiling $4$; its hardware witness exceeds $4$ under prescribed-preparation and common-channel assumptions, without bounding preparation systematics.
Some signs of AI-generated text
Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.
Comments
38 pages, 1 figure. Ancillary files: IBM pilot and replication data, circuits, and offline recount code
We prove that learning an unknown mixed fermionic Gaussian state on m modes to trace distance ε requires Ω(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/3600 and separates this model from the known collective rate Θ(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−c, we prove a Frobenius-to-trace-norm continuity bound with constant [2c(2−c)]−1/2; matchgate shadows then attain 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/ε))), versus collective complexity Θ(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 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.
The paper asks whether collective measurements are necessary for copy-optimal tomography of mixed Gaussian states. For m-mode fermionic Gaussian states, it proves that arbitrary adaptive single-copy POVMs require Ω(m3/ϵ2) copies for trace-distance error ϵ≤1/3600, versus the known collective rate Θ(m2/ϵ2). Fresh ancillas and unlimited classical feedforward are allowed, but quantum memory between copies is excluded; estimates need not be Gaussian.
The fermionic proof bounds the single-copy classical Fisher-information trace by 2m uniformly on a parameter ball near the maximally mixed state. It combines a covariance constraint valid for arbitrary states, an information-budget chain rule for adaptive measurements, a dimension-independent comparison between trace distance and Euclidean Gaussian parameters, and a vector van Trees inequality. For covariance matrices satisfying ∥Γ∥op≤1−c, a continuity bound ∥ρΓ−ρΓ′∥1≤[2c(2−c)]−1/2∥Γ−Γ′∥F yields a matching single-copy rate for fixed c, using matchgate shadows, and thermal-state error certificates.
For a passive bosonic class with total mean photon number at most one, a second-quantisation reduction to bounded-block qudit tomography gives Ω(m3/[ϵ2log(m/ϵ)]) single-copy complexity, versus collective Θ(m2/ϵ2). Removing the logarithmic loss is stated conditionally.
The worst-case fermionic single-copy rate remains between m3 and m4 in mode scaling, with near-pure modes unresolved. Memory tradeoffs and unrestricted bosonic upper bounds are not settled. A two-mode illustration achieves Fisher trace 5 versus the separable ceiling 4; its hardware witness exceeds 4 under prescribed-preparation and common-channel assumptions, without bounding preparation systematics.
Chen, Mele, Mele and Preskill proved a crossover for bosonic Gaussian tomography: cold states need Θ(m3/ε2) copies under single-copy or few-copy measurements, warm ones Θ(m2/ε2). The author proved Ω(m3/ε2) for adaptive single-copy tomography of mixed fermionic Gaussian states. This note shows the crossover has no fermionic counterpart and extends the fermionic bound to blocks of k copies. There is no warm regime: on the quadratic Gibbs balls β∥h∥F≤β0 of unknown Hamiltonian h, the single-copy rate is Θ(m3/ε2) for every fixed β0>0, at accuracies that resolve the ball, with a lower-bound constant independent of β0. At the maximally mixed state a replicated-parameter Fisher budget gives N>m3/(8,553,600kε2) for blocks of at most k copies and all ε≤1/3600; an exact formula for the maximal block Fisher information, via spinor tensor powers of so(2m), shows that the budget mt2 behind it is asymptotically attained for every fixed block size; whether 1/k is the true rate is open. Near the vacuum, block protocols need Ω(m3/(ε2min{k,m})) copies, with no logarithm, via an exterior-power embedding of qudit tomography; parity superselection changes no rate, and number superselection costs nothing on number-conserving inputs. The embedding also carries upper bounds: a particle-number measurement followed by the k-copy qudit protocol of Nayak and Zhou attains the lower bound for every k on number-conserving fermionic Gaussian states with bounded fugacity trace and on passive bosonic Gaussian states with bounded photon number, and a heterodyne stage that undoes displacement and squeezing extends this to all cold bosonic Gaussian states. This closes their k-entangled gap on the cold class; intermediate temperatures remain open.
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 ε trace distance with high probability. We prove a lower bound of Ω(n3/ε2) for Gaussian measurements, matching the best known upper bound up to doubly-log energy dependence, and Ω(n2/ε2) for arbitrary measurements. We further show an upper bound of 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) 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 ε total variation distance. Our results significantly advance quantum learning theory in the bosonic regimes and have practical impact in quantum sensing and benchmarking applications.
We study state tomography when each measurement acts on at most k fresh copies and no quantum memory is retained between blocks. We prove a lower bound matching the upper bound in [arXiv:2510.07788]. Thus the copy complexity of estimating an arbitrary d-dimensional state to trace distance ε is, up to absolute constant factors, max{d3/(kε2),d2/ε2} for every k and all sufficiently small ε. This removes the earlier restriction that k be small as a function of the accuracy. The lower bound applies to arbitrary measurements within each block and adaptive choices between blocks. The lower bound already applies in a small neighborhood of any state whose smallest eigenvalue is of order 1/d, even when the center is known.
The main ingredient is a uniform Fisher information bound for one measurement block that depends only on the smallest eigenvalue of the state. The proof avoids the perturbative expansion responsible for the restriction in [arXiv:2402.16353]. Fano's inequality for metric balls and a log-Sobolev comparison between mutual and Fisher information then reduce the adaptive protocol to this block bound [arXiv:1607.00550, arXiv:1902.08582].
With single-copy measurements, every mixed fermionic Gaussian state on m modes, pure modes included, is learned to trace distance ε from Θ(m3/ε2) copies, with no logarithmic factor, against the known Θ(m2/ε2) for collective measurements. We prove the upper bound, resolving Conjecture 10.1 of arXiv:2609.23189 (lower bound for ε≤1/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{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/k (k≤m) away from the pure boundary, against 1/k on cold number-conserving states, is therefore attained. For bosonic Gaussian states with bounded covariance, any displacement and squeezing, and occupations n1≤⋯≤nm, O((m2+r3+∑i,j>r1/(ni+nj))/ε2) single-copy measurements suffice, r the largest index with rnr≤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) and centred pure m-mode states from O(m2/ε2) single copies, free of the loglogE term of Gaussian measurements, and m-mode states from O(m3/ε2) copies, entangled only in a first round on blocks of 4m+6.
We determine the optimal sample complexity of low-rank quantum state tomography when each measurement may act jointly on at most t samples. For sufficiently small ε, estimating an unknown state on Cd of rank at most r to trace norm error ε with constant success probability requires, and is achievable with, Θ(ε2drmax{1,tr}) samples. The lower bound allows the protocol to choose each joint measurement adaptively using all previous classical outcomes; the matching upper bound is nonadaptive. Thus joint measurements on at most t samples improve the complexity of algorithms making single-sample measurements by at most a factor t. Further, measuring order r2 samples jointly is necessary and sufficient to attain the unrestricted collective rate.
For the lower bound, we vary the support of a state with fixed uniform spectrum and bound the Fisher information trace of every joint measurement on t samples. The adaptive Fisher chain rule and the van Trees inequality then give the trace norm lower bound. For the upper bound, we construct and analyze a nonadaptive tomography protocol based on a Gaussian joint measurement. An explicit second moment identity and a conditional Gaussian law outside the state's support give a rank-dependent error analysis, yielding the matching rate.
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 loglogE, 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 loglogE 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(n2/ε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.