Solving Fractional Differential Equations on a Quantum Computer: A Variational Approach
arXiv:2406.08755 · doi:10.1116/5.0202971
Abstract
We introduce an efficient variational hybrid quantum-classical algorithm designed for solving Caputo time-fractional partial differential equations. Our method employs an iterable cost function incorporating a linear combination of overlap history states. The proposed algorithm is not only efficient in time complexity, but has lower memory costs compared to classical methods. Our results indicate that solution fidelity is insensitive to the fractional index and that gradient evaluation cost scales economically with the number of time steps. As a proof of concept, we apply our algorithm to solve a range of fractional partial differential equations commonly encountered in engineering applications, such as the sub-diffusion equation, the non-linear Burgers' equation and a coupled diffusive epidemic model. We assess quantum hardware performance under realistic noise conditions, further validating the practical utility of our algorithm.
References in corpus (39)
- Variational Quantum Algorithms
- Noisy intermediate-scale quantum (NISQ) algorithms
- Quantum Amplitude Amplification and Estimation
- Predicting Many Properties of a Quantum System from Very Few Measurements
- Cost Function Dependent Barren Plateaus in Shallow Parametrized Quantum Circuits
- The Variational Quantum Eigensolver: a review of methods and best practices
- An adaptive variational algorithm for exact molecular simulations on a quantum computer
- Expressibility and entangling capability of parameterized quantum circuits for hybrid quantum-classical algorithms
- Quantum Error Mitigation
- Variational quantum algorithms for nonlinear problems
- Efficient quantum algorithm for dissipative nonlinear differential equations
- Amplitude estimation without phase estimation
- PennyLane: Automatic differentiation of hybrid quantum-classical computations
- On the advantages of using relative phase Toffolis with an application to multiple control Toffoli optimization
- Some aspects of fractional diffusion equations of single and distributed order
- Equivalence of quantum barren plateaus to cost concentration and narrow gorges
- Robust shadow estimation
- Quantum Approximate Counting, Simplified
- Classical Shadows With Noise
- Performance comparison of optimization methods on variational quantum algorithms
- A Comparison of Various Classical Optimizers for a Variational Quantum Linear Solver
- Variational Quantum Algorithms for Computational Fluid Dynamics
- Evaluating the noise resilience of variational quantum algorithms
- Minimizing estimation runtime on noisy quantum computers
- Low depth algorithms for quantum amplitude estimation
- Classical shadows with Pauli-invariant unitary ensembles
- Quantum Variational Solving of Nonlinear and Multi-Dimensional Partial Differential Equations
- A variational quantum algorithm for the Feynman-Kac formula
- A Performance Study of Variational Quantum Algorithms for Solving the Poisson Equation on a Quantum Computer
- Linear-depth quantum circuits for loading Fourier approximations of arbitrary functions
- Variational Quantum-Based Simulation of Waveguide Modes
- Hamiltonian simulation for hyperbolic partial differential equations by scalable quantum circuits
- Variational Quantum Simulation of Partial Differential Equations: Applications in Colloidal Transport
- Connecting geometry and performance of two-qubit parameterized quantum circuits
- Variational quantum algorithms for Poisson equations based on the decomposition of sparse Hamiltonians
- Natural parameterized quantum circuit
- Sample-optimal classical shadows for pure states
- Foundations for Bayesian inference with engineered likelihood functions for robust amplitude estimation
- Reducing the cost of energy estimation in the variational quantum eigensolver algorithm with robust amplitude estimation