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:2608.10809

A Quantum Algorithm for Solving the Poisson Equation for Free Field Conditions via the Hockney Method

Hans A. Kösel, Roland Ewert, Jan W. Delfs

quant-phSubmitted Aug 11, 2026• Announced Aug 12, 2026• 0 citations
arXivHTMLPDF

Abstract

For the often encountered problem of the Poisson equation, this work presents a quantum algorithm solving it based on the quantum Fourier transform (QFT) for periodic boundary conditions as well as free field conditions, where the latter is realized via the Hockney method. Besides the QFT and an initialization procedure for amplitude encoding, the algorithm just uses a procedure for multiplying the state vector by a diagonal matrix w.r.t. amplitude encoding. For the latter, two alternative implementations are considered here. The first variant is a version of the LCU method and the second is a sequence of multi-controlled rotation gates that represents a factoring of the multiplied values into absolute values and complex phase factors. The functionality of the algorithm is verified via comparing the results obtained from state vector simulations for one- and two-dimensional test examples with their analytical solutions. For the considered test examples, it is found that the success probability for obtaining the desired ancilla qubit subspace in the LCU version is a factor of around two higher than that for the sequence of multi-controlled rotation gates. However, the LCU version requires a number of ancilla qubits up to the number of qubits that is set to store the discretized source term of the Poisson equation in amplitude encoding, whereas the sequence of multi-controlled rotation gates demands only one ancilla qubit. Computations of the success probabilities for both variants furthermore indicate that the success probability converges for a specific problem with increasing resolution. Concerning the required computational resources for the quantum algorithm, the conclusion is drawn that while the QFT is a more efficient procedure than its classical counterpart, the current implementations of the other necessary steps in the algorithm diminish the efficiency w.r.t. the runtime.

Related papers

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

A quantum Poisson solver implementable on NISQ devices

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 {\epsilon}, the complexity is log(1/{\epsilon}) in qubits and poly(log(1/{\epsilon})) in operations, which is consist with the best known results. The present QPS may represent a potential application on NISQ devices.

•May 1, 2020•5 citations

A QSVT-Based Quantum Jacobi Algorithm for Linear Systems with Application to the Poisson Equation

Louisa M. Piskol, Thorsten Grahs, Stefan Langer +1 more

Many computational fluid dynamics (CFD) algorithms solve partial differential equations by discretization, resulting in large and sparse systems of linear equations. While iterative methods are widely used to solve these systems classically, most existing quantum linear system solvers target the solution through matrix inversion rather than approximating it using an iterative procedure. In this work, we develop a quantum implementation of the Jacobi method based on quantum singular value transformation (QSVT). By reformulating the Jacobi iteration as a polynomial transformation of a block-encoded operator, the algorithm requires only a constant ancilla overhead with respect to the number of iterations while maintaining a circuit depth that scales linearly with the iteration number. We demonstrate the algorithm for one- and two-dimensional Poisson problems, including the pressure Poisson equation arising in Chorin's projection method for the lid-driven cavity flow. The proposed algorithm provides a promising building block for future quantum implementations of multigrid methods and preconditioning techniques, bringing quantum algorithms closer to established CFD solution strategies.

quant-pharXiv:2609.24266•Sep 22, 2026•0 citations

Quantum Poisson solver without arithmetic

Shengbin Wang, Zhimin Wang, Guolong Cui +6 more

Abstract Solving differential equations is one of the most promising applications of quantum computing. The Poisson equation has applications in various domains of physics and engineering, including the simulation of ocean current dynamics. Here, we propose an efficient quantum algorithm for solving the one-dimensional Poisson equation based on the controlled Ry rotations. Our quantum Poisson solver (QPS) removes the need for expensive routines such as phase estimation, quantum arithmetic or Hamiltonian simulation. The computational cost of our QPS is 3n in qubits and 5/3n3 in one- and two-qubit gates, where n is the logarithmic of the number of discrete points. An overwhelming reduction of the constant factors of the big-O complexity is achieved, which is critical to evaluate the practicality of implementing the algorithm on a quantum computer. In terms of the error ε, the complexity is log(1/ε) in qubits and poly(log(1/ε)) in operations. The algorithms are demonstrated using a quantum virtual computing system, and the circuits are executed successfully on the IBM real quantum computers. The present QPS could exhibit a potential real-world application for solving differential equations on noisy intermediate-scale quantum (NISQ) devices.

Intelligent Marine Technology and Systems•Feb 8, 2024•5 citations

A Quantum Spectral Method for Non-Periodic Boundary Value Problems

Eky Febrianto, Yiren Wang, Burigede Liu +2 more

Quantum computing holds the promise of solving computational mechanics problems in polylogarithmic time, meaning computational time scales as $\mathscr{O}((\log N)^c)$, where $N$ is the problem size and $c$ a constant. We propose a quantum spectral method with polylogarithmic complexity for solving non-periodic boundary value problems with arbitrary Dirichlet boundary conditions. Our method extends the recently proposed approach by Liu et al. (2025), in which periodic problems are discretised using truncated Fourier series. In such spectral methods, the discretisation of boundary value problems with constant coefficients leads to a set of algebraic equations in the Fourier space. We implement the respective diagonal solution operator by first approximating it with a polynomial and then quantum encoding the polynomial. The mapping between the physical and Fourier spaces is accomplished using the quantum Fourier transform (QFT). To impose zero Dirichlet boundary conditions, we double the domain size and reflect all physical fields antisymmetrically. The respective reflection matrix defines the quantum sine transform (QST) by pre- and post-multiplying with the QFT. For non-zero Dirichlet boundary conditions, the solution is decomposed into a boundary-conforming and a homogeneous part. The homogenous part is determined by solving a problem with a suitably modified forcing vector. We illustrate the basic approach with a Dirichlet-Poisson problem and demonstrate its generality by applying it to a fractional stochastic PDE for modelling spatial random fields. We discuss the circuit implementation of the proposed approach and provide numerical evidence confirming its polylogarithmic complexity.

math.NACross-listedarXiv:2511.11494•Computer Methods in Applied Mechanics and Engineering•Nov 17, 2025•7 citations

IQFEM: A quantum finite element method for heterogeneous problems with immersed boundaries

Shehara Perera, Yiren Wang, Fehmi Cirak

Quantum computing offers the potential to solve computational mechanics problems with a more favourable complexity scaling than classically possible. To realise this potential, a quantum-compatible formulation of the finite element method is essential. We present such a formulation for Poisson problems with spatially varying coefficients on general domains discretised by an immersed uniform Cartesian grid. The resulting banded sparse system matrices are encoded as the sum of diagonal matrices with polynomial entries and their products with shift matrices. The sum of the matrices is formed using the linear combination of unitaries (LCU) technique. The resulting block-encoded system matrix can be implemented using a polylogarithmic number of elementary gates. For immersed boundaries, the block-encoded system matrix is further processed using a diagonal indicator matrix with zeros and ones. The indicator matrix is defined in terms of an integer-valued level-set function composed of simple geometric primitives via Boolean set operations. The required integer operations are computed on the fly using quantum arithmetic. The resulting block-encoded linear system of equations is solved using quantum singular value transformation (QSVT). The overall gate count, including the QSVT, is $O(N_{\text{tot}}^{2/d} \operatorname{polylog}(N_{\text{tot}}))$, where $d$ is the problem dimension and $N_{\text{tot}}$ the number of grid points. In numerical examples that confirm the theoretical complexity estimates, the solutions converge approximately linearly for immersed problems and quadratically for simply connected domains.

arXiv:2609.14077•Sep 12, 2026•0 citations
For the often encountered problem of the Poisson equation, this work presents a quantum algorithm solving it based on the quantum Fourier transform (QFT) for periodic boundary conditions as well as free field conditions, where the latter is realized via the Hockney method. Besides the QFT and an initialization procedure for amplitude encoding, the algorithm just uses a procedure for multiplying the state vector by a diagonal matrix w.r.t. amplitude encoding. For the latter, two alternative implementations are considered here. The first variant is a version of the LCU method and the second is a sequence of multi-controlled rotation gates that represents a factoring of the multiplied values into absolute values and complex phase factors. The functionality of the algorithm is verified via comparing the results obtained from state vector simulations for one- and two-dimensional test examples with their analytical solutions. For the considered test examples, it is found that the success probability for obtaining the desired ancilla qubit subspace in the LCU version is a factor of around two higher than that for the sequence of multi-controlled rotation gates. However, the LCU version requires a number of ancilla qubits up to the number of qubits that is set to store the discretized source term of the Poisson equation in amplitude encoding, whereas the sequence of multi-controlled rotation gates demands only one ancilla qubit. Computations of the success probabilities for both variants furthermore indicate that the success probability converges for a specific problem with increasing resolution. Concerning the required computational resources for the quantum algorithm, the conclusion is drawn that while the QFT is a more efficient procedure than its classical counterpart, the current implementations of the other necessary steps in the algorithm diminish the efficiency w.r.t. the runtime.
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.
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 {\epsilon}, the complexity is log(1/{\epsilon}) in qubits and poly(log(1/{\epsilon})) in operations, which is consist with the best known results. The present QPS may represent a potential application on NISQ devices.
Many computational fluid dynamics (CFD) algorithms solve partial differential equations by discretization, resulting in large and sparse systems of linear equations. While iterative methods are widely used to solve these systems classically, most existing quantum linear system solvers target the solution through matrix inversion rather than approximating it using an iterative procedure. In this work, we develop a quantum implementation of the Jacobi method based on quantum singular value transformation (QSVT). By reformulating the Jacobi iteration as a polynomial transformation of a block-encoded operator, the algorithm requires only a constant ancilla overhead with respect to the number of iterations while maintaining a circuit depth that scales linearly with the iteration number. We demonstrate the algorithm for one- and two-dimensional Poisson problems, including the pressure Poisson equation arising in Chorin's projection method for the lid-driven cavity flow. The proposed algorithm provides a promising building block for future quantum implementations of multigrid methods and preconditioning techniques, bringing quantum algorithms closer to established CFD solution strategies.
Abstract Solving differential equations is one of the most promising applications of quantum computing. The Poisson equation has applications in various domains of physics and engineering, including the simulation of ocean current dynamics. Here, we propose an efficient quantum algorithm for solving the one-dimensional Poisson equation based on the controlled Ry rotations. Our quantum Poisson solver (QPS) removes the need for expensive routines such as phase estimation, quantum arithmetic or Hamiltonian simulation. The computational cost of our QPS is 3n in qubits and 5/3n3 in one- and two-qubit gates, where n is the logarithmic of the number of discrete points. An overwhelming reduction of the constant factors of the big-O complexity is achieved, which is critical to evaluate the practicality of implementing the algorithm on a quantum computer. In terms of the error ε, the complexity is log(1/ε) in qubits and poly(log(1/ε)) in operations. The algorithms are demonstrated using a quantum virtual computing system, and the circuits are executed successfully on the IBM real quantum computers. The present QPS could exhibit a potential real-world application for solving differential equations on noisy intermediate-scale quantum (NISQ) devices.
Quantum computing holds the promise of solving computational mechanics problems in polylogarithmic time, meaning computational time scales as O((log⁡N)c)\mathscr{O}((\log N)^c)O((logN)c), where NNN is the problem size and ccc a constant. We propose a quantum spectral method with polylogarithmic complexity for solving non-periodic boundary value problems with arbitrary Dirichlet boundary conditions. Our method extends the recently proposed approach by Liu et al. (2025), in which periodic problems are discretised using truncated Fourier series. In such spectral methods, the discretisation of boundary value problems with constant coefficients leads to a set of algebraic equations in the Fourier space. We implement the respective diagonal solution operator by first approximating it with a polynomial and then quantum encoding the polynomial. The mapping between the physical and Fourier spaces is accomplished using the quantum Fourier transform (QFT). To impose zero Dirichlet boundary conditions, we double the domain size and reflect all physical fields antisymmetrically. The respective reflection matrix defines the quantum sine transform (QST) by pre- and post-multiplying with the QFT. For non-zero Dirichlet boundary conditions, the solution is decomposed into a boundary-conforming and a homogeneous part. The homogenous part is determined by solving a problem with a suitably modified forcing vector. We illustrate the basic approach with a Dirichlet-Poisson problem and demonstrate its generality by applying it to a fractional stochastic PDE for modelling spatial random fields. We discuss the circuit implementation of the proposed approach and provide numerical evidence confirming its polylogarithmic complexity.
Quantum computing offers the potential to solve computational mechanics problems with a more favourable complexity scaling than classically possible. To realise this potential, a quantum-compatible formulation of the finite element method is essential. We present such a formulation for Poisson problems with spatially varying coefficients on general domains discretised by an immersed uniform Cartesian grid. The resulting banded sparse system matrices are encoded as the sum of diagonal matrices with polynomial entries and their products with shift matrices. The sum of the matrices is formed using the linear combination of unitaries (LCU) technique. The resulting block-encoded system matrix can be implemented using a polylogarithmic number of elementary gates. For immersed boundaries, the block-encoded system matrix is further processed using a diagonal indicator matrix with zeros and ones. The indicator matrix is defined in terms of an integer-valued level-set function composed of simple geometric primitives via Boolean set operations. The required integer operations are computed on the fly using quantum arithmetic. The resulting block-encoded linear system of equations is solved using quantum singular value transformation (QSVT). The overall gate count, including the QSVT, is O(Ntot2/dpolylog⁡(Ntot))O(N_{\text{tot}}^{2/d} \operatorname{polylog}(N_{\text{tot}}))O(Ntot2/d​polylog(Ntot​)), where ddd is the problem dimension and NtotN_{\text{tot}}Ntot​ the number of grid points. In numerical examples that confirm the theoretical complexity estimates, the solutions converge approximately linearly for immersed problems and quadratically for simply connected domains.