Zero-counting lower bounds and measured K–ε curves for approximate Gaussian rank

We study how many Gaussian components a continuous-variable quantum state needs, adopting the approximate Gaussian rank framework of Hahn–Takagi–Ferrini–Yamasaki and the fidelity-ball relaxation of the stellar-rank literature; no novelty is claimed for the definitions. For mixed states we formulate the measure-theoretic ess-sup rank roof over generalized ensembles and prove its attainment and Gaussian-channel monotonicity — a partial answer, on the rank side, to the discrete-versus-continuous decomposition question the cited work leaves open. Our main contributions are three. First, for single-mode dictionaries of bounded common-squeezing Gaussian atoms, we prove zero-counting lower bounds: robust zeros of a target's Bargmann function survive fidelity-ball perturbation and are counted against an exponential-sum zero budget. The dictionary restriction is provably forced — counterexample families show no bound on the unrestricted rank can follow from raw disk zero counts alone. Second, an inequivalence theorem: the thermal lossy cat of our earlier preprint has Gaussian rank at most 2 yet no finite-rank pre-loss operator representation at any efficiency, separating two natural compressibility notions in one direction. Third, measured curves: family-constrained approximation residuals and a real-data rank proxy on public GKP homodyne data, and a robust-zero census for finite-energy GKP states in which all three computed configurations support the lower-bound premises for the untruncated comb. The census is numerically supported, not computer-certified (float64 without outward rounding; numerical root-finding); a machine-checked claim register binds every quoted number to committed artifacts. Multimode extension and a general-squeezing plateau conjecture remain open.

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-07-30
DOI
https://doi.org/10.5281/zenodo.21698699
Primary Topic
Quantum Computing Algorithms and Architecture
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Zero-counting lower bounds and measured K–ε curves for approximate Gaussian rank

Wataru Kawashima
Zenodo (CERN European Organization for Nuclear Research)
Quantum Computing Algorithms and Architecture
article

Zero-counting lower bounds and measured K–ε curves for approximate Gaussian rank

Wataru Kawashima
article en

Abstract

We study how many Gaussian components a continuous-variable quantum state needs, adopting the approximate Gaussian rank framework of Hahn–Takagi–Ferrini–Yamasaki and the fidelity-ball relaxation of the stellar-rank literature; no novelty is claimed for the definitions. For mixed states we formulate the measure-theoretic ess-sup rank roof over generalized ensembles and prove its attainment and Gaussian-channel monotonicity — a partial answer, on the rank side, to the discrete-versus-continuous decomposition question the cited work leaves open. Our main contributions are three. First, for single-mode dictionaries of bounded common-squeezing Gaussian atoms, we prove zero-counting lower bounds: robust zeros of a target's Bargmann function survive fidelity-ball perturbation and are counted against an exponential-sum zero budget. The dictionary restriction is provably forced — counterexample families show no bound on the unrestricted rank can follow from raw disk zero counts alone. Second, an inequivalence theorem: the thermal lossy cat of our earlier preprint has Gaussian rank at most 2 yet no finite-rank pre-loss operator representation at any efficiency, separating two natural compressibility notions in one direction. Third, measured curves: family-constrained approximation residuals and a real-data rank proxy on public GKP homodyne data, and a robust-zero census for finite-energy GKP states in which all three computed configurations support the lower-bound premises for the untruncated comb. The census is numerically supported, not computer-certified (float64 without outward rounding; numerical root-finding); a machine-checked claim register binds every quoted number to committed artifacts. Multimode extension and a general-squeezing plateau conjecture remain open.

Zenodo (CERN European Organization for Nuclear Research)
Peace, Justice and strong institutions
Openalex Percentile: Top 7%
Quantum Computing Algorithms and Architecture
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.