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
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.
We ask which finite classical or quantum memory is sufficient to generate the predictions of a stochastic process. Starting from its Hankel kernel
Hp(u,v)=p(uv), we define causal cone rank by globally shift-compatible cone lifts of the canonical predictive realization. Within a specified realization class, the physical carrier minimum equals the corresponding minimum compatible lift dimension. The framework separates unconstrained Hankel rank, classical nonnegative realizations, and quantum completely positive instruments, and extends to action--outcome processes with interventionwise normalization. A declared linear coarse state has exactly
dimker(C∣imHp) missing predictive coordinates. Finite temporal cuts give nonnegative- and positive-semidefinite-rank witnesses; an explicit two-time family exhibits a growing exact classical--quantum dimension gap, while its fixed-tolerance classical cost remains bounded. For an exact finite-dimensional time-homogeneous Markovian dilation, reset-conditioned closure rank obeys
rcl≤dS2(dE2−1), with a saturating qubit--qubit example. We give nonasymptotic singular-value tests, while emphasizing that numerical rank and unconstrained truncated singular expansions do not themselves certify a physical realization.
Exact physical memory is an unstable target: a process of Hankel rank one can be arbitrarily close to processes requiring larger classical and quantum carriers. We make this obstruction quantitative and then identify the extra structure under which a physical finite-sample upper theorem is possible. First, on a stationary binary Markov family whose mixing gap is uniformly at least one half, every estimator of exact linear rank, minimum classical memory, or minimum quantum Hilbert dimension has worst-case error at least 3/8 at local separation
Θ([N(L−1)]−1/2) from the rank-one model. The smallest nonzero singular value of an explicit Hankel core is proportional to the same parameter. Thus a spectral or dynamical margin is necessary even under rapid mixing. Second, finite Hankel data determine a minimum linear realization only up to similarity, whereas nonnegativity and complete positivity are not invariant under a generic similarity. We give an exact two-state counterexample and then formulate the missing assumption as a calibrated physical core. For an invertible core
H, all shifts are recovered in one basis by
A~a=H~−1H~a. An explicit perturbation theorem, followed by Choi positive-part projection and one common trace-preserving correction, returns a genuine quantum instrument. A direct-query finite-sample corollary controls its error uniformly over adaptive policies and exposes every dependence on core conditioning, physical calibration, horizon, and confidence. The resulting linear-in-horizon coefficient is first-order sharp: a one-state classical process attains the exact discrepancy
1−(1−Δ/2)L at one-step diamond radius
Δ. Third, we prove a compact-state classicalization theorem. Any finite-dimensional physical memory described by a compact base-norm state space has, at horizon
L and operational error
η>0, a classical realization whose number of states is the seeded covering number at radius
2η/L, uniformly over adaptive policies. For a
d-dimensional quantum instrument this gives, for
d≥2,
(1+η2(1−d−1)L)d2−1 states, with no extra transient state; one state suffices for
d=1. The ambient exponent
d2−1 is optimal for universal trace-norm discretization, while a compact branch-invariant reachable set replaces it by its own metric entropy. Consequently, an unbounded exact quantum/classical memory separation cannot remain unbounded at fixed
d,
L,
η. Robust quantum advantage must instead be quantified as a joint precision–horizon tradeoff. Deterministic verification code audits the mixing lower bound, the similarity-gauge counterexample, common-shift recovery, physical repair, and finite-net 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.
A coarse description of a dynamical system generally fails to evolve autonomously: evolving and coarse-graining in different orders gives different predictions, and the compressed propagator fails the semigroup law. We show that this path dependence is the observable boundary of missing state. For a finite continuous-time Markov chain with generator
L, coarse channel
C, and stochastic section
R satisfying
CR=I, define
P=RC,
Q=I−P, and
K=CLR. The exact coarse propagator
Tt=CetLR obeys a Volterra equation with memory kernel
M(t)=CLQetQLQQLR. Every memory jet
M(k)(0) is recursively recoverable from the short-time derivatives of
Tt alone. The rank of the block Hankel operator
H∞=(M(i+j)(0))i,j≥0 is exactly the smallest number of auxiliary linear state variables required to turn the coarse dynamics into an exact autonomous, time-homogeneous system. A minimal completion is constructible by Ho--Kalman factorization and is unique up to similarity. If
d=min{k:M(k)(0)=0}, then every smooth classical
f-divergence generically scales as
t2d+4. Exact Markov examples realize exponents
4,6,8 and closure ranks
1,2,3. We also derive finite-sample singular-value certificates for hidden predictive coordinates, including a matrix-Bernstein bound with intrinsic-variance control. Finally, histories are identified when they induce the same future law under every admissible intervention, yielding the minimal counterfactual predictive state. The results turn coarse-graining into a constructive state-completion problem and separate ordinary linear realization from the harder requirement of a positive or Markov realization.