The log log jam in Gaussian state tomography

Qi Ye; Sitan Chen; Weiyuan Gong; Zhihan Zhang

Gaussian measurements force a log-log energy cost in continuous-variable tomography, while non-Gaussian ones can remove it entirely.

Reviewed by Pith at T0; open to challenge. T0 means a machine referee read the full paper against a public rubric. the ladder, T0–T4 →

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗

T0 review · grok-4.5

2026-07-15 01:48 UTC pith:GBLP5T6J

load-bearing objection Abstract-only claims of a fundamental log-log jam for all Gaussian measurements look clean and answer named open questions, but the modeling assumptions that make the lower bound load-bearing cannot be checked. the 4 major comments →

arxiv 2607.12983 v1 pith:GBLP5T6J submitted 2026-07-14 quant-ph cs.DSmath-phmath.MP

The log log jam in Gaussian state tomography

Sitan Chen , Weiyuan Gong , Qi Ye , Zhihan Zhang This is my paper

classification quant-ph cs.DSmath-phmath.MP

keywords Gaussian state tomographycontinuous-variable quantum informationsample complexityGaussian measurementsadaptivitynon-Gaussian measurementsenergy constraintbosonic systems

verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

This paper establishes that the familiar log-log dependence on energy E in Gaussian-state tomography is not an artifact of analysis but a hard lower bound on every protocol that uses only Gaussian measurements, even when those measurements may be entangled across modes or chosen adaptively. In continuous-variable quantum systems the state space is infinite-dimensional, so without an energy cutoff the sample complexity of tomography can be unbounded; Gaussian states themselves have finite descriptions, yet the best previous rates still grew with log log E. The authors show that this growth is forced by the Gaussian measurement class itself, give a matching upper bound that smoothly interpolates between the number of adaptive rounds and the residual energy dependence, and then demonstrate that highly entangled non-Gaussian measurements (or even a single-copy canonical phase measurement) can eliminate the energy dependence completely, recovering the familiar O(n^{2}/ε^{2}) sample complexity for pure n-mode Gaussian states. The results therefore separate the physical role of energy from the informational role of measurement non-Gaussianity and adaptivity, clarifying when continuous-variable learning can match its finite-dimensional counterparts.

Core claim

Any protocol restricted to Gaussian measurements—possibly entangled and adaptive—must incur a log-log E factor in the sample complexity of learning energy-E Gaussian states, while highly entangled non-Gaussian measurements (or even the single-copy canonical phase POVM) can learn pure Gaussian states with sample complexity independent of E.

What carries the argument

The Gaussian measurement class (closed under entanglement and adaptive choice) together with the energy-E constraint that effectively discretizes the continuous-variable problem; the lower bound shows this class cannot extract the full parameter information without a residual log-log E cost, while non-Gaussian measurements break the obstruction.

Load-bearing premise

The argument treats Gaussian measurements as a closed class under all operations the protocol is allowed to perform and takes the energy bound E as the sole physical cutoff that keeps the continuous-variable problem finite.

What would settle it

Exhibit a Gaussian-measurement protocol (even adaptive and multi-mode entangled) whose sample complexity for energy-E pure Gaussian states is o(log log E), or prove that every non-Gaussian protocol still requires some energy dependence.

Watch this falsifier — get emailed when new claim-graph text bears on it.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit.

Desk Editor's Note

Abstract-only claims of a fundamental log-log jam for all Gaussian measurements look clean and answer named open questions, but the modeling assumptions that make the lower bound load-bearing cannot be checked.

read the letter

The punchline is that this abstract asserts a clean separation: any Gaussian measurement protocol (even adaptive or entangled) for energy-E Gaussian states must pay log log E samples, while highly entangled non-Gaussian measurements remove the energy dependence entirely and give O(n^{2}/ε^{2}) for n-mode pure states. That would settle several open questions from prior work on continuous-variable tomography.

What looks new and useful is the package of four concrete claims: the universal Gaussian lower bound, a matching adaptive tradeoff that interpolates with the number of rounds, the energy-independent non-Gaussian upper bound, and a simple single-mode phase-POVM protocol that also kills the E dependence. If the proofs hold, this clarifies when energy is an unavoidable cost versus an artifact of the measurement class, and it cleanly separates Gaussian from non-Gaussian power in the learning setting.

The soft spot is exactly what the stress-test flags and what any abstract-only read forces: we cannot verify the two modeling choices that carry the lower bound—whether the class of Gaussian measurements stays closed under the adaptive and entangling operations the protocol is allowed, and whether the energy cutoff E is the only regularization that keeps the continuous-variable problem finite-dimensional. Those are load-bearing; if either is looser than claimed, the “fundamental jam” evaporates. Circularity looks low (pure information-theoretic bounds, no data fitting), and the statements themselves are coherent, but soundness is simply uncheckable from the abstract.

This is for people already working on quantum learning theory or continuous-variable tomography who care about sample-complexity lower bounds and the role of magic/entanglement. It is not a broad-audience paper. It deserves a serious referee: the claimed resolutions of open questions are sharp enough that a journal should send it out rather than desk-reject, even if the referee ends up demanding tighter definitions of the measurement class. I would not cite it yet, and I would only bring it to reading group once the full proofs appear.

Referee Report

4 major / 3 minor

Summary. The manuscript studies the sample complexity of learning energy-bounded Gaussian states in continuous-variable systems. From the abstract, the central claims are: (1) any protocol restricted to Gaussian measurements—even entangled or adaptive ones—must incur a log log E factor in sample complexity, answering open questions from prior work; (2) there is a smooth tradeoff between the number of adaptive rounds and the energy dependence, with a matching protocol; (3) highly entangled non-Gaussian measurements learn n-mode pure Gaussian states with O(n²/ε²) samples independent of E, answering a question of Chen et al.; (4) the single-copy Holevo–Helstrom canonical phase POVM learns single-mode pure Gaussian states with O(1/ε²) samples, again independent of E. The abstract frames these as clarifying the role of energy and the interplay of adaptivity, entanglement, and non-Gaussianity (magic) in bosonic tomography.

Significance. If the claimed lower and upper bounds hold as stated, the work would settle several named open questions in continuous-variable quantum learning and establish a fundamental limitation of the Gaussian-measurement class. The E-independent rates via non-Gaussian measurements, and the adaptive tradeoff with matching protocol, would be substantial contributions: they separate the roles of entanglement, adaptivity, and magic, and give a clean information-theoretic picture of when energy dependence is unavoidable. Parameter-free scalings of the form O(n²/ε²) and O(1/ε²) are particularly valuable if rigorously established. Significance is therefore high conditional on the proofs.

major comments (4)

Only the abstract was available for this review; no definitions, lemmas, reductions, or proofs could be checked. The central lower-bound claim—that every protocol using Gaussian measurements (including entangled and adaptive ones) must incur log log E—is load-bearing and cannot be verified from the abstract alone. A full technical assessment requires the manuscript body.
Abstract claim (1): the lower bound for the full class of Gaussian measurements (entangled/adaptive) depends on how that class is formalized and whether it is closed under the adaptive and entangling operations a protocol may perform. Without the modeling section and reduction lemmas, it is impossible to confirm that adaptive choice of Gaussian measurements cannot bypass the log-log factor. This is a correctness-risk concern for the strongest claim.
Abstract claim (1)–(2): the energy bound E is treated as the sole physical cutoff that keeps the continuous-variable problem finite-dimensional. Whether log log E is fundamental, or sensitive to the precise regularization, is load-bearing for the claimed jam. The full text must make the necessity of this cutoff explicit and show that alternative cutoffs do not remove the factor under Gaussian measurements.
Abstract claims (3)–(4): the E-independent upper bounds via highly entangled non-Gaussian measurements and via the Holevo–Helstrom phase POVM are equally load-bearing for the paper’s narrative (that magic removes the jam). Sample-complexity analyses and measurement constructions are not checkable from the abstract; these must be verified before the independence of E can be accepted.

minor comments (3)

Abstract: the phrase “smooth tradeoff between the number of rounds of adaptivity and the energy dependence” is clear at a high level but would benefit from an explicit asymptotic form (e.g., dependence on r rounds) already in the abstract for readers scanning results.
Abstract: “magic” is used in the closing sentence without a one-line gloss; a brief parenthetical linking it to non-Gaussian resources would help non-specialists.
Abstract: open questions are attributed to “a number of previous works” and to “Chen et al.”; full citations and precise statement of those questions should appear early in the introduction of the full manuscript.

Circularity Check

0 steps flagged

No circularity detectable from abstract-only review of information-theoretic sample-complexity bounds

full rationale

The abstract presents information-theoretic lower and upper bounds on sample complexity for Gaussian state tomography. The claimed log-log E lower bound for any Gaussian measurements (including entangled/adaptive) and the E-independent upper bounds for non-Gaussian measurements are framed as fundamental limitations and matching protocols, with E and ε as external parameters. No equations, fitted parameters, self-definitional reductions, or load-bearing self-citations appear in the available text. The results answer open questions from prior works rather than redefining quantities in terms of themselves. Because only the abstract is provided, no derivation chain can be walked to exhibit a concrete reduction (Eq. X = Eq. Y by construction, or fitted input renamed as prediction). Residual modeling concerns about measurement-class closure or energy cutoffs are correctness/assumption issues, not circularity. Default expectation of no significant circularity applies; score 0 with empty steps is the honest finding.

Axiom & Free-Parameter Ledger

0 free parameters · 4 axioms · 0 invented entities

Abstract-only; free parameters and invented entities cannot be exhaustively audited. The central claims rest on standard continuous-variable quantum mechanics, the usual definition of Gaussian states and Gaussian measurements, and an energy cutoff E that renders the problem finite. No new physical entities are introduced; the novelty is complexity-theoretic.

axioms (4)

domain assumption Continuous-variable quantum systems are modeled by bosonic modes with Gaussian states fully characterized by first and second moments.
Standard CV quantum information; invoked throughout the abstract as the setting of the tomography problem.
domain assumption An energy bound E is a sufficient physical constraint to make sample complexity of Gaussian-state tomography well-defined and finite.
Abstract treats E as the sole cutoff that previously produced log-log dependence; load-bearing for both lower and upper bounds.
domain assumption Gaussian measurements form a well-defined class closed under entanglement across modes and adaptive choice.
Required for the claim that every protocol using only Gaussian measurements incurs log-log E cost.
standard math Standard quantum information-theoretic sample-complexity and POVM formalism (including Holevo–Helstrom phase POVM).
Background mathematical toolkit assumed for stating O(n²/ε²) and O(1/ε²) rates.

pith-pipeline@v1.1.0-grok45 · 6192 in / 2339 out tokens · 29282 ms · 2026-07-15T01:48:09.092773+00:00 · methodology

0 comments

read the original abstract

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 / \epsilon^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/\epsilon^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.

The log log jam in Gaussian state tomography

Core claim

What carries the argument

Load-bearing premise

What would settle it

discussion (0)