- Physical Review Journals
All JournalsPhysics Magazine

Physical Review Research

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

Gate construction of block-encoding for Hamiltonians needed for simulating partial differential equations

Nikita Guseynov*

Xiajie Huang†

Nana Liu‡

  • *Contact author: guseynov.nm@gmail.com
  • †Contact author: xj.huang@sjtu.edu.cn
  • ‡Contact author: nana.liu@quantumlah.org
PDF

Phys. Rev. Research 7, 033100 – Published 29 July, 2025

DOI: https://doi.org/10.1103/xlpd-fb1g

Abstract

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.

View figure in article

Physics Subject Headings (PhySH)

Article Text

References (43)

  1. M. Pour-El and I. Richards, Simulating physics with computers, Int. J. Theor. Phys. 21, 553 (1982).
  2. P. W. Shor, Algorithms for quantum computation: Discrete logarithms and factoring, in Proceedings of the 35th Annual Symposium on Foundations of Computer Science (FOCS) (IEEE, Santa Fe, NM, USA, 1994), pp. 124–134.
  3. P. W. Shor, Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer, SIAM Rev. 41, 303 (1999).
  4. L. K. Grover, A fast quantum mechanical algorithm for database search, in Proceedings of the Twenty-Eighth Annual ACM Symposium on Theory of Computing (Association for Computing Machinery, New York, 1996), pp. 212–219.
  5. A. Ambainis, Quantum search algorithms, ACM SIGACT News 35, 22 (2004).
  6. A. Aspuru-Guzik, A. D. Dutoi, P. J. Love, and M. Head-Gordon, Simulated quantum computation of molecular energies, Science 309, 1704 (2005).
  7. M. Szegedy, Quantum speed-up of Markov chain based algorithms, in 45th Annual IEEE Symposium on Foundations of Computer Science (IEEE, 2004), pp. 32–41.
  8. A. W. Harrow, A. Hassidim, and S. Lloyd, Quantum algorithm for linear systems of equations, Phys. Rev. Lett. 103, 150502 (2009).
  9. R. B. Laughlin and D. Pines, The theory of everything, Proc. Natl. Acad. Sci. USA 97, 28 (2000).
  10. P. C. Costa, S. Jordan, and A. Ostrander, Quantum algorithm for simulating the wave equation, Phys. Rev. A 99, 012323 (2019).
  11. F. Gaitan, Finding flows of a Navier–Stokes fluid through quantum computing, npj Quantum Inf. 6, 61 (2020).
  12. S. Jin, N. Liu, and Y. Yu, Time complexity analysis of quantum algorithms via linear representations for nonlinear ordinary and partial differential equations, J. Comput. Phys. 487, 112149 (2023).
  13. N. Linden, A. Montanaro, and C. Shao, Quantum vs. classical algorithms for solving the heat equation, Commun. Math. Phys. 395, 601 (2022).
  14. S. Jin, N. Liu, and Y. Yu, Quantum simulation of partial differential equations: Applications and detailed analysis, Phys. Rev. A 108, 032603 (2023).
  15. Y. Sato, R. Kondo, I. Hamamura, T. Onodera, and N. Yamamoto, Hamiltonian simulation for time-evolving partial differential equation by scalable quantum circuits, Phys. Rev. Res. 6, 033246 (2024).
  16. N. Stamatopoulos, D. J. Egger, Y. Sun, C. Zoufal, R. Iten, N. Shen, and S. Woerner, Option pricing using quantum computers, Quantum 4, 291 (2020).
  17. J. Gonzalez-Conde, Á. Rodríguez-Rozas, E. Solano, and M. Sanz, Efficient Hamiltonian simulation for solving option price dynamics, Phys. Rev. Res. 5, 043220 (2023).
  18. A. Gilyén, Y. Su, G. H. Low, and N. Wiebe, Quantum singular value transformation and beyond: Exponential improvements for quantum matrix arithmetics, in Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing (Association for Computing Machinery, New York, 2019), pp. 193–204.
  19. S. Jin and N. Liu, Quantum simulation of discrete linear dynamical systems and simple iterative methods in linear algebra, Proc. R. Soc. A 480, 20230370 (2024).
  20. S. Jin and N. Liu, Analog quantum simulation of partial differential equations, Quantum Sci. Technol. 9, 035047 (2024).
  21. Y. Cao, S. Jin, and N. Liu, Quantum simulation for time-dependent hamiltonians–with applications to non-autonomous ordinary and partial differential equations, J. Phys. A: Math. Theor. 58, 155304 (2025).
  22. G. H. Low and I. L. Chuang, Optimal hamiltonian simulation by quantum signal processing, Phys. Rev. Lett. 118, 010501 (2017).
  23. D. W. Berry, A. M. Childs, R. Cleve, R. Kothari, and R. D. Somma, Exponential improvement in precision for simulating sparse Hamiltonians, in Proceedings of the Forty-Sixth Annual ACM Symposium on Theory of Computing (Association for Computing Machinery, New York, 2014), pp. 283–292.
  24. J. Hu, S. Jin, N. Liu, and L. Zhang, Quantum circuits for partial differential equations via Schrödingerisation, Quantum 8, 1563 (2024).
  25. M. A. Nielsen and I. L. Chuang, Quantum Computation and Quantum Information: 10th Anniversary Edition (Cambridge University Press, Cambridge, 2011).
  26. C. M. Dawson and M. A. Nielsen, The Solovay-Kitaev algorithm, arXiv:quant-ph/0505030.
  27. O. C. Zienkiewicz, R. L. Taylor, and J. Z. Zhu, The Finite Element Method: Its Basis and Fundamentals (Elsevier, Butterworth-Heinemann, 2005).
  28. M. N. Özişik, H. R. Orlande, M. J. Colaço, and R. M. Cotta, Finite Difference Methods in Heat Transfer (CRC Press, Boca Raton, Florida, 2017).
  29. S. Jin, N. Liu, and Y. Yu, Quantum simulation of partial differential equations via Schrodingerisation, Phys. Rev. Lett. 133, 230602 (2024).
  30. S. Jin and N. Liu, Quantum algorithms for computing observables of nonlinear partial differential equations, Bulletin des Sciences Mathématiques 194, 103457 (2024).
  31. N. Guseynov, A. Zhukov, W. Pogosov, and A. Lebedev, Depth analysis of variational quantum algorithms for the heat equation, Phys. Rev. A 107, 052422 (2023).
  32. J. L. Walsh, A closed set of normal orthogonal functions, Am. J. Math. 45, 5 (1923).
  33. A. G. Rattew and P. Rebentrost, Non-linear transformations of quantum amplitudes: Exponential improvement, generalization, and applications, arXiv:2309.09839.
  34. N. Guo, K. Mitarai, and K. Fujii, Nonlinear transformation of complex amplitudes via quantum singular value transformation, Phys. Rev. Res. 6, 043227 (2024).
  35. A. M. Dalzell, S. McArdle, M. Berta, P. Bienias, C.-F. Chen, A. Gilyén, C. T. Hann, M. J. Kastoryano, E. T. Khabiboulline, A. Kubica et al., Quantum algorithms: A survey of applications and end-to-end complexities, arXiv:2310.03011.
  36. M. Plesch and Č. Brukner, Quantum-state preparation with universal gate decompositions, Phys. Rev. A 83, 032302 (2011).
  37. V. Bergholm, J. J. Vartiainen, M. Möttönen, and M. M. Salomaa, Quantum circuits with uniformly controlled one-qubit gates, Phys. Rev. A 71, 052330 (2005).
  38. V. V. Shende, I. L. Markov, and S. S. Bullock, Minimal universal two-qubit controlled-not-based circuits, Phys. Rev. A 69, 062321 (2004).
  39. J. L. Coolidge, The story of the binomial theorem, Am. Math. Mon. 56, 147 (1949).
  40. T. G. Draper, Addition on a quantum computer, arXiv:quant-ph/0008033.
  41. T. G. Draper, S. A. Kutin, E. M. Rains, and K. M. Svore, A logarithmic-depth quantum carry-lookahead adder, Quantum Info. Comput. 6, 351 (2006).
  42. D. Camps and R. Van Beeumen, Fable: Fast approximate quantum circuits for block-encodings, in 2022 IEEE International Conference on Quantum Computing and Engineering (QCE) (IEEE, 2022), pp. 104–113.
  43. M. Möttönen, J. J. Vartiainen, V. Bergholm, and M. M. Salomaa, Quantum circuits for general multiqubit gates, Phys. Rev. Lett. 93, 130502 (2004).

Outline

Information

Phys. Rev. Research 7, 033100– Published 29 July, 2025
  • Received 2 June 2024
  • Accepted 8 July 2025
Crossmark - Check for updates button
Creative Commons Logo

Published by the American Physical Society under the terms of the Creative Commons Attribution 4.0 International license. Further distribution of this work must maintain attribution to the author(s) and the published article's title, journal citation, and DOI.

Published by the American Physical Society

Sign In to Your Journals Account

Filter

Filter

Article Lookup

Enter a citation