Variational quantum algorithm based on Lagrange polynomial encoding to solve differential equations
arXiv:2407.16363 · doi:10.1103/PhysRevA.111.062404
Abstract
Differential equations (DEs) serve as the cornerstone for a wide range of scientific endeavors, their solutions weaving through the core of diverse fields such as structural engineering, fluid dynamics, and financial modeling. DEs are notoriously hard to solve, due to their intricate nature, and finding solutions to DEs often exceeds the capabilities of traditional computational approaches. Recent advances in quantum computing have triggered a growing interest from researchers for the design of quantum algorithms for solving DEs. In this work, we introduce two different architectures of a novel variational quantum algorithm (VQA) with Lagrange polynomial encoding in combination with derivative quantum circuits using the Hadamard test differentiation to approximate the solution of DEs. To demonstrate the potential of our new VQA, two well-known ordinary differential equations are used: the damped mass-spring system from a given initial condition and the Poisson equation for periodic, Dirichlet, and Neumann boundary conditions. It is shown that the proposed new VQA has a reduced gate complexity compared to previous variational quantum algorithms, for a similar or better quality of the solution.
21 pages, 19 figures
References in corpus (38)
- A variational eigenvalue solver on a quantum processor
- Quantum algorithm for solving linear systems of equations
- Variational Quantum Algorithms
- Hardware-efficient Variational Quantum Eigensolver for Small Molecules and Quantum Magnets
- Barren plateaus in quantum neural network training landscapes
- The theory of variational hybrid quantum-classical algorithms
- Quantum Circuit Learning
- Parameterized quantum circuits as machine learning models
- Cost Function Dependent Barren Plateaus in Shallow Parametrized Quantum Circuits
- The Variational Quantum Eigensolver: a review of methods and best practices
- Quantum random access memory
- Building logical qubits in a superconducting quantum computing system
- Quantum Natural Gradient
- Generalized Unitary Coupled Cluster Wavefunctions for Quantum Computation
- Training variational quantum algorithms is NP-hard
- An initialization strategy for addressing barren plateaus in parametrized quantum circuits
- Variational quantum algorithms for nonlinear problems
- Preconditioned quantum linear system algorithm
- High-order quantum algorithm for solving linear differential equations
- Stochastic gradient descent for hybrid quantum-classical optimization
- Quantum algorithm for linear differential equations with exponentially improved dependence on precision
- Variational Quantum Linear Solver
- Solving nonlinear differential equations with differentiable quantum circuits
- Quantum algorithms and the finite element method
- Sequential minimal optimization for quantum-classical hybrid algorithms
- Quantum algorithm and circuit design solving the Poisson equation
- High-precision quantum algorithms for partial differential equations
- Quantum Algorithm for Simulating the Wave Equation
- Quantum spectral methods for differential equations
- An Adaptive Optimizer for Measurement-Frugal Variational Algorithms
- A Comparison of Various Classical Optimizers for a Variational Quantum Linear Solver
- Fault tolerant resource estimation of quantum random-access memories
- Hamiltonian variational ansatz without barren plateaus
- Quantum Fast Poisson Solver: the algorithm and modular circuit design
- Quantum natural gradient generalised to noisy and non-unitary circuits
- Mitigating Barren Plateaus with Transfer-learning-inspired Parameter Initializations
- Quantum Variational Solving of Nonlinear and Multi-Dimensional Partial Differential Equations
- Efficient estimation of trainability for variational quantum circuits