Causal Query Compression for Lindblad Dynamics: Optimal Queries and Nearly Linear Local Simulation

We construct a causal query compiler for time-dependent Lindblad dynamics and establish query and gate bounds under distinct input models. With coherent block encodings of the Hamiltonian and individual jump operators, a Lipschitz generator can be simulated to diamond-norm error epsilon using O(1+τ+ (1/epsilon)/ (e+ (1/epsilon)/τ)) controlled queries, where τ=T(α H+ sum μα μ 2). This bound is independent of the time-grid size and is worst-case optimal for τ 1. Weak active entry and clean return yield a factorial history tail; combining two reuse lengths removes the auxiliary input. A three-call polar correction supplies the Lindblad cells. The compiler also characterizes the minimum oracle action of bounded adaptive Markovian protocols by quantum query complexity and the general adversary bound, up to constant factors. For finite-range dynamics on n lattice sites, efficient coherent evaluation of the local matrices and fixed local parameters give O(n(T+1) polylogX) elementary gates, where X= e,n(T+1)(1+K t+B)/epsilon, for piecewise Hölder generators with fixed exponent, local variation bound K t, and at most B breakpoints per term. The jumps need not commute. This gate bound includes evaluation, arithmetic, selection, routing, and environment storage. Its proof combines a spatial decomposition on a common bath, compilation on occupied inputs, and routing on compressed records. Reusing bath storage between short segments gives depth (T+1) polylogX and space n polylogX.