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

Probabilistic quantum algorithm for Lyapunov equations and matrix inversion

Marcello Benedetti*, Ansis Rosmanis†, and Matthias Rosenkranz‡

  • Quantinuum, Partnership House, Carlisle Place, London SW1P 1BX, United Kingdom

  • *Contact author: marcello.benedetti@quantinuum.com
  • †Contact author: ansis.rosmanis@quantinuum.com
  • ‡Contact author: matthias.rosenkranz@quantinuum.com

Phys. Rev. Applied 25, 044040 – Published 16 April, 2026

DOI: https://doi.org/10.1103/mprk-9vx3

Abstract

We present a probabilistic quantum algorithm for preparing mixed states which, in expectation, are proportional to the solutions of Lyapunov equations—linear matrix equations ubiquitous in the analysis of classical and quantum dynamical systems. Building on previous results by Zhang et al., arXiv:2304.04526, at each step the algorithm can (i) return the current state, (ii) apply a trace nonincreasing completely positive map, or (iii) restart. We introduce a deterministic stopping rule, which leads to an efficient algorithm with a bounded expected number of calls to oracles representing the two input matrices of the Lyapunov equations. We also consider preparing a mixed state that approximates the normalized inverse of a positive definite matrix A. In its most general form, the algorithm generates mixed states, which approximate matrix-valued weighted sums and integrals. It can be shown that block encodings and states yield two incomparable computational resources even when they represent the same piece of data. While block encodings of functions have received much attention in the literature, our work takes a step toward the less explored problem of encoding functions into mixed states.

View figure in article

Physics Subject Headings (PhySH)

Article Text

References (27)

  1. A. C. Antoulas, Approximation of Large-Scale Dynamical Systems (SIAM, Philadelphia, PA, 2005).
  2. Z. Gajic and M. T. J. Qureshi, Lyapunov Matrix Equation in System Stability and Control (Dover Publications, Mineola, NY, 2008).
  3. S. Bravyi and R. König, Classical simulation of dissipative fermionic linear optics, Quantum Inf. Comput. 12, 925 (2012).
  4. A. Purkayastha, Lyapunov equation in open quantum systems and non-Hermitian physics, Phys. Rev. A 105, 062204 (2022).
  5. P. Del Moral and A. Niclas, A Taylor expansion of the square root matrix functional, J. Math. Anal. Appl. 465, 259 (2018).
  6. M. G. A. Paris, Quantum estimation for quantum technology, Int. J. Quantum Inf. 7, 125 (2009).
  7. G. Wójtowicz, S. F. Huelga, M. M. Rams, and M. B. Plenio, Quantum Fisher information from tensor-network integration of the Lyapunov equation, Phys. Rev. A 112, 052454 (2025).
  8. R. H. Bartels and G. W. Stewart, Algorithm 432 [C2]: Solution of the matrix equation AX+XB=C [F4], Commun. ACM 15, 820 (1972).
  9. S. P. Boyd, L. El Ghaoui, E. Feron, and V. Balakrishnan, Linear Matrix Inequalities in System and Control Theory, SIAM Studies in Applied Mathematics Vol. 15 (SIAM, Society for Industrial and Applied Mathematics, Philadelphia, PA, 1994).
  10. V. Simoncini, Computational methods for linear matrix equations, SIAM Rev. 58, 377 (2016).
  11. H. Sun and J. Zhang, Solving Lyapunov equation by quantum algorithm, Control Theory Technol. 15, 267 (2017).
  12. Pedro C. S. Costa, D. An, Y. R. Sanders, Y. Su, R. Babbush, and D. W. Berry, Optimal scaling quantum linear-systems solver via discrete adiabatic theorem, PRX Quantum 3, 040303 (2022).
  13. A. M. Dalzell, A shortcut to an optimal quantum linear system solver, ArXiv:2406.12086.
  14. M. E. S. Morales, L. Pira, P. Schleich, K. Koor, P. C. S. Costa, D. An, A. Aspuru-Guzik, L. Lin, P. Rebentrost, and D. W. Berry, Quantum linear system solvers: A survey of algorithms and applications, ArXiv:2411.02522.
  15. C. Clayton, J. Leng, G. Yang, Y.-L. Qiao, M. C. Lin, and X. Wu, Differentiable quantum computing for large-scale linear control, ArXiv:2411.01391.
  16. N. Liu, Q. Wang, M. M. Wilde, and Z. Zhang, Quantum algorithms for matrix geometric means, npj Quantum Inf. 11, 101 (2025).
  17. R. D. Somma, G. H. Low, D. W. Berry, and R. Babbush, Quantum algorithm for linear matrix equations, ArXiv:2508.02822.
  18. D. Zhang, J. L. Bosse, and T. Cubitt, Dissipative quantum Gibbs sampling, ArXiv:2304.04526.
  19. P. C. S. Costa, D. An, R. Babbush, and D. Berry, The discrete adiabatic quantum linear system solver has lower constant factors than the randomized adiabatic solver, Quantum 9, 1887 (2025).
  20. D. Orsucci and V. Dunjko, On solving classes of positive-definite quantum linear systems with quadratically improved runtime in the condition number, Quantum 5, 573 (2021).
  21. H. Mori, Y. Kikuchi, M. Benedetti, and M. Rosenkranz, Sparsity-dependent complexity lower bound of quantum linear system solvers, ArXiv:2601.16697.
  22. A. W. Harrow, A. Hassidim, and S. Lloyd, Quantum algorithm for linear systems of equations, Phys. Rev. Lett. 103, 150502 (2009).
  23. G. H. Low and I. L. Chuang, Hamiltonian simulation by qubitization, Quantum 3, 163 (2019).
  24. A. Gilyén, Y. Su, G. H. Low, and N. Wiebe, Quantum singular value transformation and beyond: Exponential improvements for quantum matrix arithmetics, ArXiv:1806.01838.
  25. Here we use that 1/ln(1/‖A′‖)=1/ln(1/1−1/κ)<2κ for κ>1.
  26. A. Sinap and W. Van Assche, Polynomial interpolation and Gaussian quadrature for matrix-valued functions, Linear Algebra Appl. 207, 71 (1994).
  27. R. A. Horn and C. R. Johnson, Matrix Analysis (Cambridge University Press, New York City, NY, 2017), 2nd ed.

Outline

Information

Sign In to Your Journals Account

Filter

Filter

Article Lookup

Enter a citation