A New Variational Quantum Algorithm Based on Lagrange Polynomial Encoding to Solve Partial Differential Equations

• URL: http://arxiv.org/abs/2407.16363v1
• Date: Tue, 23 Jul 2024 10:11:44 GMT
• Title: A New Variational Quantum Algorithm Based on Lagrange Polynomial Encoding to Solve Partial Differential Equations
• Authors: Josephine Hunout, Sylvain Laizet, Lorenzo Iannucci,
• Abstract summary: Partial Differential Equations (PDEs) serve as the cornerstone for a wide range of scientific endeavours. Finding solutions to PDEs 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 PDEs.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Partial Differential Equations (PDEs) serve as the cornerstone for a wide range of scientific endeavours, their solutions weaving through the core of diverse fields such as structural engineering, fluid dynamics, and financial modelling. PDEs are notoriously hard to solve, due to their the intricate nature, and finding solutions to PDEs 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 PDEs. 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 PDEs. To demonstrate the potential of our new VQA, two well-known PDEs are used: the damped mass-spring system from a given initial value 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.

Related papers

• Solving Poisson Equations using Neural Walk-on-Spheres [80.1675792181381]
  We propose Neural Walk-on-Spheres (NWoS), a novel neural PDE solver for the efficient solution of high-dimensional Poisson equations. We demonstrate the superiority of NWoS in accuracy, speed, and computational costs.
  arXiv  Detail & Related papers  (2024-06-05T17:59:22Z)
• Unisolver: PDE-Conditional Transformers Are Universal PDE Solvers [55.0876373185983]
  We present the Universal PDE solver (Unisolver) capable of solving a wide scope of PDEs. Our key finding is that a PDE solution is fundamentally under the control of a series of PDE components. Unisolver achieves consistent state-of-the-art results on three challenging large-scale benchmarks.
  arXiv  Detail & Related papers  (2024-05-27T15:34:35Z)
• Quantum Subroutine for Variance Estimation: Algorithmic Design and Applications [80.04533958880862]
  Quantum computing sets the foundation for new ways of designing algorithms. New challenges arise concerning which field quantum speedup can be achieved. Looking for the design of quantum subroutines that are more efficient than their classical counterpart poses solid pillars to new powerful quantum algorithms.
  arXiv  Detail & Related papers  (2024-02-26T09:32:07Z)
• Quantum Variational Solving of Nonlinear and Multi-Dimensional Partial Differential Equations [1.2670268797931266]
  A variational quantum algorithm for numerically solving partial differential equations was proposed by Lubasch et al. We generalize the method to cover a broader class of nonlinear PDEs as well as multidimensional PDEs. We show via numerical simulations that the algorithm can solve instances of the Single-Asset Black-Scholes equation.
  arXiv  Detail & Related papers  (2023-11-02T18:29:31Z)
• QNEAT: Natural Evolution of Variational Quantum Circuit Architecture [95.29334926638462]
  We focus on variational quantum circuits (VQC), which emerged as the most promising candidates for the quantum counterpart of neural networks. Although showing promising results, VQCs can be hard to train because of different issues, e.g., barren plateau, periodicity of the weights, or choice of architecture. We propose a gradient-free algorithm inspired by natural evolution to optimize both the weights and the architecture of the VQC.
  arXiv  Detail & Related papers  (2023-04-14T08:03:20Z)
• A Performance Study of Variational Quantum Algorithms for Solving the Poisson Equation on a Quantum Computer [0.0]
  Partial differential equations (PDEs) are used in material or flow simulation. The most promising route to useful deployment of quantum processors in the short to near term are so-called hybrid variational quantum algorithms (VQAs) We conduct an extensive study of utilizing VQAs on real quantum devices to solve the simplest prototype of a PDE -- the Poisson equation.
  arXiv  Detail & Related papers  (2022-11-25T12:39:13Z)
• Variational quantum algorithm for measurement extraction from the Navier-Stokes, Einstein, Maxwell, B-type, Lin-Tsien, Camassa-Holm, DSW, H-S, KdV-B, non-homogeneous KdV, generalized KdV, KdV, translational KdV, sKdV, B-L and Airy equations [0.0]
  Recent progress due to Lubasch et al in a 2019 paper provides readout for solutions to the Schrodinger and Inviscid Burgers equations. We analyze additional computational prospects in which the new variational quantum algorithm can reliably produce solutions to other PDEs.
  arXiv  Detail & Related papers  (2022-09-16T04:44:19Z)
• Quantum Model-Discovery [19.90246111091863]
  Quantum algorithms for solving differential equations have shown a provable advantage in the fault-tolerant quantum computing regime. We extend the applicability of near-term quantum computers to more general scientific machine learning tasks. Our results show a promising path to Quantum Model Discovery (QMoD) on the interface between classical and quantum machine learning approaches.
  arXiv  Detail & Related papers  (2021-11-11T18:45:52Z)
• A variational quantum algorithm for the Feynman-Kac formula [0.6116681488656472]
  We propose an algorithm based on variational quantum imaginary time evolution for solving the Feynman-Kac partial differential equation. We see a remarkable agreement between the classical methods and the quantum variational method for an illustrative example on six and eight qubits. Future research topics in the areas of quantitative finance and other types of PDEs are also discussed.
  arXiv  Detail & Related papers  (2021-08-24T17:14:47Z)
• Q-Match: Iterative Shape Matching via Quantum Annealing [64.74942589569596]
  Finding shape correspondences can be formulated as an NP-hard quadratic assignment problem (QAP) This paper proposes Q-Match, a new iterative quantum method for QAPs inspired by the alpha-expansion algorithm. Q-Match can be applied for shape matching problems iteratively, on a subset of well-chosen correspondences, allowing us to scale to real-world problems.
  arXiv  Detail & Related papers  (2021-05-06T17:59:38Z)
• Benchmarking adaptive variational quantum eigensolvers [63.277656713454284]
  We benchmark the accuracy of VQE and ADAPT-VQE to calculate the electronic ground states and potential energy curves. We find both methods provide good estimates of the energy and ground state. gradient-based optimization is more economical and delivers superior performance than analogous simulations carried out with gradient-frees.
  arXiv  Detail & Related papers  (2020-11-02T19:52:04Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.