Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2609.09663

Finite Realizations and Effective Memory in Nonlinear Quantum Filtering

Jacob Emerson

quant-phSubmitted Sep 9, 2026• Announced Sep 10, 2026• 0 citations• Revised Oct 10, 2026 (v3)
v1 · Sep 9, 2026v2 · Sep 26, 2026v3 · Oct 10, 2026
arXivHTMLPDF

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 $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.

Comments
25 pages, 5 figures

Related papers

Exact Conditional Momentum Moments for Nonlinear Homodyne Trajectories

Jacob Emerson

Simulation of nonlinear stochastic master equations generally requires trajectory-level evolution of large Hilbert-space density matrices, making strongly nonlinear continuously monitored systems computationally challenging. Here we identify an exactly solvable class centered on polynomial Hamiltonians of commuting quadratures with linear damping and homodyne measurement of those same quadratures. For initial states with a Gaussian measured-quadrature marginal and polynomial conditional-momentum sections, we derive an exact finite stochastic representation through any fixed momentum order. The result extends to interacting multimode systems, arbitrary measurement efficiency, and finite thermal occupation. Its computational cost is linear in trajectory length and independent of Hilbert-space dimension, requiring no Fock-space truncation, Gaussian approximation, or approximate moment closure. As an application, we derive an exact causal filter for monitored cubic-phase gates that uses the homodyne record to determine the variance-minimizing momentum displacement. Numerical simulations validate the representation against direct stochastic-master-equation evolution, demonstrate substantial speedups over converged Fock-space propagation, and show that this record-conditioned recentering can efficiently recover nonlinear squeezing otherwise lost through trajectory averaging.

quant-pharXiv:2607.26093•Jul 29, 2026•0 citations

Lie-Algebraic Classical Simulation of Bosonic Systems Beyond Gaussian Dynamics

Adelina Bärligea, Timothy Heightman, Jakob S. Kottmann +1 more

Classical simulability is ultimately determined by both the dynamics of a quantum system and the observables being evaluated. Lie-algebraic simulation exploits the latter to make exact polynomial-time classical simulations by propagating observables through low-dimensional invariant operator spaces. However, its conventional formulation in terms of polynomial-dimensional dynamical Lie algebras does not directly accommodate bosonic systems as their algebras are neither compact nor semisimple. In this contribution, we overcome this limitation, making bosonic systems accessible to the Lie-algebraic programme of exact polynomial-time classical simulation. We prove that expectation values, fixed-order correlation functions, including multi-time correlators and out-of-time-ordered correlators, and gradients are efficiently computable whenever their operator modules have polynomial dimension. This recovers Gaussian quantum optics and extends it to non-Gaussian input states, while identifying exact polynomial regimes of interacting non-Gaussian dynamics including bounded-photon Kerr and pair-hopping Hamiltonians and nilpotent polynomial phase dynamics. We show that unlike in the finite-dimensional spin and fermionic setting treated previously, a finite-dimensional bosonic generator algebra alone does not guarantee finite observable dynamics. We further derive a controlled perturbative hierarchy for squeezing beyond exact sector confinement and confirm the predicted error orders numerically. We also evaluate operator spreading on interacting chains of up to $400$ modes and connect a topological doublon band with flux-reversed edge motion. These results provide a unified formalism for classifying, discovering, and systematically approximating tractable bosonic quantum dynamics with classical polynomial-time simulation.

quant-pharXiv:2608.17094•Aug 19, 2026•0 citations

Finite-Resolution Position Measurements and Their Sharp Limit Detector POVMs, Instruments, and the MTT Completion Boundary

Peter Nero

Measurement is an ordinary physical interaction. Its mathematical description nevertheless has several layers: an effect-valued measure gives outcome probabilities, an instrument also gives conditional post-interaction states, a realized record requires an outcome-completion rule, and later dynamics may stabilize that record. This paper constructs the first two layers exactly for finite-resolution position detection and keeps the latter two distinct. On the square-integrable Hilbert space over Euclidean position space, a normalized detector response defines a commutative positive operator-valued measure that is precisely a classical smearing of the sharp position projection-valued measure. Its outcome density is the convolution of the detector response with the sharp Born density, and converges in total variation to that density. For densities with one integrable weak derivative, an explicit error bound separates detector resolution, detector shape, and spatial variation of the input. A square-root instrument realizes the same effects and produces a finite post-measurement filter. For a Gaussian response, detector blur adds exactly epsilon squared times the identity to the outcome covariance. A two-outcome qubit example shows that finite unsharp effects converge in operator norm to a discrete projective measurement, so not every projective measurement is a distributional singularity. In Modal Triplet Theory, these results supply a rigorous downstream detector interface. They do not derive the instrument from selected geometry, select one realized outcome, or identify detector width with a coherence or Ornstein-Uhlenbeck floor.

•Jul 29, 2026•0 citations

Exact finite-dimensional reduction of Wigner dynamics for open quantum systems using EGQPDs

Peng Guo

Abstract Simulating non-Gaussian quantum dynamics in open continuous-variable systems is notoriously challenging: exact methods scale exponentially, while approximations sacrifice non-classical features such as Wigner negativity. Here we introduce an exact finite-dimensional reduction that overcomes this curse of dimensionality. We prove that the algebra of extended Gaussian quasi-probability densities (EGQPDs) is closed under Lindblad evolution with linear jump operators, reducing the infinite-dimensional Wigner PDE to a closed system of ODEs that scales polynomially with the number of modes. A necessary and sufficient condition for closure is established: the algebra remains closed iff every jump operator is at most linear; otherwise the extended algebra with polynomial prefactors is required. We further show that the minimal number of Gaussian components defines a non-Gaussian rank—a discrete complexity measure monotonically non-increasing under the dynamics. The framework yields explicit ODEs for the component parameters, admits a rigorous density theorem and error propagation bound, and provides closed-form algebraic criteria for Gaussianity, purity, and entanglement. Seven numerical experiments validate the method across Gaussian and non-Gaussian states, entanglement decay, PT-symmetric exceptional-point dynamics, and complexity scaling, demonstrating machine-precision accuracy and exponential speedups over grid and Fock methods. The EGQPD framework provides a systematic, exact, and efficient toolbox for non-Gaussian open quantum dynamics.

Quantum Science and Technology•Jul 28, 2026•0 citations

Bosonic Quantum Computational Complexity

Ulysse Chabaud, Michael Joseph, Saeed Adel Mehraban +1 more

Quantum computing involving physical systems with continuous degrees of freedom, such as the quantum states of light, has recently attracted significant interest. However, a well-defined quantum complexity theory for these bosonic computations over infinite-dimensional Hilbert spaces is missing. In this work, we lay foundations for such a research program. We introduce natural complexity classes and problems based on bosonic generalizations of BQP, the local Hamiltonian problem, and QMA. We uncover several relationships and subtle differences between standard Boolean classical and discrete variable quantum complexity classes and identify outstanding open problems. In particular: 1. We show that the power of quadratic (Gaussian) quantum dynamics is equivalent to the class BQL. More generally, we define classes of continuous-variable quantum polynomial time computations with a bounded probability of error based on higher-degree gates. Due to the infinite dimensional Hilbert space, it is not a priori clear whether a decidable upper bound can be obtained for these classes. We identify complete problems for these classes and demonstrate a BQP lower and EXPSPACE upper bound. We further show that the problem of computing expectation values of polynomial bosonic observables is in PSPACE. 2. We prove that the problem of deciding the boundedness of the spectrum of a bosonic Hamiltonian is co-NP-hard. Furthermore, we show that the problem of finding the minimum energy of a bosonic Hamiltonian critically depends on the non-Gaussian stellar rank of the family of energy-constrained states one optimizes over: for constant stellar rank, it is NP-complete; for polynomially-bounded rank, it is in QMA; for unbounded rank, it is undecidable.

arXiv:2410.04274•Quantum•May 20, 2026•1 citation

Exact Minimal Observable Realizations and Hankel Matrix Realization for Four-Qubit Lindblad Systems

John Strother

This research announcement establishes the exact minimal observable realizations and underlying Hankel operator dimensions for an open four-qubit system governed by a finite-dimensional Lindblad master equation. We present complete numerical and algebraic validation showing that the minimal realization dimension (\(r_{\min }\)) undergoes a discrete structural transition between two distinct parameter values. Under exact rational arithmetic calculations evaluated over a finite field (\(\bmod\ 1,000,003\)), the system's output dynamics compress to a closed invariant subspace of exactly 21 dimensions at the baseline parameter state (\(a = 0.6\)), and expands to exactly 23 dimensions under a perturbed configuration (\(a = 0.601\)). This rank change rigorously indicates an exceptional parameter-space bifurcation. This post serves as an official time-stamped registration of these specific realization limits, verifying the exact dimensions of the observable manifolds prior to the publication of full derivation proofs and physical hardware tracking datasets.

•Oct 15, 2026•0 citations
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 KOK_OKO​, which maps changes in the past measurement record to changes in a future conditional observable. Any finite-dimensional smooth filter forces KOK_OKO​ 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 KOK_OKO​ 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.
Simulation of nonlinear stochastic master equations generally requires trajectory-level evolution of large Hilbert-space density matrices, making strongly nonlinear continuously monitored systems computationally challenging. Here we identify an exactly solvable class centered on polynomial Hamiltonians of commuting quadratures with linear damping and homodyne measurement of those same quadratures. For initial states with a Gaussian measured-quadrature marginal and polynomial conditional-momentum sections, we derive an exact finite stochastic representation through any fixed momentum order. The result extends to interacting multimode systems, arbitrary measurement efficiency, and finite thermal occupation. Its computational cost is linear in trajectory length and independent of Hilbert-space dimension, requiring no Fock-space truncation, Gaussian approximation, or approximate moment closure. As an application, we derive an exact causal filter for monitored cubic-phase gates that uses the homodyne record to determine the variance-minimizing momentum displacement. Numerical simulations validate the representation against direct stochastic-master-equation evolution, demonstrate substantial speedups over converged Fock-space propagation, and show that this record-conditioned recentering can efficiently recover nonlinear squeezing otherwise lost through trajectory averaging.
Classical simulability is ultimately determined by both the dynamics of a quantum system and the observables being evaluated. Lie-algebraic simulation exploits the latter to make exact polynomial-time classical simulations by propagating observables through low-dimensional invariant operator spaces. However, its conventional formulation in terms of polynomial-dimensional dynamical Lie algebras does not directly accommodate bosonic systems as their algebras are neither compact nor semisimple. In this contribution, we overcome this limitation, making bosonic systems accessible to the Lie-algebraic programme of exact polynomial-time classical simulation. We prove that expectation values, fixed-order correlation functions, including multi-time correlators and out-of-time-ordered correlators, and gradients are efficiently computable whenever their operator modules have polynomial dimension. This recovers Gaussian quantum optics and extends it to non-Gaussian input states, while identifying exact polynomial regimes of interacting non-Gaussian dynamics including bounded-photon Kerr and pair-hopping Hamiltonians and nilpotent polynomial phase dynamics. We show that unlike in the finite-dimensional spin and fermionic setting treated previously, a finite-dimensional bosonic generator algebra alone does not guarantee finite observable dynamics. We further derive a controlled perturbative hierarchy for squeezing beyond exact sector confinement and confirm the predicted error orders numerically. We also evaluate operator spreading on interacting chains of up to 400400400 modes and connect a topological doublon band with flux-reversed edge motion. These results provide a unified formalism for classifying, discovering, and systematically approximating tractable bosonic quantum dynamics with classical polynomial-time simulation.
Measurement is an ordinary physical interaction. Its mathematical description nevertheless has several layers: an effect-valued measure gives outcome probabilities, an instrument also gives conditional post-interaction states, a realized record requires an outcome-completion rule, and later dynamics may stabilize that record. This paper constructs the first two layers exactly for finite-resolution position detection and keeps the latter two distinct. On the square-integrable Hilbert space over Euclidean position space, a normalized detector response defines a commutative positive operator-valued measure that is precisely a classical smearing of the sharp position projection-valued measure. Its outcome density is the convolution of the detector response with the sharp Born density, and converges in total variation to that density. For densities with one integrable weak derivative, an explicit error bound separates detector resolution, detector shape, and spatial variation of the input. A square-root instrument realizes the same effects and produces a finite post-measurement filter. For a Gaussian response, detector blur adds exactly epsilon squared times the identity to the outcome covariance. A two-outcome qubit example shows that finite unsharp effects converge in operator norm to a discrete projective measurement, so not every projective measurement is a distributional singularity. In Modal Triplet Theory, these results supply a rigorous downstream detector interface. They do not derive the instrument from selected geometry, select one realized outcome, or identify detector width with a coherence or Ornstein-Uhlenbeck floor.
Abstract Simulating non-Gaussian quantum dynamics in open continuous-variable systems is notoriously challenging: exact methods scale exponentially, while approximations sacrifice non-classical features such as Wigner negativity. Here we introduce an exact finite-dimensional reduction that overcomes this curse of dimensionality. We prove that the algebra of extended Gaussian quasi-probability densities (EGQPDs) is closed under Lindblad evolution with linear jump operators, reducing the infinite-dimensional Wigner PDE to a closed system of ODEs that scales polynomially with the number of modes. A necessary and sufficient condition for closure is established: the algebra remains closed iff every jump operator is at most linear; otherwise the extended algebra with polynomial prefactors is required. We further show that the minimal number of Gaussian components defines a non-Gaussian rank—a discrete complexity measure monotonically non-increasing under the dynamics. The framework yields explicit ODEs for the component parameters, admits a rigorous density theorem and error propagation bound, and provides closed-form algebraic criteria for Gaussianity, purity, and entanglement. Seven numerical experiments validate the method across Gaussian and non-Gaussian states, entanglement decay, PT-symmetric exceptional-point dynamics, and complexity scaling, demonstrating machine-precision accuracy and exponential speedups over grid and Fock methods. The EGQPD framework provides a systematic, exact, and efficient toolbox for non-Gaussian open quantum dynamics.
Quantum computing involving physical systems with continuous degrees of freedom, such as the quantum states of light, has recently attracted significant interest. However, a well-defined quantum complexity theory for these bosonic computations over infinite-dimensional Hilbert spaces is missing. In this work, we lay foundations for such a research program. We introduce natural complexity classes and problems based on bosonic generalizations of BQP, the local Hamiltonian problem, and QMA. We uncover several relationships and subtle differences between standard Boolean classical and discrete variable quantum complexity classes and identify outstanding open problems. In particular: 1. We show that the power of quadratic (Gaussian) quantum dynamics is equivalent to the class BQL. More generally, we define classes of continuous-variable quantum polynomial time computations with a bounded probability of error based on higher-degree gates. Due to the infinite dimensional Hilbert space, it is not a priori clear whether a decidable upper bound can be obtained for these classes. We identify complete problems for these classes and demonstrate a BQP lower and EXPSPACE upper bound. We further show that the problem of computing expectation values of polynomial bosonic observables is in PSPACE. 2. We prove that the problem of deciding the boundedness of the spectrum of a bosonic Hamiltonian is co-NP-hard. Furthermore, we show that the problem of finding the minimum energy of a bosonic Hamiltonian critically depends on the non-Gaussian stellar rank of the family of energy-constrained states one optimizes over: for constant stellar rank, it is NP-complete; for polynomially-bounded rank, it is in QMA; for unbounded rank, it is undecidable.
This research announcement establishes the exact minimal observable realizations and underlying Hankel operator dimensions for an open four-qubit system governed by a finite-dimensional Lindblad master equation. We present complete numerical and algebraic validation showing that the minimal realization dimension (rmin⁡r_{\min }rmin​) undergoes a discrete structural transition between two distinct parameter values. Under exact rational arithmetic calculations evaluated over a finite field ( mod  1,000,003\bmod\ 1,000,003mod 1,000,003), the system's output dynamics compress to a closed invariant subspace of exactly 21 dimensions at the baseline parameter state (a=0.6a = 0.6a=0.6), and expands to exactly 23 dimensions under a perturbed configuration (a=0.601a = 0.601a=0.601). This rank change rigorously indicates an exceptional parameter-space bifurcation. This post serves as an official time-stamped registration of these specific realization limits, verifying the exact dimensions of the observable manifolds prior to the publication of full derivation proofs and physical hardware tracking datasets.