Skip to content
DraconiticResearch
Search Sources API
203,234 studies31 sourcesUpdated 18 min ago
PreprintCC BY 4.0arXiv

Finding Gaussian Structure in Bosonic States

Abstract

We study agnostic tomography of pure bosonic Gaussian states: given copies of an arbitrary n-mode bosonic state ρ, the goal is to output a pure Gaussian state whose infidelity with ρ is at most opt + ε, where opt is the minimum infidelity achievable by any pure Gaussian state. We give efficient protocols achieving this in both the high and low fidelity regimes. When opt is below some universal constant, our protocol has runtime and copy complexity which is strongly polynomial in $n, 1/ε$ and log log E, where E is the energy of the closest pure Gaussian state. For arbitrary opt, our protocol uses (n+1)poly(1/ε) poly(1+loglog(E)) copies and runtime. As a corollary, we obtain the first truly tolerant Gaussianity testing protocol for distinguishing whether opt > c + ε or opt < c − ε, for any threshold c∈(0,1). We also prove poly(n,1/ε) runtime is impossible, unless NP⊆BQP. Our protocols follow a shared paradigm: first, we iteratively use general Gaussian measurements combined with techniques from classical robust statistics to obtain a good warm start estimate, then we leverage non-Gaussian measurements to refine this warm start using convex and non-convex optimization methods. Interestingly, we prove that non-Gaussian measurements are necessary to match the strong agnostic guarantees we obtain, and in fact these guarantees are provably superior to what is possible for robustly estimating classical Gaussians.

Related

  1. Entangled measurements are necessary for optimal tomography of mixed fermionic Gaussian states and of bosonic Gaussian states near the vacuum
    Ron Rubin
    arXivPreprintarXiv licenceFull textMathematical physicsQuantum physics & quantum informationarXiv
  2. When are bosonic Gaussian states classical to learn?
    Senrui Chen, Antonio Anna Mele, Francesco Anna Mele +1
    arXivPreprintarXiv licenceFull textMathematical physicsQuantum physics & quantum informationarXiv
  3. The AECM Algorithm for Deterministic Maximum Likelihood Direction Finding in the Presence of Gaussian Mixture Noise
    Mingyan Gong, Bin Lyu
    arXivPreprintarXiv licenceFull textStatisticsarXiv
  4. Classical Capacity of Single-Mode Bosonic Gaussian Channels
    Gerardo Adesso, Ludovico Lami, Vittorio Giovannetti
    arXivPreprintCC BY 4.0Full textMathematical physicsQuantum physics & quantum informationarXiv
  5. Dynamical classical-field limit of Bosonic Gibbs states: Renormalized Hartree NLS correlations in 2D and 3D
    Phan Thành Nam, Rongchan Zhu, Xiangchan Zhu
    arXivPreprintarXiv licenceFull textAnalysis & PDEsMathematical physicsarXiv
BibTeX
@misc{arulandu2026finding,
  title = {{Finding Gaussian Structure in Bosonic States}},
  author = {Alvan Arulandu and Sitan Chen and Ziyun Chen and Jerry Li and Eric Ma},
  howpublished = {arXiv},
  year = {2026},
  month = oct,
  doi = {10.48550/arxiv.2610.06810},
  eprint = {2610.06810},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2610.06810},
  note = {CC BY 4.0},
}
RIS
TY  - UNPB
TI  - Finding Gaussian Structure in Bosonic States
AU  - Alvan Arulandu
AU  - Sitan Chen
AU  - Ziyun Chen
AU  - Jerry Li
AU  - Eric Ma
PY  - 2026
DA  - 2026/10/05
PB  - arXiv
DO  - 10.48550/arxiv.2610.06810
UR  - https://arxiv.org/abs/2610.06810
AB  - We study agnostic tomography of pure bosonic Gaussian states: given copies of an arbitrary n-mode bosonic state ρ, the goal is to output a pure Gaussian state whose infidelity with ρ is at most opt + ε, where opt is the minimum infidelity achievable by any pure Gaussian state. We give efficient protocols achieving this in both the high and low fidelity regimes. When opt is below some universal constant, our protocol has runtime and copy complexity which is strongly polynomial in $n, 1/ε$ and log log E, where E is the energy of the closest pure Gaussian state. For arbitrary opt, our protocol uses (n+1)^poly(1/ε) poly(1+loglog(E)) copies and runtime. As a corollary, we obtain the first truly tolerant Gaussianity testing protocol for distinguishing whether opt > c + ε or opt < c − ε, for any threshold c∈(0,1). We also prove poly(n,1/ε) runtime is impossible, unless NP⊆BQP. Our protocols follow a shared paradigm: first, we iteratively use general Gaussian measurements combined with techniques from classical robust statistics to obtain a good warm start estimate, then we leverage non-Gaussian measurements to refine this warm start using convex and non-convex optimization methods. Interestingly, we prove that non-Gaussian measurements are necessary to match the strong agnostic guarantees we obtain, and in fact these guarantees are provably superior to what is possible for robustly estimating classical Gaussians.
ER  -