Pith. sign in

REVIEW 2 major objections 4 minor 81 references

Quantum simulation of non-Markovian dynamical systems

T0 review · 2 major / 4 minor · reviewed 2026-08-14 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read For linear Volterra integro-differential equations, weak memory gives exponential quantum speedup, strong memory is provably hard, and structured kernels bypass the barrier via Markovianization.

desk verdict Solid quantum-algorithm paper for non-Markovian VIDEs: the general-kernel results and the lower bound are genuine, but the abstract overstates the structured-kernel scope. read the letter →

arxiv 2608.13533 v1 pith:3OFZAK2N submitted 2026-08-13 quant-ph

Abtin Ameri , Arkopal Dutt , Hari Krovi This is my paper · ORCID
classification quant-ph MSC 65R2081P68
keywords quantumsimulationVolterraintegro-differentialequationsnon-MarkoviandynamicsmemorykernellinearsystemsalgorithmslowerboundsMori-Zwanzigformalismsumofexponentials
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

This paper claims that quantum computers can efficiently simulate linear Volterra integro-differential equations, the standard model of dynamics with memory, and it maps the boundary of what is tractable. The authors introduce a dimensionless memory strength $\mathsf M = \frac{1}{|\mu(A)|}\int_0^\infty \|K(x)\|\,dx$; when $\mathsf M<1$ (the short-term memory regime), the discretized VIDE becomes a well-conditioned linear system solvable by a quantum linear-system algorithm with complexity polynomial in $T$, $\|A\|$, and $1/\varepsilon$ — an exponential speedup in the system dimension over classical solvers. When $\mathsf M\ge 1$, they prove a matching obstruction: for a family of generic kernels, any bounded-error quantum simulator needs $e^{\Omega(T)}$ copies of the initial condition, because the dynamics itself amplifies the distinguishability of nearly identical states. The obstruction disappears for structured kernels $K(x)=-k(x)I$ that are $L^1$-approximable by positive real exponentials: Markovianization replaces the history integral by auxiliary ODE variables, and existing quantum ODE solvers run efficiently even with $\mathsf M\ge1$, including for the singular power-law kernel $x^{-\beta}$. This matters for systems with memory in open quantum dynamics, viscoelasticity, epidemiology, and reduced-order modeling, where classical time-stepping must couple every step to all previous ones.

What carries the argument

The load-bearing objects are the memory strength $\mathsf M$ and the Markovianized ODE operator. $\mathsf M<1$ is what makes the VIDE stable (Lemma 3.2) and makes the discretized matrix $L$ well conditioned (Theorem 4.10), turning the whole trajectory into a QLSA instance. Markovianization is the named mechanism for structured kernels: if $k(x)\approx\sum_{j=1}^{s} w_j e^{-\gamma_j x}$ with $w_j,\gamma_j>0$, the auxiliary variables $y_j(t)=\sqrt{w_j}\int_0^t e^{-\gamma_j(t-\tau)}u(\tau)\,d\tau$ satisfy first-order ODEs, so the VIDE becomes $dy/dt=\mathcal{A}y+c$ with a block matrix as in Eq. (251). The scalar structure is what makes the similarity-transformed Hermitian part negative semidefinite (Claim 6.5), giving the exponential-norm bound $C(\mathcal{A})\le C_{\mathrm{Lp}}(A)$ that feeds all structured-kernel complexity estimates.

What would settle it

Take the two-state VIDE from Lemma 5.2 but replace the scalar kernel with a matrix-valued kernel $K(x)=e^{-\gamma x}B$ with $B$ not proportional to $I$, and run the Markovianization of Eq. (251). The claim to check is whether the enlarged ODE operator still satisfies the Lyapunov inequality $PA+A^\dagger P\preceq0$; for generic $B$ the off-diagonal blocks are not simultaneously diagonalized by the similarity transformation, so one should search for a concrete $B$ where no such $P$ exists — that would falsify the structured-kernel branch as stated.

Watch

Extended reading notes

Core claim

The paper's central claim is that linear convolution Volterra integro-differential equations $\frac{du}{dt} = Au + \int_0^t K(t-\tau)u(\tau)\,d\tau + b$ are quantumly simulable exactly in the regime fixed by the memory strength $\mathsf M = \frac{1}{|\mu(A)|}\int_0^\infty \|K(x)\|\,dx$. For $\mathsf M<1$ and $A$ dissipative, forward-Euler time stepping plus a left Riemann sum gives the recurrence $u_{j+1}=(I+Ah)u_j+h^2\sum_{k<j}K((j-k)h)u_k+hb$, which is a block lower-triangular linear system $Ly=c$ whose solution is the full history state; Theorem 4.10 bounds $\kappa(L)\le 3(m+p+1)$, so a QLSA prepares the history or final states with polynomial complexity (Theorems 4.1 and 4.2). For $\mathsf M\ge1$, Theorem 5.3 shows that a two-dimensional example with kernel $e^{-\gamma x}\,\mathrm{diag}(0,1)$ separates $1-\epsilon$-overlapping initial states to constant distance in $O(\log(1/\epsilon))$ time, forcing $e^{\Omega(T)}$ copies of the initial condition in any bounded-error simulation. The escape route is Theorem 6.2: for scalar kernels $K(x)=-k(x)I$ with $k$ approximated by $s$ positive real exponentials, introducing one auxiliary variable per exponential turns the VIDE into a linear ODE of dimension $(s+1)N$ whose exponential growth is controlled by a Lyapunov-stability constant; applying a quantum ODE solver yields polynomial complexity for the power-law kernel $k(x)=x^{-\beta}$, $0<\beta<1$, even though this kernel has $\mathsf M=\infty$.

Load-bearing premise

For the algorithms that work when memory is not weak, the kernel must be scalar ($K(x)=-k(x)I$) and $k$ must be well approximated by a few positive real exponentials; if the true kernel is matrix-valued, these algorithms no longer apply.

Editorial extensions

If this is right

  • For every VIDE with $\mathsf M<1$ and efficient oracles for $A$, $K$, $u_0$, and $b$, the paper's algorithm prepares the history state with $O\left((\Lambda+\Xi T)^2 T^4\, g^{-2}\,\log(1/\varepsilon)/\varepsilon^2\right)$ queries and the final state with an additional $g/q$ factor, an exponential speedup in system dimension over classical solvers.
  • The $\mathsf M\ge1$ lower bound uses only a two-dimensional example, so any future general algorithm for strong memory must either exploit kernel structure or consume exponentially many copies of the initial condition.
  • Structured scalar kernels, including the weakly singular power-law kernel $x^{-\beta}$ with $\beta\in(0,1)$, are efficiently simulable with complexity polynomial in $T$, $\|A\|$, $1/\varepsilon$, and $1/(1-\beta)$ for fixed $\beta$, despite having $\mathsf M=\infty$.
  • In the Mori-Zwanzig coarse-graining application, the derived VIDE satisfies the short-term memory condition whenever the coupling between resolved and unresolved blocks is small: $\|L_{M\bar M}\|\,\|L_{\bar M M}\|/(|\mu_M\mu_{\bar M}|)<1$ (Claim 7.1), so the general-kernel algorithm applies directly.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • If the scalar restriction on structured kernels were relaxed to matrix-valued kernels, the Lyapunov analysis of Claim 6.5 would stop working: off-diagonal blocks $\sqrt{w_j}B$ no longer commute with the similarity transformation. A direct test is to search for the positive definite $P$ in Claim 6.5 when $B$ is not proportional to $I$; this is an extension the paper does not make.
  • The $\mathsf M<1$ condition is structurally parallel to the convergence condition for linearizing nonlinear ODEs (ratio of nonlinearity to dissipation), suggesting a broader principle: quantum speedups for dissipative dynamics depend on a weakness ratio, and memory or nonlinearity that amplifies state distinguishability is what triggers hardness.
  • The paper's outlook explicitly identifies complex-exponential decompositions as the next step, so the natural extension is to test whether $\gamma_j$ with $\mathrm{Re}\,\gamma_j>0$ but nonzero imaginary parts preserve the Hermitian-part bound; the Gaussian kernel, common in non-Markovian models, would be the first target.
  • Because the lower-bound construction is only two-dimensional and analytically solvable, the same distinguishability-amplification mechanism may transfer to bilinear Volterra equations, yielding lower bounds analogous to those for quadratically nonlinear ODEs.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

2 major / 4 minor

Summary. The paper develops quantum algorithms for linear convolution Volterra integro-differential equations (VIDEs) of the form du/dt = Au + integral_0^t K(t-tau)u(tau)d tau + b. It defines a memory-strength parameter M and proves a stability bound for M<1. It then discretizes the VIDE into a block lower-triangular linear system and applies a quantum linear system algorithm, obtaining history-state and final-state algorithms whose complexity is polynomial in T, ||A||, 1/epsilon, and derivative norms of K, and whose condition number is shown to grow linearly in the number of time steps. A state-discrimination argument gives an exponential-in-T lower bound for general-kernel final-state simulation when M>=1. For structured kernels K=-k I with k approximated by positive real exponentials, the paper introduces Markovianization into a larger linear ODE and applies quantum ODE solvers, including a power-law kernel specialization. It closes with an application to the linear Mori-Zwanzig formalism using the general-kernel algorithm.

Significance. The technical core is substantial and appears internally consistent. The stability lemma (Lemma 3.2), the discretization error bound (Lemma 4.7), the condition-number bound (Theorem 4.10), and the lower-bound construction (Lemma 5.2 and Theorem 5.3) are detailed and check out. The Markovianization analysis for scalar sum-of-exponentials kernels is a useful addition to the quantum differential-equation toolkit, and the paper is careful to state many of its hypotheses in the technical sections. The principal weakness is that the advertised scope of the structured-kernel results is broader than the proven statements: the algorithms require scalar kernels, positive real exponential weights, and a homogeneous right-hand side, while the abstract and the informal results do not carry these qualifications. Because the proofs rest on the scalar structure, this is not merely a wording issue, but it is fixable within the paper's framework.

major comments (2)
  1. [§6.1.2–§6.2 (Definition 6.1, Eq. (251), Claim 6.5, Theorems 6.2, 6.10, 6.14)] The structured-kernel algorithms are restricted to scalar kernels K(x)=-k(x)I with positive real exponential weights and rates and to the homogeneous case b=0, but the abstract and Section 1.2 describe them as 'structured kernels which admit concise decompositions over exponentials' without these qualifiers. This is load-bearing: the off-diagonal blocks in the Markovianized ODE, Eq. (251), are -sqrt(w_j)I, and Claim 6.5's argument that P^{1/2} A P^{-1/2} has negative-semidefinite Hermitian part relies on those blocks being scalar multiples of the identity. For a matrix-valued kernel K(x)=sum_j B_j e^{-gamma_j x}, the analogous blocks are B_j, which are not simultaneously reduced by a block-diagonal P, and the bound C(A) <= Clp(A) need not hold. The Mori-Zwanzig kernel in Eq. (302), K(x)=L_{M\bar M} e^{L_{\bar M\bar M} x} L_{\bar M M}, is generically matrix-valued, so Section 6's Markovianization does not apply to it; Section 7 correctly falls back on the Section 4 algorithm, but the abstract's wording invites the contrary reading. The abstract, Results 1.6–1.7, and Theorem 6.2 should state the scalar, positive-real-exponential, and b=0 hypotheses explicitly.
  2. [Theorem 6.2 and §6.2.5] Theorem 6.2 is stated for K(x)=-k(x)I and b=0, and the power-law results (Theorem 6.14 and Corollary 6.15) inherit the homogeneous restriction. Neither the abstract nor Results 1.6 and 1.7 mention this restriction. The proofs of Claims 6.8 and 6.9 use the homogeneous evolution y(t)=e^{At}y(0) to bound post-selection probabilities; replacing b=0 by a nonzero forcing term changes both the norm bounds and the success-probability estimates, so the extension is not immediate. The paper should state the b=0 restriction in the abstract and in the informal main results.
minor comments (4)
  1. [§6.2.3, Claim 6.7] Claim 6.7 uses p := floor(p(epsilon_soe)), whereas Definition 6.1 and Theorem 6.2 define p := ceil(p(epsilon_soe)); the floor should be a ceiling to avoid a contradiction in the order parameter.
  2. [§6.1.1, Eq. (245)] For K(x)=e^{-gamma x}B with arbitrary matrix B, the Markovianized off-diagonal blocks should be +I and +B, or the sign convention should be written as K=-e^{-gamma x}B; as printed, the signs in Eq. (245) do not match the preceding warm-up derivation.
  3. [Theorem 4.1] The definition of epsilon_max in Theorem 4.1 uses alpha and beta, but these parameters are not introduced in the theorem statement; they should be defined there or the statement should refer explicitly to Lemma 4.4.
  4. [Definition 6.1] Definition 6.1 reuses m for the number of exponentials after m was used for the number of time steps elsewhere; this notational collision can confuse the reader and would be worth removing.

Circularity Check

0 steps flagged · score 0.0 of 10

No significant circularity: the VIDE-to-linear-system and Markovianization reductions are self-contained; the only author-overlapping citation (quantum ODE solver [DCTK26]) is an external tool whose stated assumptions do not include the target results.

full rationale

The paper's derivation chain is not circular. The general-kernel algorithm (Section 4) discretizes the VIDE, builds a block lower-triangular linear system L, block-encodes it from the given oracles for A and K, and invokes a QLSA; the condition-number bound is proven from the short-term memory condition M<1 (Lemma 3.5, Theorem 4.10) rather than assumed. The structured-kernel results (Section 6) define structured kernels via an external sum-of-exponentials approximation (Definition 6.1, citing [Li10], [BM05], etc.), introduce auxiliary variables to convert the VIDE into an equivalent ODE (Eq. 251), and then call a previously published quantum ODE solver (Theorem 2.9, [DCTK26]) whose assumptions concern linear ODEs with block-encoding access and do not include the VIDE results claimed here. That citation overlaps with the present authors (Dutt and Krovi) but it is an independent, parameter-free theorem used as a subroutine, so it does not make the argument circular. The lower bound (Section 5) is built on a self-contained two-dimensional example and established state-discrimination lower bounds, not on the paper's own algorithms. No fitted parameter is renamed as a prediction, and no uniqueness or ansatz is smuggled in by self-citation. The abstract does overstate the structured-kernel scope: Definition 6.1 requires scalar K(x)=-k(x)I, b=0, and positive real exponentials, while the abstract says only 'structured kernels which admit concise decompositions over exponentials,' and the Mori-Zwanzig kernel (Eq. 302) is matrix-valued; however, the paper itself acknowledges these restrictions in the Outlook ('The SOE decomposition currently only works when each of the exponentials are real-valued'), and this is a scope limitation rather than a circular reduction.

Assumptions & free parameters 2 free parameters · 5 assumptions · 0 invented entities

The paper's central claims depend on oracle assumptions, prior quantum algorithms used as black boxes, the short-term memory and strict dissipativity regime for the general-kernel algorithm, and the scalar plus sum-of-exponentials restriction for structured kernels. None of these are fitted to the target result; they are standard computational assumptions or clearly stated problem restrictions. No new physical or mathematical entities are postulated; the auxiliary variables in Markovianization are standard ODE state-expansion variables.

free parameters (2)
  • SOE approximation weights {w_j} and rates {γ_j} = Determined by approximation theorems (e.g., Li10)
    Introduced in Definition 6.1 to replace the kernel k(x) by a sum of exponentials. The complexity of Theorem 6.2 depends on ω=Σw_j and γ_max, so these parameters control the algorithm's cost; they are chosen to meet an L1 error target and are not derived from the VIDE solution.
  • SOE order p and power-law cutoff δ = p=O((log(1/ε)+log(1/δ))^2), δ=O((εT)^{1/(1-β)})
    For the power-law kernel (Theorem 6.14), δ truncates the singular kernel at 0 and p sets the approximation order. These are chosen to meet the L1 error target and drive the reported complexity.
assumptions (5)
  • domain assumption Efficient block-encodings for A and K(jh) and state preparation oracles O_u, O_b are available (Problems 1.1 and 1.2).
    All complexity claims are conditional on these oracles; the exponential speedup is in system size given efficient input circuits.
  • domain assumption The quantum linear systems algorithm (Theorem 2.8, [CAS+22]) and the quantum ODE solver (Theorems 2.9 and 2.10, [DCTK26]) are correct as stated.
    Used as black boxes; [DCTK26] shares an author with this paper. No machine-checked proof or code is provided for these subroutines.
  • domain assumption For the general-kernel algorithm, the Markovian part is strictly dissipative (µ(A)<0) and the memory strength satisfies M<1.
    Definition 3.1 and Lemmas 3.2 and 3.5 require these; the algorithm's stability and condition-number bounds fail without them.
  • domain assumption Structured kernels are scalar, K(x)=-k(x)I, and k is L1-approximable by positive real exponentials (Definition 6.1).
    Needed for the auxiliary-variable Markovianization and the Lyapunov bound in Claims 6.3 to 6.5; excludes matrix-valued kernels.
  • standard math The power-law kernel x^{-β} admits an SOE approximation with order O((log(1/ε)+log(1/δ))^2) and positive weights and rates (Theorem 6.11, [Li10]).
    External theorem used to handle the weakly singular kernel in Theorem 6.14.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Quantum simulation of non-Markovian dynamical systems." pith.science (2026). https://pith.science/paper/3OFZAK2N

@misc{pith2026260813533,
  author       = {Pith},
  title        = {Pith review of: Quantum simulation of non-Markovian dynamical systems},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/3OFZAK2N}},
  note         = {Machine review of arXiv:2608.13533}
}
abstract

Existing quantum algorithms for simulating dynamical systems -- from Hamiltonian simulation to linear and nonlinear differential equations solvers -- simulate Markovian dynamics, in which the system's future evolution depends solely on its current state. We turn our attention to developing quantum algorithms for non-Markovian dynamical systems where the system's future evolution depends on its past history and thus has memory. Specifically, we develop efficient algorithms for linear Volterra integro-differential equations (VIDEs) with a convolution memory kernel that output a quantum state encoding the state description over a time interval or at a particular time. Given efficient circuits for the problem inputs, our algorithms achieve an exponential speedup in system size over existing classical algorithms. We develop an algorithm for general kernels assuming that $\textsf{M} < 1$, where $\textsf{M}$ characterizes the strength of the memory term relative to the dissipation of the Markovian part of the dynamics. We complement this with lower bounds for general-kernel VIDEs when $\textsf{M} \geq 1$, showing that the problem becomes intractable for a family of systems. However, by specializing to structured kernels which admit concise decompositions over exponentials, we develop efficient quantum algorithms even when $\textsf M \geq 1$ by converting the VIDE into a larger set of ODEs, a procedure which we call Markovianization. As an application of the overall framework, we discuss the Mori-Zwanzig formalism used in open quantum systems and fluid dynamics. Overall, our results expand the range of dynamical systems that quantum computers can simulate efficiently.

Figures

Figures reproduced from arXiv: 2608.13533 by the authors.

Figure 1
Figure 1. Numerical simulation of du dt = au+ R t 0 ke−γ(t−τ)u(τ )dτ with u(0) = 1, a = 1/2, and γ = 1. While the Markovian part of the dynamics is unstable (as shown by the dashed curve), adding a memory term can stabilize the overall dynamics and result in nontrivial behavior. where T is the time-ordering operator. There are numerous ways to discretize and approximate such an analytical solution, which has resulted in the v… view at source ↗
Figure 2
Figure 2. Illustration of the linear coarse-graining formalism for a three-dimensional dynamical system. While the full dynamics is Markovian and described by a linear ODE system, the projected dynamics is non-Markovian and described by a linear VIDE. 7.2 Quantum algorithm for the linear Mori-Zwanzig formalism We use the quantum algorithm in Section 4 to simulate Eq. (308). Our algorithm requires the short￾term memory conditi… view at source ↗

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

81 extracted references · 58 canonical work pages

  1. [1]

    Science , volume=

    Universal quantum simulators , author=. Science , volume=. 1996 , publisher=

    1996

  2. [2]

    Physical review letters , volume=

    Optimal Hamiltonian simulation by quantum signal processing , author=. Physical review letters , volume=. 2017 , publisher=

    work page 2017

  3. [3]

    Physical review letters , volume=

    Quantum algorithm for linear systems of equations , author=. Physical review letters , volume=. 2009 , publisher=

    2009

  4. [4]

    SIAM Journal on Computing , volume=

    Quantum algorithm for systems of linear equations with exponentially improved dependence on precision , author=. SIAM Journal on Computing , volume=. 2017 , publisher=

    2017

  5. [5]

    PRX quantum , volume=

    Optimal scaling quantum linear-systems solver via discrete adiabatic theorem , author=. PRX quantum , volume=. 2022 , publisher=

    work page 2022

  6. [6]

    ACM Transactions on Quantum Computing , volume=

    Quantum linear system solver based on time-optimal adiabatic quantum computing and quantum approximate optimization algorithm , author=. ACM Transactions on Quantum Computing , volume=. 2022 , publisher=

    2022

  7. [7]

    Fast evaluation of the

    Jiang, Shidong and Zhang, Jiwei and Zhang, Qian and Zhang, Zhimin , journal=. Fast evaluation of the. 2017 , publisher=

    work page 2017

  8. [8]

    Fast evaluation of the

    Yan, Yonggui and Sun, Zhi-Zhong and Zhang, Jiwei , journal=. Fast evaluation of the. 2017 , publisher=

    work page 2017

Show all 81 references
  1. [9]

    arXiv preprint arXiv:0812.4423 , year=

    A quantum algorithm to solve nonlinear differential equations , author=. arXiv preprint arXiv:0812.4423 , year=

    arXiv

  2. [10]

    Journal of Physics A: Mathematical and Theoretical , volume=

    High-order quantum algorithm for solving linear differential equations , author=. Journal of Physics A: Mathematical and Theoretical , volume=. 2014 , publisher=

    2014

  3. [11]

    Communications in Mathematical Physics , volume=

    Quantum algorithm for linear differential equations with exponentially improved dependence on precision , author=. Communications in Mathematical Physics , volume=. 2017 , publisher=

    2017

  4. [12]

    Quantum , volume=

    Improved quantum algorithms for linear and nonlinear differential equations , author=. Quantum , volume=. 2023 , publisher=

    2023

  5. [13]

    Quantum , volume=

    Time-marching based quantum solvers for time-dependent linear differential equations , author=. Quantum , volume=. 2023 , publisher=

    2023

  6. [14]

    Physical Review Letters , volume=

    Linear combination of hamiltonian simulation for nonunitary dynamics with optimal state preparation cost , author=. Physical Review Letters , volume=. 2023 , publisher=

    2023

  7. [15]

    arXiv preprint arXiv:2312.03916 , year=

    Quantum algorithm for linear non-unitary dynamics with near-optimal dependence on all parameters , author=. arXiv preprint arXiv:2312.03916 , year=

  8. [16]

    Simulating dynamics of

    Dutt, Arkopal and Chowdhury, Anirban and Temme, Kristan and Krovi, Hari , year=. Simulating dynamics of. 2604.26945 , primaryClass=

    arXiv

  9. [17]

    Proceedings of the National Academy of Sciences , volume=

    Efficient quantum algorithm for dissipative nonlinear differential equations , author=. Proceedings of the National Academy of Sciences , volume=. 2021 , publisher=

    2021

  10. [18]

    arXiv preprint arXiv:2312.09518 , year=

    Further improving quantum algorithms for nonlinear differential equations via higher-order methods and rescaling , author=. arXiv preprint arXiv:2312.09518 , year=

    arXiv

  11. [19]

    SIAM Journal on Scientific Computing , volume=

    Quantum algorithms for nonlinear dynamics: Revisiting carleman linearization with no dissipative conditions , author=. SIAM Journal on Scientific Computing , volume=. 2025 , publisher=

    2025

  12. [20]

    Applied and Computational Harmonic Analysis , volume=

    Approximation by exponential sums revisited , author=. Applied and Computational Harmonic Analysis , volume=. 2010 , publisher=

    2010

  13. [21]

    arXiv preprint arXiv:2509.07155 , year=

    Quantum algorithms for general nonlinear dynamics based on the Carleman embedding , author=. arXiv preprint arXiv:2509.07155 , year=

    arXiv

  14. [22]

    arXiv preprint arXiv:2507.06198 , year=

    Quantum simulation of a noisy classical nonlinear dynamics , author=. arXiv preprint arXiv:2507.06198 , year=

  15. [23]

    Applied and Computational Harmonic Analysis , volume=

    On approximation of functions by exponential sums , author=. Applied and Computational Harmonic Analysis , volume=. 2005 , publisher=

    2005

  16. [24]

    Nonlinear Analysis: Theory, Methods & Applications , volume=

    Finite element methods for parabolic and hyperbolic partial integro-differential equations , author=. Nonlinear Analysis: Theory, Methods & Applications , volume=. 1988 , publisher=

    1988

  17. [25]

    The Journal of Integral Equations and Applications , pages=

    Parabolic integrodifferential equations with singular kernels , author=. The Journal of Integral Equations and Applications , pages=. 1991 , publisher=

    1991

  18. [26]

    SIAM Journal on Applied Dynamical Systems , volume=

    Data-Driven Learning for the Mori--Zwanzig Formalism: A Generalization of the Koopman Learning Framework , author=. SIAM Journal on Applied Dynamical Systems , volume=. 2021 , publisher=

    2021

  19. [27]

    2001 , publisher=

    Nonequilibrium statistical mechanics , author=. 2001 , publisher=

    2001

  20. [28]

    Journal of Statistical Physics , volume=

    Nonlinear generalized Langevin equations , author=. Journal of Statistical Physics , volume=. 1973 , publisher=

    1973

  21. [29]

    Progress of theoretical physics , volume=

    Transport, collective motion, and Brownian motion , author=. Progress of theoretical physics , volume=. 1965 , publisher=

    1965

  22. [30]

    Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences , volume=

    A priori estimation of memory effects in reduced-order models of nonlinear systems using the Mori--Zwanzig formalism , author=. Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences , volume=. 2017 , publisher=

    2017

  23. [31]

    Quarterly of Applied Mathematics , volume=

    An integro-differential equation with application in heat flow , author=. Quarterly of Applied Mathematics , volume=. 1977 , url=

    1977

  24. [32]

    1995 , publisher=

    Theory of integro-differential equations , author=. 1995 , publisher=

    1995

  25. [33]

    2005 , publisher=

    Volterra integral and differential equations , author=. 2005 , publisher=

    2005

  26. [34]

    Biological cybernetics , volume=

    Dynamics of pattern formation in lateral-inhibition type neural fields , author=. Biological cybernetics , volume=. 1977 , publisher=

    1977

  27. [35]

    Proceedings of the 51st annual ACM SIGACT symposium on theory of computing , pages=

    Quantum singular value transformation and beyond: exponential improvements for quantum matrix arithmetics , author=. Proceedings of the 51st annual ACM SIGACT symposium on theory of computing , pages=. 2019 , url=

    2019

  28. [36]

    van Apeldoorn, Joran and Gily. Quantum. doi:10.22331/q-2020-02-14-230 , url =

    2020 doi

  29. [37]

    46th International Colloquium on Automata, Languages, and Programming (ICALP 2019) , pages =

    Shantanav Chakraborty and Andr. 46th International Colloquium on Automata, Languages, and Programming (ICALP 2019) , pages =. 2019 , volume =

    2019

  30. [38]

    Takahira, Souichi and Ohashi, Asuka and Sogabe, Tomohiro and Usuda, Tsuyoshi Sasaki , title =. Quant. Inf. Comput. 2022. doi:10.26421/qic22.11-12-4. arXiv:2106.08076

    2022 arXiv

  31. [39]

    Varga, Richard S , volume=. Ger. 2011 , publisher=

    2011

  32. [40]

    Quantum , volume=

    Limitations for quantum algorithms to solve turbulent and chaotic systems , author=. Quantum , volume=. 2024 , publisher=

    2024

  33. [41]

    arXiv preprint arXiv:2211.05246 , year=

    A theory of quantum differential equation solvers: limitations and fast-forwarding , author=. arXiv preprint arXiv:2211.05246 , year=

    arXiv

  34. [42]

    SIAM Journal on Scientific Computing , volume=

    A fast time stepping method for evaluating fractional integrals , author=. SIAM Journal on Scientific Computing , volume=. 2010 , publisher=

    2010

  35. [43]

    65th Annual IEEE Symposium on Foundations of Computer Science (FOCS) , pages=

    Quantum eigenvalue processing , author=. 65th Annual IEEE Symposium on Foundations of Computer Science (FOCS) , pages=. 2024 , url=

    2024

  36. [44]

    arXiv preprint arXiv:2508.19238 , year=

    Optimal quantum simulation of linear non-unitary dynamics , author=. arXiv preprint arXiv:2508.19238 , year=

    arXiv

  37. [45]

    Designing a nearly optimal quantum algorithm for linear differential equations via

    Shang, Zhong-Xia and Guo, Naixu and An, Dong and Zhao, Qi , journal=. Designing a nearly optimal quantum algorithm for linear differential equations via. 2025 , publisher=

    2025

  38. [46]

    SIAM Journal on Numerical Analysis , volume=

    On logarithmic norms , author=. SIAM Journal on Numerical Analysis , volume=. 1975 , publisher=

    1975

  39. [47]

    Journal of Statistical Physics , volume=

    Quantum detection and estimation theory , author=. Journal of Statistical Physics , volume=. 1969 , publisher=

    1969

  40. [48]

    Linear Algebra and its Applications , volume=

    Congenial matrices , author=. Linear Algebra and its Applications , volume=. 1981 , publisher=

    1981

  41. [49]

    IFAC-PapersOnLine , volume=

    On the stability of discrete-time linear switched systems in block companion form , author=. IFAC-PapersOnLine , volume=. 2020 , publisher=

    2020

  42. [50]

    Block companion matrices, discrete-time block diagonal stability and polynomial matrices , author=. Oper. Matrices , volume=. 2009 , url=

    2009

  43. [51]

    Numerical Algorithms , volume=

    An algorithm for computing the eigenvalues of block companion matrices , author=. Numerical Algorithms , volume=. 2013 , publisher=

    2013

  44. [52]

    International Journal of Theoretical Physics , volume=

    Simulating physics with computers , author=. International Journal of Theoretical Physics , volume=. 1982 , publisher=

    1982

  45. [53]

    Progress of Theoretical Physics , volume=

    On quantum theory of transport phenomena: Steady diffusion , author=. Progress of Theoretical Physics , volume=. 1958 , publisher=

    1958

  46. [54]

    The Journal of Chemical Physics , volume=

    Ensemble method in the theory of irreversibility , author=. The Journal of Chemical Physics , volume=. 1960 , publisher=

    1960

  47. [55]

    2002 , publisher=

    The theory of open quantum systems , author=. 2002 , publisher=

    2002

  48. [56]

    Quantum , volume=

    Tutorial: projector approach to master equations for open quantum systems , author=. Quantum , volume=. 2024 , publisher=

    2024

  49. [57]

    arXiv preprint arXiv:1902.00967 , year=

    Lecture notes on the theory of open quantum systems , author=. arXiv preprint arXiv:1902.00967 , year=

    1902 arXiv

  50. [58]

    and Lloyd, Seth , journal=

    Abrams, Daniel S. and Lloyd, Seth , journal=. Nonlinear quantum mechanics implies polynomial-time solution for. 1998 , publisher=

    1998

  51. [59]

    Physical Review A , volume=

    Optimal state discrimination and unstructured search in nonlinear quantum mechanics , author=. Physical Review A , volume=. 2016 , publisher=

    2016

  52. [60]

    ACM SIGACT News , url=

    Scott Aaronson , year=. ACM SIGACT News , url=

  53. [61]

    Quantum amplitude amplification and estimation , ISBN=

    Brassard, Gilles and Høyer, Peter and Mosca, Michele and Tapp, Alain , year=. Quantum amplitude amplification and estimation , ISBN=. Quantum Computation and Information , publisher=

  54. [62]

    arXiv preprint arXiv:2603.12161 , year=

    Quantum lower bounds for simulating fluid dynamics , author=. arXiv preprint arXiv:2603.12161 , year=

  55. [63]

    Contemporary computational mathematics-a Celebration of the 80th birthday of Ian Sloan , pages=

    Exponential sum approximations for t- , author=. Contemporary computational mathematics-a Celebration of the 80th birthday of Ian Sloan , pages=. 2018 , publisher=

    2018

  56. [64]

    Quantum , volume=

    Quantum and classical algorithms for nonlinear unitary dynamics , author=. Quantum , volume=. 2025 , publisher=

    2025

  57. [65]

    2026 , eprint=

    Efficient Quantum Algorithm for Solving Linear Distributed Delay Differential Equations , author=. 2026 , eprint=

    2026

  58. [66]

    2007 , publisher=

    Methods of numerical integration , author=. 2007 , publisher=

    2007

  59. [67]

    Quantum , volume=

    Quantum regularized least squares , author=. Quantum , volume=. 2023 , publisher=

    2023

  60. [68]

    arXiv preprint arXiv:2603.17941 , year=

    Efficient Quantum Algorithm for Solving Linear Distributed Delay Differential Equations , author=. arXiv preprint arXiv:2603.17941 , year=

  61. [69]

    Communications in Mathematical Physics , volume=

    Succinct description and efficient simulation of non-Markovian open quantum systems , author=. Communications in Mathematical Physics , volume=. 2023 , publisher=

    2023

  62. [70]

    arXiv preprint arXiv:2603.12398 , year=

    Efficient Quantum Simulation for Nonlinear Stochastic Differential Equations , author=. arXiv preprint arXiv:2603.12398 , year=

  63. [71]

    Reports on progress in physics , volume=

    The fluctuation-dissipation theorem , author=. Reports on progress in physics , volume=. 1966 , url=

    1966

  64. [72]

    Communications in Mathematical Physics , volume=

    Time-dependent Hamiltonian simulation via Magnus expansion: Algorithm and superconvergence , author=. Communications in Mathematical Physics , volume=. 2025 , publisher=

    2025

  65. [73]

    Quantum , volume=

    Time-dependent Hamiltonian simulation with L1-norm scaling , author=. Quantum , volume=. 2020 , publisher=

    2020

  66. [74]

    1993 , publisher=

    Delay differential equations: with applications in population dynamics , author=. 1993 , publisher=

    1993

  67. [75]

    Physical review letters , volume=

    Generalization of pairwise models to non-Markovian epidemics on networks , author=. Physical review letters , volume=. 2015 , publisher=

    2015

  68. [76]

    Physical Review , volume=

    Memory effects in irreversible thermodynamics , author=. Physical Review , volume=. 1961 , publisher=

    1961

  69. [77]

    La Rivista del Nuovo Cimento (1971-1977) , volume=

    Linear models of dissipation in anelastic solids , author=. La Rivista del Nuovo Cimento (1971-1977) , volume=. 1971 , publisher=

    1971

  70. [78]

    Journal of the ACM (JACM) , volume=

    Linear multistep methods for Volterra integro-differential equations , author=. Journal of the ACM (JACM) , volume=. 1969 , publisher=

    1969

  71. [79]

    SIAM Journal on Scientific Computing , volume=

    Fast and oblivious convolution quadrature , author=. SIAM Journal on Scientific Computing , volume=. 2006 , publisher=

    2006

  72. [80]

    2013 , publisher=

    Matrix analysis , author=. 2013 , publisher=

    2013

  73. [81]

    2022 , publisher=

    Partial differential equations , author=. 2022 , publisher=

    2022

Pith tools

Reviewed August 14, 2026 · model on record in the stance chip above.