arXiv:2609.20721
Quantum Simulation of Dissipative Non-Markovian Coupled Classical Oscillators
Malte Schade, Sophia Simon, Nathan Wiebe, Scott Keating, Cyrill Bösch, Andreas Fichtner
Abstract
We present a quantum algorithm for simulating classical oscillator networks characterized by non-Markovian dissipation and time-varying material properties, extending recent speedups for undamped harmonic systems to viscoacoustic and viscoelastic media. We embed the history-dependent dynamics into a Markovian state space governed by a non-Hermitian operator by approximating memory kernels through a Prony series. We then use linear combination of Hamiltonian simulation to estimate the instantaneous kinetic and potential energy for a subset of oscillators at time $t$ within error $ε$ using a number of queries to the oscillator system that scales as $\widetilde{\mathcal{O}}(α_{\rm tot} t/ε)$, where $α_{\rm tot}$ is polynomial in the strength of the dissipation, spring constants, inverse masses, and sparsity of the connections in the network. We further show that this energy estimation task is in the worst-case classically hard (i.e., a corresponding decision problem is $\mathsf{BQP}$-complete), even in the presence of strong dissipation. For time-dependent materials, we show that changes in material properties appear as effective dissipation or growth in the energy representation. Additionally, we prove the infeasibility of exponential quantum advantages in locally coupled topologies through a novel form of Lieb-Robinson-like bounds that apply to differential equations. This allows our quantum algorithms to provide quartic speedups for locally coupled damped oscillator systems in three dimensions, raising the possibility of practical quantum speedups for realistically damped oscillator networks and approximated wave equations.
AI Summary
The paper asks how quantum simulation of classical oscillator networks extends to memory-dependent dissipation, external sources, and time-varying materials, and when speedups survive classical locality-based algorithms. It represents completely monotonic memory kernels by positive Prony sums of $C$ decaying exponentials, introducing auxiliary Maxwell-force variables to obtain a Markovian linear system. An energy-metric transformation gives a generator $iH+L$, with $H$ Hermitian and $L\succeq0$. Explicit block encodings combined with linear combination of Hamiltonian simulation estimate subsystem energy, normalized by an initial/source energy bound, to additive error $\varepsilon$ using $\widetilde{\mathcal O}(t(\alpha_H+\alpha_L)/\varepsilon)$ oracle queries, with polylogarithmic dependence on network size. Preparing the normalized evolved state separately incurs an inverse-final-norm overhead. A Feynman–Kitaev reduction establishes $\mathsf{BQP}$-completeness of deciding substantial total-energy loss when a $1/\operatorname{polylog}(M)$ fraction of masses is strongly damped. The proof controls non-normal spectral evolution. Separately, Lieb–Robinson-like bounds for source-driven differential equations yield classical light-cone truncation algorithms costing roughly $\widetilde{\mathcal O}(t^{D+1})$ for fixed local observables on $D$-dimensional lattices. Thus, linear-time quantum evolution allows at most a quartic temporal scaling advantage in three dimensions; uniformly positive damping reduces classical time dependence to polylogarithmic. Time-varying masses and stiffnesses produce effective damping/growth terms; direct simulation requires the resulting dissipator to remain positive semidefinite. Limitations include assumed efficient oracle/state access, restricted kernels and linear dynamics, and damping-related readout costs. No practical end-to-end advantage is established; hardness with a constant strongly damped fraction remains open.
We declare the use of LLMs for text revision as well as proof assistance and verification.
Central claim may not hold: The abstract claims quartic quantum speedups in three dimensions, but the paper compares quantum and classical upper bounds and establishes no quartic separation from the best classical algorithm. The abstract excludes exponential advantages for locally coupled topologies without the compact, constant-dimensional observable restriction required by its classical-simulation corollary.
Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.
- Comments
- 59 pages, 7 figures