In this thesis, we investigate the end-to-end implementation of quantum algorithms for solving differential equations through Hamiltonian simulation, with applications in finance, semi-classical physics, and hardware benchmarking. We particularly focus on the challenge of efficiently loading an initial state into a quantum computer, an area of research that has received limited exploration and whose existing methods have faced scrutiny regarding their robustness and efficiency. This work includes developing advanced techniques for encoding discretized real functions into quantum states and demonstrates how Hamiltonian simulation can be utilized to address the solution of linear partial differential equations through three key examples. These examples illustrate applications ranging from simulating non-Hermitian dynamics in finance to integrating classical Hamiltonian mechanics with quantum mechanics for semi-classical simulations, and introducing time-dependent coefficients for hardware benchmarking. Additionally, it is proposed a novel approach to connect the efficiency of quantum algorithms for nonlinear partial differential equations with physical parameters in fluid dynamics, offering deeper insights about when these algorithms can provide a computational advantage. This thesis establishes a solid foundation for future research and aims to advance the understanding and application of quantum algorithms in solving complex differential equations
In this thesis, we investigate the end-to-end implementation of quantum algorithms for solving differential equations through Hamiltonian simulation, with applications in finance, semi-classical physics, and hardware benchmarking. We particularly focus on the challenge of efficiently loading an initial state into a quantum computer, an area of research that has received limited exploration and whose existing methods have faced scrutiny regarding their robustness and efficiency. This work includes developing advanced techniques for encoding discretized real functions into quantum states and demonstrates how Hamiltonian simulation can be utilized to address the solution of linear partial differential equations through three key examples. These examples illustrate applications ranging from simulating non-Hermitian dynamics in finance to integrating classical Hamiltonian mechanics with quantum mechanics for semi-classical simulations, and introducing time-dependent coefficients for hardware benchmarking. Additionally, it is proposed a novel approach to connect the efficiency of quantum algorithms for nonlinear partial differential equations with physical parameters in fluid dynamics, offering deeper insights about when these algorithms can provide a computational advantage. This thesis establishes a solid foundation for future research and aims to advance the understanding and application of quantum algorithms in solving complex differential equations
We present a comprehensive review of quantum approaches for solving partial differential equations (PDEs) arising in computational fluid dynamics (CFD). We examine fully quantum approaches, including quantum linear system algorithms (QLSAs), ranging from the Harrow--Hassidim--Lloyd (HHL) algorithm to quantum singular value transformation (QSVT), Hamiltonian simulation, and quantum lattice Boltzmann methods (QLBMs), while emphasizing hybrid quantum--classical approaches, including quantum physics-informed neural networks (QPINNs) and amplitude-encoded variational PDE solvers. We focus on hardware-agnostic algorithms compatible with present noisy processors and emerging fault-tolerant architectures. For each framework, we analyze the mathematical formulation, algorithmic structure, and principal limitations. We also examine tensor-network (TN) representations, since CFD fields, differential operators, and geometrical information can often be encoded efficiently in low-rank form. The TN formalism bridges CFD discretizations and quantum states, operators, and circuits, enabling compact representations to be translated into tensor-programmable variational quantum algorithms (TP-VQAs). We further review benchmark problems, including Poisson, reaction, diffusion, and nonlinear model equations, and assess how well quantum algorithms capture key features of fluid dynamics. Our analysis highlights that potential quantum advantage is highly problem dependent and governed by condition number, representational complexity, state preparation, and measurement constraints. We outline capabilities, limitations, and challenges toward scalable quantum algorithms for CFD.
Quantum computers were first proposed to perform simulation -- in particular, quantum simulation. The premise is that such computers can simulate quantum dynamics exponentially faster than a classical computer. Some of the early proposals of practical applications of quantum computers come from quantum chemistry. Algorithms for more general systems, described by ordinary and partial differential equations, emerged later on. This thesis grounds on an extensive amount of prior research and proposes a set of improvements as well as new algorithms or algorithmic tools, focusing on applications from quantum chemistry and differential equations.First, we propose a technique relating to finding ground-states for electronic systems via the variational quantum eigensolver. The presented method enables solving the problem on early quantum hardware by a partitioning of the computational problem into smaller problems, using only classical resources to perform the partitioning. Next, the thesis considers simulation problems from chemistry in a more general sense. Following the idea that dynamical simulation of many chemical systems is efficient, whereas preparing ground-states is a `hard' problem, our computational framework leverages simulation routines to prepare molecular states as an input to a computation, relying only on `hard' input states for small problem instances. The preparation relies on dynamical scattering of initial fragments supported by a trap potential, allowing to estimate the success probability for certain bonds. A weak measurement scheme enables preparation of molecular states. Furthermore, this dissertation investigates quantum algorithms for differential equations. More specifically, the the Carleman linearization approach is considered to solve nonlinear differential equations. This entails bounding the Carleman truncation error, re-scaling of the solution to avoid an exponentially vanishing success probability, and discussing higher-order discretization. Moreover, this thesis introduced a penalty-based method to enforce constraints on the solution of differential equations, with inspiration from complex absorbing potentials and the quantum Zeno effect. We bound the approximation errors and embed the penalty method into an efficient quantum algorithm, with computational overhead only logarithmic in the penalty's strength. Efficiency is enabled by an interaction-picture approach with fast-forwardable constraint projections.
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.
This chapter covers quantum algorithms for numerically solving differential equations and the areas of application where such capabilities might be useful, such as computational fluid dynamics, semiconductor chip design, and many engineering workflows. We focus mainly on algorithms for linear differential equations (covering both partial and ordinary linear differential equations), but we also mention the additional nuances that arise for nonlinear differential equations. We discuss important caveats related to both the data input and output aspects of an end-to-end differential equation solver, and we place these quantum methods in the context of existing classical methods currently in use for these problems.
Partial differential equations (PDEs) play a central role in scientific and engineering analysis, with applications spanning fluid dynamics, heat and mass transfer, electromagnetism, quantum mechanics, and financial modeling, where they are used to describe diffusion processes, wave propagation, and the evolution of complex systems over space and time. Solving multidimensional partial differential equations (PDEs) is a computationally challenging problem, even for the most advanced classical systems. Over the past decade, quantum computing has attracted significant interest as a potential approach for solving complex computational problems, including multidimensional PDEs. Although a variety of approaches have been proposed for solving PDEs, most of the existing techniques are based on variational quantum algorithms (VQAs). Despite being promising, these VQA-based approaches suffer from low accuracy, long execution times, and limited scalability. In this work, we propose a scalable and efficient quantum algorithm for solving multidimensional PDEs. Our algorithm has two variants. One variant is based on the finite difference method (FDM), classical-to-quantum (C2Q) encoding, and numerical instantiation, whereas the other is based on FDM, C2Q, and column-by-column decomposition (CCD). We have also evaluated our algorithm using several practical case studies; namely, Poisson, heat, Black–Scholes, and Navier–Stokes equations. The results show that our proposed approach achieves higher accuracy, greater scalability, and faster execution time than the VQA-based approaches. We validated these findings on both noise-free and noisy simulators, as well as on a hardware emulator and real IBM quantum hardware.
Quantum computation is a promising approach to solving problems in physics, optimization, and numerical simulation. Quantum algorithms leverage superposition and entanglement in an exponentially large Hilbert space to encode and solve problems that are intractable for classical computers. However, these algorithms require error-corrected quantum hardware, which is not yet available. This thesis explores two alternative quantum-based approaches that promise to achieve better scalability than traditional algorithms in the near-term: Hybrid variational quantum algorithms (VQAs) and fully classical, quantum-inspired algorithms. In the first part, we review and benchmark optimization methods well suited for VQAs, specifically the Simultaneous Perturbation Stochastic Approximation (SPSA). We introduce complex-variable extensions and improvements to the second-order and quantum natural implementations. Finally, we assess their performance across quantum control, quantum tomography, and the variational quantum eigensolver, providing practical guidelines for common VQA scenarios. In the second part, we apply Matrix Product States (MPS) to solve time-dependent partial differential equations (PDEs). By integrating Hermite Distributed Approximating Functionals (HDAF) into the MPS framework, we develop a novel encoding to efficiently approximate differential operators with exponential precision. We benchmark this approach against traditional schemes for simulating the expansion of a levitated nanoparticle. The quantum-inspired numerical integration schemes deliver large memory savings and adequate runtimes even in presence of moderate chirping.