Reuse & Permissions

It is not necessary to obtain permission to reuse this article or its components as it is available under the terms of the Creative Commons Attribution 4.0 International license. This license permits unrestricted use, distribution, and reproduction in any medium, provided attribution to the author(s) and the published article's title, journal citation, and DOI are maintained. Please note that some figures may have been included with permission from other third parties. It is your responsibility to obtain the proper permission from the rights holder directly for these figures.

Export citation

Export citation

Choose format for download:

Download Citation
  • Open Access

Applicability of solving the one- and two-dimensional Poisson equations with the quantum Harrow-Hassidim-Lloyd algorithm

Luca Ghafourpour1,2,* and Sylvain Laizet2

  • *Contact author: lghafourpour@ethz.ch

Phys. Rev. Applied 24, 024032 – Published 13 August, 2025

DOI: https://doi.org/10.1103/ymjf-6n8j

Abstract

This paper assesses the numerical accuracy of the Harrow-Hassidim-Lloyd (HHL) algorithm in solving a finite-difference approximation of the Poisson equation, with the Thomas algorithm used as a comparative benchmark. In the one-dimensional setting with homogeneous boundary conditions, the HHL algorithm exhibits numerical accuracy comparable to the Thomas algorithm; however, the HHL algorithm exhibits increased sensitivity to variations in input parameters for simulations with nonhomogeneous boundary conditions. While the current implementation of the HHL algorithm is limited to solving the one-dimensional Poisson equation, we propose a hybrid framework to extend the applicability of the HHL algorithm to solving the two-dimensional Poisson equation. Our results show that although both algorithms perform similarly for small systems of 8×8 mesh nodes, the HHL algorithm shows increased input-parameter sensitivity for systems of 16×16 mesh nodes, indicating that further development is needed to scale the hybrid approach effectively.

View figure in article

Physics Subject Headings (PhySH)

Article Text

References (31)

  1. J. L. Guermond, P. Minev, and J. Shen, An overview of projection methods for incompressible flows, Comput. Methods Appl. Mech. Eng. 195, 6011 (2006).
  2. J. L. Hennessy and D. A. Patterson, A new golden age for computer architecture, Commun. ACM 62, 48 (2019).
  3. N. Jansson, M. Karp, A. Podobas, S. Markidis, and P. Schlatter, Neko: A modern portable, and scalable framework for high-fidelity computational fluid dynamics, Comput. Fluids 275, 106243 (2024).
  4. F. D. Witherden, A. M. Farrington, and P. E. Vincent, PyFR: An open source framework for solving advection–diffusion type problems on streaming architectures using the flux reconstruction approach, Comput. Phys. Commun. 185, 3028 (2014).
  5. F. Rathgeber, D. A. Ham, L. Mitchell, M. Lange, F. Luporini, A. T. McRae, G. T. Bercea, G. R. Markall, and P. H. Kelly, Firedrake: Automating the finite element method by composing abstractions, ACM Trans. Math. Software (TOMS) 43, 1 (2016).
  6. A. Montanaro, Quantum algorithms: An overview, npj Quantum Inf. 2, 1 (2016).
  7. A. W. Harrow, A. Hassidim, and S. Lloyd, Quantum algorithm for linear systems of equations, Phys. Rev. Lett. 103, 150502 (2009).
  8. A. M. Childs, R. Kothari, and R. D. Somma, Quantum algorithm for systems of linear equations with exponentially improved dependence on precision, SIAM J. Comput. 46, 1920 (2017).
  9. Y. Subaşı, R. D. Somma, and D. Orsucci, Quantum algorithms for systems of linear equations inspired by adiabatic quantum computing, Phys. Rev. Lett. 122, 060504 (2019).
  10. C. C. McGeoch, Adiabatic Quantum Computation and Quantum Annealing: Theory and Practice (Morgan & Claypool Publishers, San Rafael, California, United States, 2014).
  11. K. Sharma, S. Khatri, M. Cerezo, and P. J. Coles, Noise resilience of variational quantum compiling, New J. Phys. 22, 043006 (2020).
  12. P. García-Molina, J. Rodríguez-Mediavilla, and J. J. García-Ripoll, Quantum Fourier analysis for multivariate functions and applications to a class of Schrödinger-type partial differential equations, Phys. Rev. A 105, 012433 (2022).
  13. M. Lubasch, J. Joo, P. Moinier, M. Kiffner, and D. Jaksch, Variational quantum algorithms for nonlinear problems, Phys. Rev. A 101, 010301 (2020).
  14. C. Bravo-Prieto, R. LaRose, M. Cerezo, Y. Subasi, L. Cincio, and P. J. Coles, Variational quantum linear solver, Quantum 7, 1188 (2023).
  15. Y. Cao, A. Papageorgiou, I. Petras, J. Traub, and S. Kais, Quantum algorithm and circuit design solving the Poisson equation, New J. Phys. 15, 013021 (2013).
  16. S. Wang, Z. Wang, W. Li, L. Fan, Z. Wei, and Y. Gu, Quantum fast Poisson solver: The algorithm and complete and modular circuit design, Quantum Inf. Process. 19, 1 (2020).
  17. A. M. Childs, J.-P. Liu, and A. Ostrander, High-precision quantum algorithms for partial differential equations, Quantum 5, 574 (2021).
  18. J. M. Arrazola, T. Kalajdzievski, C. Weedbrook, and S. Lloyd, Quantum algorithm for nonhomogeneous linear partial differential equations, Phys. Rev. A 100, 032306 (2019).
  19. Y. Sato, R. Kondo, S. Koide, H. Takamatsu, and N. Imoto, Variational quantum algorithm based on the minimum potential energy for solving the Poisson equation, Phys. Rev. A 104, 052409 (2021).
  20. K. K. Saha, W. Robson, C. Howington, I.-S. Suh, Z. Wang, and J. Nabrzyski, Enhancing scalability and accuracy of quantum poisson solver, Quantum Inf. Process. 23, 209 (2024).
  21. M. Ali and M. Kabel, Performance study of variational quantum algorithms for solving the Poisson equation on a quantum computer, Phys. Rev. Appl. 20, 014054 (2023).
  22. B. Daribayev, A. Mukhanbet, and T. Imankulov, Implementation of the HHL algorithm for solving the Poisson equation on quantum simulators, Appl. Sci. 13, 11491 (2023).
  23. Y. Cao, A. Daskin, S. Frankel, and S. Kais, Quantum circuit design for solving linear systems of equations, Mol. Phys. 110, 1675 (2012).
  24. A. C. Vazquez, R. Hiptmair, and S. Woerner, Enhancing the quantum linear systems algorithm using Richardson extrapolation, ACM Trans. Quantum Comput. 3, 1 (2022).
  25. B. Arseniev, D. Guskov, R. Sengupta, J. Biamonte, and I. Zacharov, Tridiagonal matrix decomposition for Hamiltonian simulation on a quantum computer, Phys. Rev. A 109, 052629 (2024).
  26. R. Jozsa, Quantum algorithms and the Fourier transform, Proc. R. Soc. London, A 454, 323 (1998).
  27. M. Mottonen, J. J. Vartiainen, V. Bergholm, and M. M. Salomaa, Transformation of quantum states using uniformly controlled rotations, Quantum Inf. Comput. 5, 467 (2005).
  28. A. Javadi-Abhari, M. Treinish, K. Krsulich, C. J. Wood, J. Lishman, J. Gacon, S. Martiel, P. D. Nation, L. S. Bishop, A. W. Cross, B. R. Johnson, and J. M. Gambetta, Quantum computing with Qiskit, https://www.ibm.com/quantum/blog/defining-and-citing-the-qiskit-sdk.
  29. A. G. Özbay, A. Hamzehloo, S. Laizet, P. Tzirakis, G. Rizos, and B. Schuller, Poisson CNN: Convolutional neural networks for the solution of the Poisson equation on a Cartesian mesh, Data-Centric Eng. 2, e6 (2021).
  30. M. A. Nielsen and I. L. Chuang, Quantum Computation and Quantum Information (Cambridge University Press, Cambridge, United Kingdom, 2010).
  31. S. Noschese, L. Pasquini, and L. Reichel, Tridiagonal Toeplitz matrices: Properties and novel applications, Numerical Linear Algebra Appl. 20, 302 (2013).

Outline

Information

Sign In to Your Journals Account

Filter

Filter

Article Lookup

Enter a citation