Variational quantum algorithm based on Lagrange polynomial encoding to solve differential equations

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.

Authors

Institutions

Publication Details

Journal
Physical review. A/Physical review, A
Published
2025-06-03
DOI
https://doi.org/10.1103/physreva.111.062404
Citations
1
Primary Topic
Quantum Computing Algorithms and Architecture
Type
article
Field-Weighted Citation Impact
2.48

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Variational quantum algorithm based on Lagrange polynomial encoding to solve differential equations

Sylvain Laizet, Lorenzo Iannucci, Josephine Hunout
1 citations
Physical review. A/Physical review, A
Quantum Computing Algorithms and Architecture
2.48
article

Variational quantum algorithm based on Lagrange polynomial encoding to solve differential equations

Sylvain Laizet, Lorenzo Iannucci, Josephine Hunout
article en
1 citations

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.

Physical review. A/Physical review, AVol. 111(6)
Imperial College London (GB)
Imperial College London, Engineering and Physical Sciences Research Council
Openalex Percentile: Top 10%
Quantum Computing Algorithms and Architecture
2.48
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.