Quantum algorithms for linear and non-linear fractional reaction-diffusion equations
arXiv:2310.18900 · doi:10.22331/q-2026-01-19-1969
Abstract
High-dimensional fractional reaction-diffusion equations have numerous applications in the fields of biology, chemistry, and physics, and exhibit a range of rich phenomena. While classical algorithms have an exponential complexity in the spatial dimension, a quantum computer can produce a quantum state that encodes the solution with only polynomial complexity, provided that suitable input access is available. In this work, we investigate efficient quantum algorithms for linear and nonlinear fractional reaction-diffusion equations with periodic boundary conditions. For linear equations, we analyze and compare the complexity of various methods, including the second-order Trotter formula, time-marching method, and truncated Dyson series method. We also present a novel algorithm that combines the linear combination of Hamiltonian simulation technique with the interaction picture formalism, resulting in optimal scaling in the spatial dimension. For nonlinear equations, we employ the Carleman linearization method and propose a block-encoding version that is appropriate for the dense matrices that arise from the spatial discretization of fractional reaction-diffusion equations.
References in corpus (22)
- Quantum algorithm for solving linear systems of equations
- Quantum algorithm for systems of linear equations with exponentially improved dependence on precision
- Quantum singular value transformation and beyond: exponential improvements for quantum matrix arithmetics
- A Theory of Trotter Error
- From Diffusion to Anomalous Diffusion: A Century after Einstein's Brownian Motion
- High-order quantum algorithm for solving linear differential equations
- Efficient quantum algorithm for dissipative nonlinear differential equations
- Quantum algorithm for linear differential equations with exponentially improved dependence on precision
- Quantum algorithms for systems of linear equations inspired by adiabatic quantum computing
- High-precision quantum algorithms for partial differential equations
- Quantum spectral methods for differential equations
- Hamiltonian Simulation Using Linear Combinations of Unitary Operations
- Optimal polynomial based quantum eigenstate filtering with application to solving quantum linear systems
- Improved quantum algorithms for linear and nonlinear differential equations
- Linear combination of Hamiltonian simulation for nonunitary dynamics with optimal state preparation cost
- Time-dependent unbounded Hamiltonian simulation with vector norm scaling
- Time-marching based quantum solvers for time-dependent linear differential equations
- Quantum simulation of partial differential equations via Schrodingerisation
- Quantum simulation of real-space dynamics
- Quantum algorithm for time-dependent differential equations using Dyson series
- Quantum differential equation solvers: limitations and fast-forwarding
- Further improving quantum algorithms for nonlinear differential equations via higher-order methods and rescaling