{
  "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=\\mathbb E[\\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.",
  "abstract_shown": true,
  "affiliations": [],
  "article_type": null,
  "arxiv": "2610.33607",
  "author_total": 1,
  "authors": [
    {
      "name": "Abhishek Chowdhury"
    }
  ],
  "bibtex": "https://research.draconitic.com/paper/97ehhmcw4r9hs.bib",
  "cited_by": 0,
  "doi": "10.48550/arxiv.2610.33607",
  "fulltext_url": null,
  "id": "97ehhmcw4r9hs",
  "issns": [],
  "landing_url": "https://arxiv.org/abs/2610.33607",
  "language": null,
  "licence": "CC-BY-4.0",
  "licence_label": "CC BY 4.0",
  "licence_source": "article",
  "licence_url": "http://creativecommons.org/licenses/by/4.0/",
  "metadata_licence": "CC0-1.0",
  "native_subjects": [
    [
      "arxiv",
      "hep-th"
    ],
    [
      "arxiv",
      "math-ph"
    ],
    [
      "arxiv",
      "math.MP"
    ],
    [
      "arxiv",
      "physics.optics"
    ],
    [
      "arxiv",
      "quant-ph"
    ],
    [
      "openalex",
      "1702|Quantum Computing Algorithms and Architecture"
    ]
  ],
  "openalex": "W7223891861",
  "pdf_url": "https://arxiv.org/pdf/2610.33607",
  "pmcid": null,
  "pmid": null,
  "published": "2026-10-24",
  "publisher": null,
  "ris": "https://research.draconitic.com/paper/97ehhmcw4r9hs.ris",
  "sources": [
    {
      "first_seen": "2026-10-30T12:35:35Z",
      "native_id": "2610.33607",
      "source": "arxiv",
      "url": "https://arxiv.org/abs/2610.33607"
    }
  ],
  "subjects": [
    {
      "field": "mathematics",
      "origin": "arxiv:math-ph",
      "subfield": "mathematical-physics"
    },
    {
      "field": "physics",
      "origin": "arxiv:hep-th",
      "subfield": "high-energy"
    },
    {
      "field": "physics",
      "origin": "arxiv:physics.optics",
      "subfield": "optics-photonics"
    },
    {
      "field": "physics",
      "origin": "arxiv:quant-ph",
      "subfield": "quantum"
    }
  ],
  "title": "Krylov geometry and optimal recovery under uncertain coherent noise",
  "title_text": "Krylov geometry and optimal recovery under uncertain coherent noise",
  "type": "preprint",
  "updated_at": "2026-10-30T12:35:40Z",
  "url": "https://research.draconitic.com/paper/97ehhmcw4r9hs",
  "venue": "arXiv",
  "versions": []
}