Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:1207.2485 · New Journal of Physics

Quantum algorithm and circuit design solving the Poisson equation

Yudong Cao, Anargyros Papageorgiou, Iasonas Petras, Joseph Traub, Sabre Kais

Published Jan 11, 2013• 234 citations
arXivHTMLPDF

Abstract

The Poisson equation occurs in many areas of science and engineering. Here we focus on its numerical solution for an equation in d dimensions. In particular we present a quantum algorithm and a scalable quantum circuit design which approximates the solution of the Poisson equation on a grid with error ε . We assume we are given a superposition of function evaluations of the right-hand side of the Poisson equation. The algorithm produces a quantum state encoding the solution. The number of quantum operations and the number of qubits used by the circuit is almost linear in d and polylog in ε −1 . We present quantum circuit modules together with performance guarantees which can also be used for other problems.

DOI
10.1088/1367-2630/15/1/013021

Related papers

Quantum simulation and circuit design for solving multidimensional Poisson equations

Holzmann, Michael, Koestler, Harald

Many methods solve Poisson equations by using grid techniques which discretize the problem in each dimension. Most of these algorithms are subject to the curse of dimensionality, so that they need exponential runtime. In the paper "Quantum algorithm and circuit design solving the Poisson equation" a quantum algorithm is shown running in polylog time to produce a quantum state representing the solution of the Poisson equation. In this paper a quantum simulation of an extended circuit design based on this algorithm is made on a classical computer. Our purpose is to test an efficient circuit design which can break the curse of dimensionality on a quantum computer. Due to the exponential rise of the Hilbert space this design is optimized on a small number of qubits. We use Microsoft's Quantum Development Kit and its simulator of an ideal quantum computer to validate the correctness of this algorithm.

arXiv:2006.09127•Jun 16, 2020•0 citations

Implementation of the HHL Algorithm for Solving the Poisson Equation on Quantum Simulators

Beimbet Daribayev, Aksultan Mukhanbet, Timur Imankulov

The Poisson equation is a fundamental equation of mathematical physics that describes the potential distribution in static fields. Solving the Poisson equation on a grid is computationally intensive and can be challenging for large grids. In recent years, quantum computing has emerged as a potential approach to solving the Poisson equation more efficiently. This article uses quantum algorithms, particularly the Harrow–Hassidim–Lloyd (HHL) algorithm, to solve the 2D Poisson equation. This algorithm can solve systems of equations faster than classical algorithms when the matrix A is sparse. The main idea is to use a quantum algorithm to transform the state vector encoding the solution of a system of equations into a superposition of states corresponding to the significant components of this solution. This superposition is measured to obtain the solution of the system of equations. The article also presents the materials and methods used to solve the Poisson equation using the HHL algorithm and provides a quantum circuit diagram. The results demonstrate the low error rate of the quantum algorithm when solving the Poisson equation.

Applied Sciences•Oct 20, 2023•13 citations

Variational quantum algorithm for the Poisson equation

Hailing Liu, Yusen Wu, Lin‐Chun Wan +4 more

The Poisson equation has wide applications in many areas of science and engineering. Although there are some quantum algorithms that can efficiently solve the Poisson equation, they generally require a fault-tolerant quantum computer, which is beyond the current technology. We propose a variational quantum algorithm (VQA) to solve the Poisson equation, which can be executed on noisy intermediate-scale quantum devices. In detail, we first adopt the finite-difference method to transform the Poisson equation into a linear system. Then, according to the special structure of the linear system, we find an explicit tensor product decomposition, with only $(2{log}_{2}n+1)$ items, of its coefficient matrix under a specific set of simple operators, where $n$ is the dimension of the coefficient matrix. This implies that the proposed VQA needs fewer quantum measurements, which dramatically reduces the required quantum resources. Additionally, we design observables to efficiently evaluate the expectation values of the simple operators on a quantum computer. Numerical experiments demonstrate that our algorithm can solve the Poisson equation.

arXiv:2012.07014•Physical Review A•Aug 18, 2021•147 citations

Advanced Quantum Poisson Solver in the NISQ era

Walter Robson, Kamal K. Saha, Connor Howington +2 more

The Poisson equation has many applications across the broad areas of science and engineering. Most quantum algorithms for the Poisson solver presented so far, either suffer from lack of accuracy and/or are limited to very small sizes of the problem, and thus have no practical usage. Here we present an advanced quantum algorithm for solving the Poisson equation with high accuracy and dynamically tunable problem size. After converting the Poisson equation to the linear systems through the finite difference method, we adopt the Harrow-Hassidim-Lloyd (HHL) algorithm as the basic framework. Particularly, in this work we present an advanced circuit that ensures the accuracy of the solution by implementing non-truncated eigenvalues through eigenvalue amplification as well as by increasing the accuracy of the controlled rotation angular coefficients, which are the critical factors in the HHL algorithm. We show that our algorithm not only increases the accuracy of the solutions, but also composes more practical and scalable circuits by dynamically controlling problem size in the NISQ devices. We present both simulated and experimental results, and discuss the sources of errors. Finally, we conclude that overall results on the quantum hardware are dominated by the error in the CNOT gates.

arXiv:2209.09366•IEEE International Conference on Quantum Computing and Engineering (QCE)•Sep 1, 2022•5 citations

A quantum Poisson solver implementable on NISQ devices (improved version)

Shengbin Wang, Zhimin Wang, Wendong Li +4 more

Solving differential equations is one of the most compelling applications of quantum computing. Most existing quantum algorithms addressing general ordinary and partial differential equations are thought to be too expensive to execute successfully on Noisy Intermediate-Scale Quantum (NISQ) devices. Here we propose a compact quantum algorithm for solving one-dimensional Poisson equation based on simple Ry rotation. The major operations are performed on probability amplitudes. Therefore, the present algorithm avoids the need to do phase estimation, Hamiltonian simulation and arithmetic. The solution error comes only from the finite difference approximation of the Poisson equation. Our quantum Poisson solver (QPS) has gate-complexity of 3n in qubits and 4n^3 in one- and two-qubit gates, where n is the logarithmic of the dimension of the linear system of equations. In terms of solution error ε, the complexity is log(1/ε) in qubits and poly(log(1/ε)) in operations, which is consist with the best known results. The present QPS may represent a potential application on NISQ devices.

arXiv:2005.00256•May 1, 2020•9 citations

Quantum Signal Processing for Linear PDEs: Circuit Design and Experimental Validation

Hyeongjin Kim, Revathi Jambunathan, Jan Balewski +1 more

Quantum algorithms offer new avenues for solving partial differential equations (PDEs). While the potential for end-to-end quantum advantage is at present not well understood, recent literature presents explicit circuit constructions for solving certain classes of linear PDEs in the frequency domain and thus offers concrete examples to study. In this work, we develop end-to-end implementations of these quantum circuits compiled to machine-level instructions and benchmark them in both numerical simulations and IBMQ hardware experiments. We focus on the advection, wave, and Poisson equations and study quantum circuits that propagate the dynamics in frequency space via the quantum Fourier transform using approximate methods based on a first-order approximation which offer compact representations with uncontrollable approximation error, and polynomial approximation methods based on quantum signal processing (QSP) leading to deeper circuits with tunable algorithmic error. In addition, we experimentally demonstrate that the QSP-augmented algorithm can provide accurate solutions under realistic hardware constraints. Finally, we extend our method to address non-homogeneous Dirichlet boundary conditions and verify it numerically for a Poisson equation with source term obtained from high-fidelity physics simulations of a capacitively coupled plasma.

quant-pharXiv:2606.00368•Jun 2, 2026•1 citation
The Poisson equation occurs in many areas of science and engineering. Here we focus on its numerical solution for an equation in d dimensions. In particular we present a quantum algorithm and a scalable quantum circuit design which approximates the solution of the Poisson equation on a grid with error ε . We assume we are given a superposition of function evaluations of the right-hand side of the Poisson equation. The algorithm produces a quantum state encoding the solution. The number of quantum operations and the number of qubits used by the circuit is almost linear in d and polylog in ε −1 . We present quantum circuit modules together with performance guarantees which can also be used for other problems.
Many methods solve Poisson equations by using grid techniques which discretize the problem in each dimension. Most of these algorithms are subject to the curse of dimensionality, so that they need exponential runtime. In the paper "Quantum algorithm and circuit design solving the Poisson equation" a quantum algorithm is shown running in polylog time to produce a quantum state representing the solution of the Poisson equation. In this paper a quantum simulation of an extended circuit design based on this algorithm is made on a classical computer. Our purpose is to test an efficient circuit design which can break the curse of dimensionality on a quantum computer. Due to the exponential rise of the Hilbert space this design is optimized on a small number of qubits. We use Microsoft's Quantum Development Kit and its simulator of an ideal quantum computer to validate the correctness of this algorithm.
The Poisson equation is a fundamental equation of mathematical physics that describes the potential distribution in static fields. Solving the Poisson equation on a grid is computationally intensive and can be challenging for large grids. In recent years, quantum computing has emerged as a potential approach to solving the Poisson equation more efficiently. This article uses quantum algorithms, particularly the Harrow–Hassidim–Lloyd (HHL) algorithm, to solve the 2D Poisson equation. This algorithm can solve systems of equations faster than classical algorithms when the matrix A is sparse. The main idea is to use a quantum algorithm to transform the state vector encoding the solution of a system of equations into a superposition of states corresponding to the significant components of this solution. This superposition is measured to obtain the solution of the system of equations. The article also presents the materials and methods used to solve the Poisson equation using the HHL algorithm and provides a quantum circuit diagram. The results demonstrate the low error rate of the quantum algorithm when solving the Poisson equation.
The Poisson equation has wide applications in many areas of science and engineering. Although there are some quantum algorithms that can efficiently solve the Poisson equation, they generally require a fault-tolerant quantum computer, which is beyond the current technology. We propose a variational quantum algorithm (VQA) to solve the Poisson equation, which can be executed on noisy intermediate-scale quantum devices. In detail, we first adopt the finite-difference method to transform the Poisson equation into a linear system. Then, according to the special structure of the linear system, we find an explicit tensor product decomposition, with only (2log2n+1)(2{log}_{2}n+1)(2log2​n+1) items, of its coefficient matrix under a specific set of simple operators, where nnn is the dimension of the coefficient matrix. This implies that the proposed VQA needs fewer quantum measurements, which dramatically reduces the required quantum resources. Additionally, we design observables to efficiently evaluate the expectation values of the simple operators on a quantum computer. Numerical experiments demonstrate that our algorithm can solve the Poisson equation.
The Poisson equation has many applications across the broad areas of science and engineering. Most quantum algorithms for the Poisson solver presented so far, either suffer from lack of accuracy and/or are limited to very small sizes of the problem, and thus have no practical usage. Here we present an advanced quantum algorithm for solving the Poisson equation with high accuracy and dynamically tunable problem size. After converting the Poisson equation to the linear systems through the finite difference method, we adopt the Harrow-Hassidim-Lloyd (HHL) algorithm as the basic framework. Particularly, in this work we present an advanced circuit that ensures the accuracy of the solution by implementing non-truncated eigenvalues through eigenvalue amplification as well as by increasing the accuracy of the controlled rotation angular coefficients, which are the critical factors in the HHL algorithm. We show that our algorithm not only increases the accuracy of the solutions, but also composes more practical and scalable circuits by dynamically controlling problem size in the NISQ devices. We present both simulated and experimental results, and discuss the sources of errors. Finally, we conclude that overall results on the quantum hardware are dominated by the error in the CNOT gates.
Solving differential equations is one of the most compelling applications of quantum computing. Most existing quantum algorithms addressing general ordinary and partial differential equations are thought to be too expensive to execute successfully on Noisy Intermediate-Scale Quantum (NISQ) devices. Here we propose a compact quantum algorithm for solving one-dimensional Poisson equation based on simple Ry rotation. The major operations are performed on probability amplitudes. Therefore, the present algorithm avoids the need to do phase estimation, Hamiltonian simulation and arithmetic. The solution error comes only from the finite difference approximation of the Poisson equation. Our quantum Poisson solver (QPS) has gate-complexity of 3n in qubits and 4n^3 in one- and two-qubit gates, where n is the logarithmic of the dimension of the linear system of equations. In terms of solution error ε, the complexity is log(1/ε) in qubits and poly(log(1/ε)) in operations, which is consist with the best known results. The present QPS may represent a potential application on NISQ devices.
Quantum algorithms offer new avenues for solving partial differential equations (PDEs). While the potential for end-to-end quantum advantage is at present not well understood, recent literature presents explicit circuit constructions for solving certain classes of linear PDEs in the frequency domain and thus offers concrete examples to study. In this work, we develop end-to-end implementations of these quantum circuits compiled to machine-level instructions and benchmark them in both numerical simulations and IBMQ hardware experiments. We focus on the advection, wave, and Poisson equations and study quantum circuits that propagate the dynamics in frequency space via the quantum Fourier transform using approximate methods based on a first-order approximation which offer compact representations with uncontrollable approximation error, and polynomial approximation methods based on quantum signal processing (QSP) leading to deeper circuits with tunable algorithmic error. In addition, we experimentally demonstrate that the QSP-augmented algorithm can provide accurate solutions under realistic hardware constraints. Finally, we extend our method to address non-homogeneous Dirichlet boundary conditions and verify it numerically for a Poisson equation with source term obtained from high-fidelity physics simulations of a capacitively coupled plasma.