Purpose This study aims to assess the use of variational quantum imaginary time evolution for solving partial differential equations using real-amplitude ansätze with full circular entangling layers. A graphical mapping technique for encoding impulse functions is also proposed. Design/methodology/approach The Smoluchowski equation, including the Derjaguin–Landau–Verwey–Overbeek potential energy, is solved to simulate colloidal deposition on a planar wall. The performance of different types of entangling layers and over-parameterization is evaluated. Findings Colloidal transport can be modelled adequately with variational quantum simulations. Full circular entangling layers with real-amplitude ansätze lead to higher-fidelity solutions. In most cases, the proposed graphical mapping technique requires only a single bit-flip with a parametric gate. Over-parameterization is necessary to satisfy certain physical boundary conditions, and higher-order time-stepping reduces norm errors. Practical implications Variational quantum simulation can solve partial differential equations using near-term quantum devices. The proposed graphical mapping technique could potentially aid quantum simulations for certain applications. Originality/value This study shows a concrete application of variational quantum simulation methods in solving practically relevant partial differential equations. It also provides insight into the performance of different types of entangling layers and over-parameterization. The proposed graphical mapping technique could be valuable for quantum simulation implementations. The findings contribute to the growing body of research on using variational quantum simulations for solving partial differential equations.
Purpose This study aims to assess the use of variational quantum imaginary time evolution for solving partial differential equations using real-amplitude ansätze with full circular entangling layers. A graphical mapping technique for encoding impulse functions is also proposed. Design/methodology/approach The Smoluchowski equation, including the Derjaguin–Landau–Verwey–Overbeek potential energy, is solved to simulate colloidal deposition on a planar wall. The performance of different types of entangling layers and over-parameterization is evaluated. Findings Colloidal transport can be modelled adequately with variational quantum simulations. Full circular entangling layers with real-amplitude ansätze lead to higher-fidelity solutions. In most cases, the proposed graphical mapping technique requires only a single bit-flip with a parametric gate. Over-parameterization is necessary to satisfy certain physical boundary conditions, and higher-order time-stepping reduces norm errors. Practical implications Variational quantum simulation can solve partial differential equations using near-term quantum devices. The proposed graphical mapping technique could potentially aid quantum simulations for certain applications. Originality/value This study shows a concrete application of variational quantum simulation methods in solving practically relevant partial differential equations. It also provides insight into the performance of different types of entangling layers and over-parameterization. The proposed graphical mapping technique could be valuable for quantum simulation implementations. The findings contribute to the growing body of research on using variational quantum simulations for solving partial differential equations.
The paper presents a variational quantum algorithm to solve initial–boundary value problems described by second-order partial differential equations. The approach uses hybrid classical/quantum framework that is well suited for quantum computers of the current noisy intermediate-scale quantum era. The partial differential equation is initially translated into an optimal control problem with a modular control-to-state operator (ansatz). The objective function and its derivatives required by the optimizer can efficiently be evaluated on a quantum computer by measuring an ancilla qubit, while the optimization procedure employs classical hardware. The focal aspect of the study is the treatment of boundary conditions, which is tailored to the properties of the quantum hardware using a correction technique. For this purpose, the boundary conditions and the discretized terms of the partial differential equation are decomposed into a sequence of unitary operations and subsequently compiled into quantum gates. The accuracy and gate complexity of the approach are assessed for second-order partial differential equations by classically emulating the quantum hardware. The examples include steady and unsteady diffusive transport equations for a scalar property in combination with various Dirichlet, Neumann, or Robin conditions. The results of this flexible approach display a robust behavior and a strong predictive accuracy in combination with a remarkable polylog complexity scaling in the number of qubits of the involved quantum circuits. Remaining challenges refer to adaptive ansatz strategies that speed up the optimization procedure.
Quantum computing has the potential to revolutionize computational problem-solving by leveraging the quantum mechanical phenomena such as superposition and entanglement, enabling fundamentally different computational strategies compared to classical computing. Classical methods for solving complex and high dimensional partial differential equations (PDEs), crucial for modeling diverse physical phenomena, suffer from an exponential growth in computational complexity known as the curse of dimensionality. This can limit their effectiveness for certain high-resolution simulations and real-time computational applications. In contrast, quantum computing inherently exploits superposition and entanglement to efficiently represent and simultaneously manipulate large-scale discretized PDEs, using exponentially fewer resources compared to classical systems. There are currently many quantum techniques available for solving partial differential equations (PDEs), which are mainly based on variational quantum circuits. However, the existing quantum PDE solvers, particularly those based on variational quantum eigensolver (VQE) techniques, suffer from several limitations. These include low accuracy, high execution times, and low scalability on quantum simulators as well as on noisy intermediate-scale quantum (NISQ) devices, especially for multidimensional PDEs. In this work, we propose an efficient and scalable algorithm for solving multidimensional PDEs. We present two variants of our algorithm: the first leverages finite-difference method (FDM), classical-to-quantum (C2Q) encoding, and numerical instantiation, while the second employs FDM, C2Q, and column-by-column decomposition (CCD). Both variants are designed to enhance accuracy and scalability while reducing execution times. We have validated and evaluated our proposed concepts using a number of case studies including multidimensional Poisson equation, multidimensional heat equation, Black Scholes equation for financial option pricing, and Navier-Stokes equation for computational fluid dynamics (CFD), achieving promising results. Our results demonstrate higher accuracy, higher scalability, and faster execution times compared to VQE-based solvers on noise-free and noisy quantum simulators from IBM. Additionally, we validated our approach on hardware emulators and actual quantum hardware, employing noise mitigation techniques. This work establishes a practical and effective approach for solving PDEs using quantum computing for engineering and scientific applications.
Solving nonlinear partial differential equations is important in various scientific and engineering applications. Recently, quantum computing was introduced as an alternative computational paradigm for solving nonlinear partial differential equations. In this paper, a new method called the variational quantum homotopy perturbation method is proposed to improve the scalability of solving nonlinear partial differential equations through two aspects. First, the dimension of the Hilbert space remains the same after the nonlinear partial differential equation is linearized through the homotopy perturbation. Second, the solutions are obtained with a variational quantum simulation framework, where the number of qubits is decreased with functional encoding and the depth of parametrized circuits is reduced. The additional contribution of this paper is the introduction of new criteria for selecting the homotopy series truncation order and circuit depth for cost-effective variational quantum homotopy perturbation method. The proposed approach is demonstrated with several examples, including the vorticity transport equation and the reduced magnetohydrodynamics equations.
We propose an algorithm based on variational quantum imaginary time evolution for solving the Feynman-Kac partial differential equation resulting from a multidimensional system of stochastic differential equations. We utilize the correspondence between the Feynman-Kac partial differential equation (PDE) and the Wick-rotated Schrödinger equation for this purpose. The results for a (2+1) dimensional Feynman-Kac system obtained through the variational quantum algorithm are then compared against classical ODE solvers and Monte Carlo simulation. We see a remarkable agreement between the classical methods and the quantum variational method for an illustrative example on six and eight qubits. In the non-trivial case of PDEs which are preserving probability distributions – rather than preserving the ℓ2 -norm – we introduce a proxy norm which is efficient in keeping the solution approximately normalized throughout the evolution. The algorithmic complexity and costs associated to this methodology, in particular for the extraction of properties of the solution, are investigated. Future research topics in the areas of quantitative finance and other types of PDEs are also discussed.
Quantum computing has the potential to transform computational problem-solving by leveraging quantum mechanical principles of superposition and entanglement. This capability is particularly important for the numerical solution of complex and/or multidimensional partial differential equations (PDEs). There are currently many quantum techniques available for solving PDEs, which are mainly based on variational quantum algorithms (VQAs). However, the existing quantum PDE solvers, particularly those based on VQAs suffer from limitations such as low accuracy, high execution times, and low scalability on both simulators as well as on real quantum devices. In this work, we propose an efficient and scalable algorithm for solving multidimensional PDEs. We present two variants of our algorithm: the first leverages finite-difference method (FDM), classical-to-quantum (C2Q) encoding, and numerical instantiation, while the second employs FDM, C2Q, and column-by-column decomposition (CCD). Both variants are designed to enhance accuracy and scalability while reducing execution times. We have validated our proposed algorithm by solving several practically useful PDEs such as Poisson, heat, Black-Scholes, and Navier-Stokes equations. Our results demonstrate higher accuracy, higher scalability, and faster execution times compared to VQA-based solvers on noise-free and noisy quantum simulators from IBM and achieved promising results on real quantum hardware.
A variational quantum algorithm for numerically solving partial differential equations (PDEs) on a quantum computer was proposed by Lubasch et al. [Phys. Rev. A 101, 010301(R) (2020)]. In this paper we generalize the method introduced by Lubasch et al. to cover a broader class of nonlinear PDEs as well as multidimensional PDEs and study the performance of the variational quantum algorithm on several example equations. Specifically, we show via numerical simulations that the algorithm can solve instances of the single-asset Black-Scholes equation with a nontrivial nonlinear volatility model, the double-asset Black-Scholes equation, the Buckmaster equation, and the deterministic Kardar-Parisi-Zhang equation. Our simulations use up to n=12 Ansatz qubits, computing PDE solutions with 2n grid points. We also perform proof-of-concept demonstrations with a trapped-ion quantum processor from IonQ [Nat. Commun. 10, 5464 (2019)], showing accurate computation of two representative expectation values needed for the calculation of a single time step of the nonlinear Black-Scholes equation. Through our classical simulations and demonstrations on quantum hardware, we identify and discuss several open challenges for using quantum variational methods to solve PDEs in a regime with a large number (much greater than 220) of grid points, but also a practical number of gates per circuit and circuit shots.