One of the most promising applications of quantum computers is solving partial differential equations (PDEs). By using the Schrödingerization technique—which converts nonconservative PDEs into Schrödinger equations—the problem can be reduced to Hamiltonian simulations. The particular class of Hamiltonians we consider is shown to be sufficient for simulating almost any linear PDE. In particular, these Hamiltonians consist of discretizations of polynomial products and sums of position and momentum operators. This paper addresses an important gap by efficiently loading these Hamiltonians into the quantum computer through block-encoding. The construction is explicit and efficient in terms of one- and two-qubit operations, forming a fundamental building block for constructing the unitary evolution operator for that class of Hamiltonians. The proposed algorithm demonstrates a squared logarithmic scaling with respect to the spatial partitioning size, offering a polynomial speedup over classical finite-difference methods in the context of spatial partitioning for solving PDEs. Furthermore, the algorithm is extended to the multidimensional case, achieving an exponential acceleration with respect to the number of dimensions, alleviating the curse of dimensionality problem. This work provides an essential foundation for developing explicit and efficient quantum circuits for PDEs, Hamiltonian simulations, and ground state and thermal state preparation.
One of the most promising applications of quantum computers is solving partial differential equations (PDEs). By using the Schrödingerization technique—which converts nonconservative PDEs into Schrödinger equations—the problem can be reduced to Hamiltonian simulations. The particular class of Hamiltonians we consider is shown to be sufficient for simulating almost any linear PDE. In particular, these Hamiltonians consist of discretizations of polynomial products and sums of position and momentum operators. This paper addresses an important gap by efficiently loading these Hamiltonians into the quantum computer through block-encoding. The construction is explicit and efficient in terms of one- and two-qubit operations, forming a fundamental building block for constructing the unitary evolution operator for that class of Hamiltonians. The proposed algorithm demonstrates a squared logarithmic scaling with respect to the spatial partitioning size, offering a polynomial speedup over classical finite-difference methods in the context of spatial partitioning for solving PDEs. Furthermore, the algorithm is extended to the multidimensional case, achieving an exponential acceleration with respect to the number of dimensions, alleviating the curse of dimensionality problem. This work provides an essential foundation for developing explicit and efficient quantum circuits for PDEs, Hamiltonian simulations, and ground state and thermal state preparation.
Abstract We propose an explicit quantum framework for numerically simulating general linear partial differential equations (PDEs), extending previous work (Guseynov et al 2025 Phys. Rev. Res. 7 033100) to incorporate (a) Robin boundary conditions—which include Neumann and Dirichlet conditions as special cases–(b) inhomogeneous terms, and (c) variable coefficients in space and time. Our approach begins with a general finite-difference discretization and applies the Schrödingerisation technique to transform the resulting system into one that admits unitary quantum evolution, enabling quantum simulation. For the Schrödinger equation corresponding to the discretized PDE, we construct an efficient block-encoding of the Hamiltonian H that scales polylogarithmically with the number of grid points N . This encoding is compatible with quantum signal processing and allows for the implementation of the evolution operator e − i H t . The explicit circuit construction in our method permits complexity to be measured in fundamental gate units–namely, CNOT gates and single-qubit rotations–bypassing the inefficiencies of oracle queries. Consequently, the overall algorithm scales polynomially with N and linearly with the spatial dimension d . Under certain input/output assumptions our method achieves a polynomial speedup in N and an exponential advantage in d for a wide class of PDEs, thereby mitigating the classical curse of dimensionality. The validity and efficiency of the proposed approach are further substantiated by numerical simulations. By explicitly defining the quantum operations and quantifying their resource requirements, our approach offers a practical alternative for numerically solving PDEs, distinct from others that rely on oracle queries and purely asymptotic scaling methods.
Solving partial differential equations for extremely large-scale systems within a feasible computation time serves in accelerating engineering developments. Quantum computing algorithms, particularly the Hamiltonian simulations, present a potential and promising approach to achieve this purpose. Actually, there are several oracle-based Hamiltonian simulations with potential quantum speedup, but their detailed implementations and accordingly the detailed computational complexities are all unclear. This paper presents a method that enables us to explicitly implement the quantum circuit for Hamiltonian simulation; the key technique is the explicit gate construction of differential operators contained in the target partial differential equation discretized by the finite difference method. Moreover, we show that the space and time complexities of the constructed circuit are exponentially smaller than those of conventional classical algorithms. We also provide numerical experiments and an experiment on a real device for the wave equation to demonstrate the validity of our proposed method. Published by the American Physical Society 2024
Quantum computing has emerged as a promising avenue for achieving significant speedup, particularly in large-scale PDE simulations, compared to classical computing. One of the main quantum approaches involves utilizing Hamiltonian simulation, which is directly applicable only to Schrödinger-type equations. To address this limitation, Schrödingerisation techniques have been developed, employing the warped transformation to convert general linear PDEs into Schrödinger-type equations. However, despite the development of Schrödingerisation techniques, the explicit implementation of the corresponding quantum circuit for solving general PDEs remains to be designed. In this paper, we present detailed implementation of a quantum algorithm for general PDEs using Schrödingerisation techniques. We provide examples of the heat equation, and the advection equation approximated by the upwind scheme, to demonstrate the effectiveness of our approach. Complexity analysis is also carried out to demonstrate the quantum advantages of these algorithms in high dimensions over their classical counterparts.
Solving differential equations is one of the most computationally expensive problems in classical computing, occupying the vast majority of high-performance computing resources devoted towards practical applications in various fields of science and engineering. Despite recent progress made in the field of quantum computing and quantum algorithms, its end-to-end application towards practical realization still remains unattainable. In this article, we tackle one of the primary obstacles towards this ultimate objective, specifically the encoding of matrices derived via finite difference method solving Poisson partial differential equations in simple boundary-value problems. To that end, we propose a novel methodology called block-diagonalization, which provides a common decomposition form for our matrices, and similarly a common procedure for block-encoding these matrices inside a unitary operator of a quantum circuit. The depth of these circuits is double-logarithmic in the matrix size, which is an exponential improvement over existing quantum methods and a superexponential improvement over existing classical methods. These improvements come at the price of a constant multiplicative overhead on the number of qubits and the number of gates. Combined with quantum linear solver algorithms, we can utilize these quantum circuits to produce a quantum state representation of the solution to the Poisson partial differential equations and their boundary-value problems.
Partial differential equations (PDEs) are crucial for modeling various physical phenomena such as heat transfer, fluid flow, and electromagnetic waves. In computer-aided engineering (CAE), the ability to handle fine resolutions and large computational models is essential for improving product performance and reducing development costs. However, solving large-scale PDEs, particularly for systems with spatially varying material properties, poses significant computational challenges. In this paper, we propose a quantum algorithm for solving second-order linear PDEs of nonconservative systems with spatially varying parameters, using the linear combination of the Hamiltonian simulation (LCHS) method. Our approach transforms those PDEs into ordinary differential equations represented by qubit operators, through spatial discretization using the finite-difference method. Then, we provide an algorithm that efficiently constructs the operator corresponding to the spatially varying parameters of PDEs via a logic minimization technique, which reduces the number of terms and subsequently the circuit depth. We also develop a scalable method for realizing a quantum circuit for LCHS, using a tensor-network-based technique, specifically a matrix product state (MPS). We validate our method with applications to the acoustic equation with spatially varying parameters and the dissipative heat equation. Our approach includes a detailed recipe for constructing quantum circuits for PDEs, leveraging efficient encoding of spatially varying parameters of PDEs and scalable implementation of LCHS, which we believe marks a significant step towards advancing quantum computing's role in solving practical engineering problems.
Discrete Laplacian operators arise ubiquitously in scientific computing and frequently appear in quantum algorithms for tasks such as linear algebra, Hamiltonian simulation, and partial differential equations. Block encoding provides the standard method for accessing matrix data within quantum circuits. Efficient implementations of such algorithms require efficient block encodings of the discretized operator. While several general-purpose techniques exist for block encoding arbitrary matrices, they usually require deep quantum circuits. Moreover, existing efficient constructions that exploit Laplacian structure are limited in scope, typically assuming fixed boundary conditions or uniform grid resolutions. In this work, we present a unified framework for efficiently block encoding finite-difference discretizations of the Laplacian that supports Dirichlet, periodic, and Neumann boundary conditions in arbitrary spatial dimensions. Our construction allows different boundary conditions and grid sizes to be specified independently along each coordinate axis, enabling mixed-boundary and anisotropic discretizations within a single modular circuit architecture. We provide analytical gate-complexity estimates and perform circuit-level benchmarks after transpilation to an IBM hardware gate set. Across one-, two-, and three-dimensional examples, the resulting circuits exhibit substantially lower gate counts and higher success probabilities when compared to certain existing approaches.