Explicit Quantum Circuits for Simulating Linear Differential Equations via Dilation
Seonggeun Park
TL;DR
This work addresses simulating linear ODEs with non-Hermitian generators by embedding the dynamics into a unitary dilation and then realizing this dilation on quantum hardware. It develops a concrete SBP-based discretization $F_h$ that becomes exactly skew-Hermitian in the $\ell^2$ sense, enabling exact moment conditions and a provable global error bound of $O(M^{-3/2})$ (plus boundary effects). The authors then construct an end-to-end quantum circuit framework using LCU, QSVT, and QFT-adder techniques to prepare the ancillary state $|r_h\rangle$, block-encode the dilated Hamiltonian, and perform the evaluation step with postselection and amplitude amplification. They provide explicit circuit primitives, analyze resource requirements (scaling between $O(\log M)$ and $O((\log M)^2)$ for different stages), and discuss practical implications for dissipative PDEs and open quantum systems, while acknowledging limitations and avenues for refinement and experimental validation.
Abstract
Quantum simulation has primarily focused on unitary dynamics, while many physical and engineering systems can be modeled by linear ordinary differential equations whose generators include non-Hermitian terms. Recent studies have shown that such equations, which give rise to nonunitary dynamics, can be embedded into a larger unitary framework via dilation techniques. However, their concrete realization on quantum circuits remains underexplored. In this paper we present a concrete pipeline that connects the dilation formalism with explicit quantum circuit constructions. On the analytical side, building on the recent dilation framework, we introduce a discretization of the continuous dilation operator that is tailored for quantum implementation. This construction ensures an exactly skew-Hermitian ancillary generator, which allows the moment conditions to be satisfied without imposing artificial constraints. We prove that the resulting scheme achieves a global error bound of order $O(M^{-3/2})$, up to exponentially small boundary effects. This error can be suppressed by refining the discretization, where $M$ denotes the discretization parameter. On the algorithmic side, we demonstrate that the dilation triple $(F_h, |r_h\rangle, \langle l_h|)$ can be efficiently implemented on quantum circuits. Using linear combinations of unitaries, QFT-adder operators, and quantum singular value transformation, the framework requires resources ranging from $O(\log M)$ to $O((\log M)^2)$, depending on the stage of the pipeline.
