Circuit Depth Reduction of One-Ancilla Quantum Differential Equation Solver via Extrapolation

• URL: http://arxiv.org/abs/2607.07389v1
• Date: Wed, 08 Jul 2026 13:20:43 GMT
• Title: Circuit Depth Reduction of One-Ancilla Quantum Differential Equation Solver via Extrapolation
• Abstract summary: A recent one-ancilla quantum differential equation solver provides a hardware-friendly and locality-preserving approach.<n>We reduce the maximum single-run circuit depth to $O(mathrmpolylog (1/)$ without adding quantum ancillae or sacrificing locality.<n> Numerical experiments on the Hatano-Nelson model (ODE) and the convection-diffusion equation (PDE) demonstrate the effectiveness of the approach.
• Score: 1.0742675209112622
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: Solving linear differential equations is a fundamental task in scientific computing and an important primitive for quantum computing. A recent one-ancilla quantum differential equation solver provides a hardware-friendly and locality-preserving approach with provable performance guarantees, making it highly suitable for the early fault-tolerant and near-term regimes. Its simple circuit structure comes with a natural trade-off: the maximum single-run circuit depth scales as $O (1/ε)$ in the target accuracy $ε$. In this work, we reduce this depth by combining the solver with classical step-size postprocessing. By running the one-ancilla solver at a logarithmic number of finite time step sizes and using classical post-processing to cancel leading discretization errors, we reduce the maximum single-run circuit depth to $O(\mathrm{polylog}(1/ε))$ without adding quantum ancillae or sacrificing locality. Technically, extending extrapolation ideas beyond Hamiltonian and Lindbladian dynamics requires regularity estimates for observable maps under nonunitary evolution, which we obtain through a holomorphic extension of the adjoint evolution. Numerical experiments on the Hatano-Nelson model (ODE) and the convection-diffusion equation (PDE) demonstrate the effectiveness of the approach.

Related papers

• Analytical Series Expansion for Efficient Gradient Evaluation in Multi-Qubit Optimal Control [42.97938764966747]
  We present a unifying framework for gradient-based quantum optimal control.<n>For the case of unitary propagators, we derive a series expansion involving time-independent commutators and time-dependent coefficients.<n>The method is particularly suited for simulating optimal control tasks in quantum systems with local interactions.
  arXiv  Detail & Related papers  (2026-07-29T12:50:52Z)
• Quantum algorithms for the fractional Poisson equation via rational approximation [20.497126318288906]
  We present a quantum algorithm for solving the fractional equation ((-)s u = f) with (s in (0,1)) on bounded domains.<n>The proposed approach combines rational approximation techniques with quantum linear system solvers to achieve exponential quantum advantage.
  arXiv  Detail & Related papers  (2026-04-01T08:08:33Z)
• A Schrödinger Eigenfunction Method for Long-Horizon Stochastic Optimal Control [25.99003754170971]
  High-dimensional optimal control (SOC) becomes harder with longer planning horizons.<n>We prove that, under the gradient drift assumption, $mathcalL$ is unitarily equivalent to a Schrdinger operator $mathcalS = -+ mathcalV$ with purely discrete spectrum.<n>We evaluate our method on several long-horizon benchmarks, achieving an order-of-magnitude improvement in control accuracy compared to state-of-the-art methods.
  arXiv  Detail & Related papers  (2026-03-24T13:15:48Z)
• Quantum Algorithm for Local-Volatility Option Pricing via the Kolmogorov Equation [0.500208619516796]
  Solution of option-pricing problems may turn out to be computationally demanding due to non-linear and path-dependent payoffs.<n> quantum computing has been proposed as a means to address these challenges efficiently.<n>We present an end-to-end quantum algorithmic framework that solves the Kolmogorov forward (Fokker-Planck) partial differential equation for local-volatility models.
  arXiv  Detail & Related papers  (2025-11-07T03:02:43Z)
• Quantum Random Feature Method for Solving Partial Differential Equations [36.58357595906332]
  Quantum computing holds promise for scientific computing due to its potential for exponential speedups over classical methods.<n>In this work, we introduce a quantum random method (QRFM) that leverages advantages from both numerical analysis and neural analysis.
  arXiv  Detail & Related papers  (2025-10-09T08:42:09Z)
• Quantum Framework for Simulating Linear PDEs with Robin Boundary Conditions [0.6144680854063939]
  We propose an explicit, oracle-free quantum framework for numerically simulating general linear partial differential equations (PDEs)<n>Our approach begins with a general finite-difference discretization and applies the Schrodingerisation technique to transform the resulting system into one that admits unitary quantum evolution.
  arXiv  Detail & Related papers  (2025-06-25T14:23:38Z)
• Zassenhaus Expansion in Solving the Schrödinger Equation [0.0]
  A fundamental challenge lies in approximating the unitary evolution operator ( e-imathcalHt ) where ( mathcalH ) is a large, typically non-commuting, Hermitian operator.<n>We present a refinement of the fixed-depth simulation framework introduced by E. K"okc"u et al, incorporating the second-order Zassenhaus expansion.<n>This yields a controlled, non-unitary approximation with error scaling as ( mathcalO(t
  arXiv  Detail & Related papers  (2025-05-14T14:48:47Z)
• On the Schrödingerization method for linear non-unitary dynamics with optimal dependence on matrix queries [42.104910612491885]
  The Schr"odingerization method converts linear partial and ordinary differential equations with non-unitary dynamics into systems of Schr"odinger-type equations with unitary evolution.<n>The original proposal used a particular initial function in the auxiliary space that did not achieve optimal scaling in precision.<n>Here we show that, by choosing smoother initial functions in auxiliary space, Schr"odingerization textitcan in fact achieve near optimal and even optimal scaling in matrix queries.
  arXiv  Detail & Related papers  (2025-05-01T07:46:50Z)
• Schrödingerization based Quantum Circuits for Maxwell's Equation with time-dependent source terms [24.890270804373824]
  This paper explicitly constructs a quantum circuit for Maxwell's equations with perfect electric conductor (PEC) boundary conditions. We show that quantum algorithms constructed using Schr"odingerisation exhibit acceleration in computational complexity compared to the classical Finite Difference Time Domain (FDTD) format.
  arXiv  Detail & Related papers  (2024-11-17T08:15:37Z)
• Quantum simulation of the Fokker-Planck equation via Schrodingerization [33.76659022113328]
  This paper studies a quantum simulation technique for solving the Fokker-Planck equation. We employ the Schrodingerization method-it converts any linear partial and ordinary differential equation with non-Hermitian dynamics into systems of Schrodinger-type equations.
  arXiv  Detail & Related papers  (2024-04-21T08:53:27Z)
• Variational Quantum Simulation of Partial Differential Equations: Applications in Colloidal Transport [0.0]
  We show that real-amplitude ansaetze with full circular entangling layers lead to higher-fidelity solutions. To efficiently encode impulse functions, we propose a graphical mapping technique for quantum states.
  arXiv  Detail & Related papers  (2023-07-14T05:51:57Z)
• D4FT: A Deep Learning Approach to Kohn-Sham Density Functional Theory [79.50644650795012]
  We propose a deep learning approach to solve Kohn-Sham Density Functional Theory (KS-DFT) We prove that such an approach has the same expressivity as the SCF method, yet reduces the computational complexity. In addition, we show that our approach enables us to explore more complex neural-based wave functions.
  arXiv  Detail & Related papers  (2023-03-01T10:38:10Z)
• A Probabilistic State Space Model for Joint Inference from Differential Equations and Data [23.449725313605835]
  We show a new class of solvers for ordinary differential equations (ODEs) that phrase the solution process directly in terms of Bayesian filtering. It then becomes possible to perform approximate Bayesian inference on the latent force as well as the ODE solution in a single, linear complexity pass of an extended Kalman filter. We demonstrate the expressiveness and performance of the algorithm by training a non-parametric SIRD model on data from the COVID-19 outbreak.
  arXiv  Detail & Related papers  (2021-03-18T10:36:09Z)
• Multipole Graph Neural Operator for Parametric Partial Differential Equations [57.90284928158383]
  One of the main challenges in using deep learning-based methods for simulating physical systems is formulating physics-based data. We propose a novel multi-level graph neural network framework that captures interaction at all ranges with only linear complexity. Experiments confirm our multi-graph network learns discretization-invariant solution operators to PDEs and can be evaluated in linear time.
  arXiv  Detail & Related papers  (2020-06-16T21:56:22Z)
• A quantum Poisson solver implementable on NISQ devices (improved version) [23.69613801851615]
  We propose a compact quantum algorithm for solving one-dimensional Poisson equation based on simple Ry rotation. The solution error comes only from the finite difference approximation of the Poisson equation. Our quantum Poisson solver (QPS) has gate-complexity of 3n in qubits and 4n3 in one- and two-qubit gates, where n is the logarithmic of the dimension of the linear system of equations.
  arXiv  Detail & Related papers  (2020-05-01T07:38:07Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.