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

Finite Realizations and Effective Memory in Nonlinear Quantum Filtering

Abstract

Nonlinear dynamics generate non-Gaussian states and operations, but they also make continuously monitored quantum systems difficult to track. A quantum filter performs this task by compressing a noisy measurement record into a set of evolving variables that predict future observables. For Gaussian dynamics, this compression is exact and finite. In nonlinear systems, conventional moment equations generally expand without bound, but the failure of one representation does not prove that every finite description is impossible. Here we formulate quantum filtering as a realization problem for general quantum input--output maps. We introduce the linearized observable Hankel operator KO, which maps changes in the past measurement record to changes in a future conditional observable. Any finite-dimensional smooth filter forces KO to have finite rank, so infinite rank provides a coordinate-independent proof that no exact finite-dimensional filter exists. Applied to single-mode polynomial bosonic systems under continuous quadrature monitoring, this yields a sharp boundary: Gaussian dynamics and the measurement-aligned Conditional Momentum Moment class admit finite realizations, whereas dynamics outside these classes produce infinitely many response directions and admit no finite-dimensional smooth exact filter. Exact impossibility, however, need not imply large practical complexity. The singular values of KO quantify how many response directions matter at a chosen local accuracy, defining the effective memory of an observable. For the Kerr and Duffing oscillators, these singular values decay rapidly despite infinite exact rank, showing that infinite exact memory can coexist with low finite-accuracy complexity. The framework therefore separates exact realizability from effective complexity in nonlinear quantum filtering.

Related

  1. Finite-temperature transition-window weights on a fault-tolerant quantum computer: duplex filtering on a thermal purification
    Yujin Tang, Yunlong Liu, Miao Xu +1
    arXivPreprintarXiv licenceFull textQuantum physics & quantum informationarXiv
  2. Nonlinear filtering stabilizations for the quasi-geostrophic equations
    Lander Besabe, Sachin Kumar, Annalisa Quaini
    arXivPreprintarXiv licenceFull textNumerical analysis & scientific computingComputational physicsarXiv
  3. A Second-Order Asymptotic Expansion for Nonlinear Filtering in the Lorenz--63 System
    Masahiro Kurisaki, Kota Takeda
    arXivPreprintarXiv licenceFull textProbabilityStatistical & nonlinear physicsarXiv
  4. Extensibly Causally Separable Processes Admit Realizations as Quantum Circuits with Classical Control of Causal Order
    Wenjie Wei, Shengshi Pang
    arXivPreprintarXiv licenceFull textQuantum physics & quantum informationarXiv
  5. Robustness-based bounds for approximate joint realizations of incompatible quantum channels
    Shintaro Minagawa, Ryo Takakura, Kensei Torii
    arXivPreprintarXiv licenceFull textQuantum physics & quantum informationarXiv
BibTeX
@misc{emerson2026finite,
  title = {{Finite Realizations and Effective Memory in Nonlinear Quantum Filtering}},
  author = {Jacob Emerson},
  howpublished = {arXiv},
  year = {2026},
  month = oct,
  doi = {10.48550/arxiv.2609.09663},
  eprint = {2609.09663},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2609.09663},
  note = {CC BY 4.0},
}
RIS
TY  - UNPB
TI  - Finite Realizations and Effective Memory in Nonlinear Quantum Filtering
AU  - Jacob Emerson
PY  - 2026
DA  - 2026/10/10
PB  - arXiv
DO  - 10.48550/arxiv.2609.09663
UR  - https://arxiv.org/abs/2609.09663
AB  - Nonlinear dynamics generate non-Gaussian states and operations, but they also make continuously monitored quantum systems difficult to track. A quantum filter performs this task by compressing a noisy measurement record into a set of evolving variables that predict future observables. For Gaussian dynamics, this compression is exact and finite. In nonlinear systems, conventional moment equations generally expand without bound, but the failure of one representation does not prove that every finite description is impossible. Here we formulate quantum filtering as a realization problem for general quantum input--output maps. We introduce the linearized observable Hankel operator K_O, which maps changes in the past measurement record to changes in a future conditional observable. Any finite-dimensional smooth filter forces K_O to have finite rank, so infinite rank provides a coordinate-independent proof that no exact finite-dimensional filter exists. Applied to single-mode polynomial bosonic systems under continuous quadrature monitoring, this yields a sharp boundary: Gaussian dynamics and the measurement-aligned Conditional Momentum Moment class admit finite realizations, whereas dynamics outside these classes produce infinitely many response directions and admit no finite-dimensional smooth exact filter. Exact impossibility, however, need not imply large practical complexity. The singular values of K_O quantify how many response directions matter at a chosen local accuracy, defining the effective memory of an observable. For the Kerr and Duffing oscillators, these singular values decay rapidly despite infinite exact rank, showing that infinite exact memory can coexist with low finite-accuracy complexity. The framework therefore separates exact realizability from effective complexity in nonlinear quantum filtering.
ER  -