Quantum algorithms simulate linear Volterra integro-differential equations exponentially faster in system size when memory is weak (M<1), with a matching hardness result for strong memory and efficient handling of sum-of-exponentials kernels.
PRX quantum , volume=
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
quant-ph 1years
2026 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Quantum simulation of non-Markovian dynamical systems
Quantum algorithms simulate linear Volterra integro-differential equations exponentially faster in system size when memory is weak (M<1), with a matching hardness result for strong memory and efficient handling of sum-of-exponentials kernels.