Skip to content
DraconiticResearch
Search Sources API
186,631 studies31 sourcesUpdated 33 min ago
PreprintCC BY 4.0arXiv

Krylov geometry and optimal recovery under uncertain coherent noise

Abstract

Recovery from a coherent rotation with an unobserved angle depends on both the encoding and what calibration reveals about the noise. We determine their combined limit for a known finite-dimensional generator and one final recovery. Two polynomial projections organize the answer. A physical Krylov chain separates correctable error amplitudes from their first state-dependent distortion; projection onto lower-angle powers identifies the part that a coherent decoder can cancel. Under explicit rank and moment conditions, their combination gives the exact leading optimal entanglement infidelity at weak noise and a recovery attaining it for any finite logical dimension. The optimal worst-input error lies between one and d times that infidelity at leading order, for logical dimension d. When the angle distribution is unknown, we optimize one decoder for every distribution compatible with the calibration. When spectral and calibration frequencies are integer multiples of a common frequency, moment positivity turns this into an exact finite optimization. Small measured means can still allow rare finite rotations. If the sole calibration datum is βr=𝔼[sin2r(θ/2)], with θ the wrapped rotation phase at that common frequency, the optimal worst-prior infidelity is O(βr) exactly when generator powers through degree r−1 are correctable. When the first uncorrectable power has degree m<r, the optimal loss scales as βrm/r, with a sharp coefficient fixed by a universal moment problem. In a loss-free four-photon memory, population measurements at two calibration durations retain the fully informed quartic error coefficient for a fixed symmetric narrow-noise family with positive variance and finite fourth moment; a single duration permits loss quadratic in the noise width.

Related

  1. Reconstruction of Binary Linear Systems and Profile Geometry of Sparse Krylov Strata
    Yangcheng Li
    arXivPreprintarXiv licenceFull textAlgebra & number theoryarXiv
  2. Optimal Inflow Control for Transport Equations with Uncertain Velocities and Demand
    Simone Göttlich, Thomas Schillinger
    arXivPreprintarXiv licenceFull textOptimisation & controlarXiv
  3. Optimal spectral shrinkage via Krylov approximation
    Tianfeng Lu, Geoffrey J. Goodhill, Hong Hu
    arXivPreprintCC BY 4.0Full textStatisticsarXiv
  4. Geometry and observability of latent texture-coherence diffusions in coherent sea-clutter radar observations
    Arnaud Coatanhay, Angélique Drémeau
    arXivPreprintarXiv licenceFull textProbabilityarXiv
  5. Global recovery of Lorentzian principal geometry from the hyperbolic Dirichlet-to-Neumann map
    Lu Chen, Yan Jiang, Hongyu Liu +1
    arXivPreprintarXiv licenceFull textAnalysis & PDEsarXiv
BibTeX
@misc{chowdhury2026krylov,
  title = {{Krylov geometry and optimal recovery under uncertain coherent noise}},
  author = {Abhishek Chowdhury},
  howpublished = {arXiv},
  year = {2026},
  month = oct,
  doi = {10.48550/arxiv.2610.33607},
  eprint = {2610.33607},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2610.33607},
  note = {CC BY 4.0},
}
RIS
TY  - UNPB
TI  - Krylov geometry and optimal recovery under uncertain coherent noise
AU  - Abhishek Chowdhury
PY  - 2026
DA  - 2026/10/24
PB  - arXiv
DO  - 10.48550/arxiv.2610.33607
UR  - https://arxiv.org/abs/2610.33607
AB  - Recovery from a coherent rotation with an unobserved angle depends on both the encoding and what calibration reveals about the noise. We determine their combined limit for a known finite-dimensional generator and one final recovery. Two polynomial projections organize the answer. A physical Krylov chain separates correctable error amplitudes from their first state-dependent distortion; projection onto lower-angle powers identifies the part that a coherent decoder can cancel. Under explicit rank and moment conditions, their combination gives the exact leading optimal entanglement infidelity at weak noise and a recovery attaining it for any finite logical dimension. The optimal worst-input error lies between one and d times that infidelity at leading order, for logical dimension d. When the angle distribution is unknown, we optimize one decoder for every distribution compatible with the calibration. When spectral and calibration frequencies are integer multiples of a common frequency, moment positivity turns this into an exact finite optimization. Small measured means can still allow rare finite rotations. If the sole calibration datum is β_r=𝔼[sin^2r(θ/2)], with θ the wrapped rotation phase at that common frequency, the optimal worst-prior infidelity is O(β_r) exactly when generator powers through degree r−1 are correctable. When the first uncorrectable power has degree m<r, the optimal loss scales as β_r^m/r, with a sharp coefficient fixed by a universal moment problem. In a loss-free four-photon memory, population measurements at two calibration durations retain the fully informed quartic error coefficient for a fixed symmetric narrow-noise family with positive variance and finite fourth moment; a single duration permits loss quadratic in the noise width.
ER  -