Variational quantum algorithm based on Lagrange polynomial encoding to solve differential equations
Fuente:
arXiv
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866916783222423552 |
|---|---|
| author | Hunout, Josephine Laizet, Sylvain Iannucci, Lorenzo |
| author_facet | Hunout, Josephine Laizet, Sylvain Iannucci, Lorenzo |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2407_16363 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Variational quantum algorithm based on Lagrange polynomial encoding to solve differential equations Hunout, Josephine Laizet, Sylvain Iannucci, Lorenzo Quantum Physics 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. |
| title | Variational quantum algorithm based on Lagrange polynomial encoding to solve differential equations |
| topic | Quantum Physics |
| url | https://arxiv.org/abs/2407.16363 |