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:2507.04783 · Physical Review A

Variational quantum algorithm for generalized eigenvalue problems of non-Hermitian systems

Jiaxin Li, Zhaobing Fan, Hongmei Yao, Chunlin Yang, Shao-Ming Fei, Zi-Tong Zhou, Meng-Han Dou, Teng-Yang Ma

Published Dec 8, 2025• 0 citations
arXivHTMLPDF

Abstract

Non-Hermitian generalized eigenvalue problems (GEPs) play a significant role in many practical applications, such as mechanical engineering. Based on the generalized Schur decomposition, we propose a variational quantum algorithm for solving the GEPs in non-Hermitian systems. The algorithm transforms the generalized eigenvalue problem into a process of searching for unitary transformation matrices. We demonstrate a method for evaluating both the loss function and its gradients on near-term quantum devices. We validate numerically the algorithm's performance through simulations, and demonstrate its application to GEPs in ocean acoustics. The algorithm's robustness is further confirmed through noise simulations.

DOI
10.1103/n7fj-lvx5

Related papers

A universal variational quantum eigensolver for non-Hermitian systems

Huanfeng Zhao, Peng Zhang, Tzu-Chieh Wei

Many quantum algorithms are developed to evaluate eigenvalues for Hermitian matrices. However, few practical approach exists for the eigenanalysis of non-Hermintian ones, such as arising from modern power systems. The main difficulty lies in the fact that, as the eigenvector matrix of a general matrix can be non-unitary, solving a general eigenvalue problem is inherently incompatible with existing unitary-gate-based quantum methods. To fill this gap, this paper introduces a Variational Quantum Universal Eigensolver (VQUE), which is deployable on noisy intermediate scale quantum computers. Our new contributions include: (1) The first universal variational quantum algorithm capable of evaluating the eigenvalues of non-Hermitian matrices-Inspired by Schur's triangularization theory, VQUE unitarizes the eigenvalue problem to a procedure of searching unitary transformation matrices via quantum devices; (2) A Quantum Process Snapshot technique is devised to make VQUE maintain the potential quantum advantage inherited from the original variational quantum eigensolver-With additional [Formula: see text] quantum gates, this method efficiently identifies whether a unitary operator is triangular with respect to a given basis; (3) Successful deployment and validation of VQUE on a real noisy quantum computer, which demonstrates the algorithm's feasibility. We also undertake a comprehensive parametric study to validate VQUE's scalability, generality, and performance in realistic applications.

Scientific Reports•Dec 15, 2023•7 citations

Variational quantum algorithm for generalized eigenvalue problems and its application to the finite-element method

Yuki Sato, Hiroshi C Watanabe, Rudy Raymond +5 more

Generalized eigenvalue problems (GEPs) play an important role in the variety of fields including engineering, machine learning, and quantum chemistry. Especially, many problems in these fields can be reduced to finding the minimum or maximum eigenvalue of GEPs. One of the key problems to handle GEPs is that the memory usage and computational complexity explode as the size of the system of interest grows. This paper aims at extending sequential quantum optimizers for GEPs. Sequential quantum optimizers are a family of algorithms that iteratively solve the analytical optimization of single-qubit gates in a coordinate descent manner. The contribution of this paper is as follows. First, we formulate the GEP as the minimization or maximization problem of the fractional form of the expectations of two Hermitians. We then show that the fractional objective function can be analytically minimized or maximized with respect to a single-qubit gate by solving a GEP of a $4\ifmmode\times\else\texttimes\fi{}4$ matrix. Second, we show that a system of linear equations characterized by a positive-definite Hermitian can be formulated as a GEP and thus be attacked using the proposed method. Finally, we demonstrate two applications to important engineering problems formulated with the finite-element method. Through the demonstration, we have the following bonus finding; a problem having a real-valued solution can be solved more effectively using quantum gates generating a complex-valued state vector, which demonstrates the effectiveness of the proposed method.

arXiv:2302.12602•Physical Review A•Aug 28, 2023•17 citations

Variational quantum algorithms for scanning the complex spectrum of non-Hermitian systems

Xu-Dan Xie, Zheng‐Yuan Xue, Dan-Bo Zhang

Solving non-Hermitian quantum many-body systems on a quantum computer by minimizing the variational energy is challenging as the energy can be complex. Here, we propose a variational quantum algorithm for solving the non-Hermitian Hamiltonian by minimizing a type of energy variance, where zero variance can naturally determine the eigenvalues and the associated left and right eigenstates. Moreover, the energy is set as a parameter in the cost function and can be tuned to scan the whole spectrum efficiently by using a two-step optimization scheme. Through numerical simulations, we demonstrate the algorithm for preparing the left and right eigenstates, verifying the biorthogonal relations, as well as evaluating the observables. We also investigate the impact of quantum noise on our algorithm and show that its performance can be largely improved using error mitigation techniques. Therefore, our work suggests an avenue for solving non-Hermitian quantum many-body systems with variational quantum algorithms on near-term noisy quantum computers.

arXiv:2305.19807•Frontiers of Physics•Feb 6, 2024•22 citations

Real Variance-Based Variational Quantum Eigensolver for Non-Hermitian Matrices

Durgesh Pandey, Ankit Kumar Das, P. Arumugam

Non-Hermitian operators naturally arise in the description of open quantum systems, which exhibit features such as resonances and decay processes, where the associated eigenvalues are complex. Standard quantum algorithms, including the Variational Quantum Eigensolver (VQE), are designed for Hermitian operators and are ineffective in recovering correct eigenvalues for non-Hermitian matrices. We present a systematic formulation based on a Real Variance-based Variational Quantum Eigensolver (RVVQE) for non-Hermitian operators. A correct cost function that guarantees convergence to the true eigenstates is identified. Our implementation utilizes Hermitian measurements only, rendering the algorithm easily deliverable. The performance and scalability of the proposed algorithm on a hierarchy of dense non-Hermitian matrices of increasing dimension are demonstrated with numerical results and computational metrics.

quant-pharXiv:2603.28892•IEEE Transactions on Quantum Engineering•Apr 1, 2026•2 citations

Quantum algorithms for the polynomial eigenvalue problems.

Changpeng Shao, Jin-Peng Liu

Polynomial eigenvalue problems (PEPs) arise in a variety of science and engineering applications, and many breakthroughs in the development of classical algorithms to solve PEPs have been made in the past decades. Here we attempt to solve PEPs in a quantum computer. Firstly, for generalized eigenvalue problems (GEPs) $A\x = \lambda B\x$ with $A,B$ symmetric, and $B$ positive definite, we give a quantum algorithm based on block-encoding and quantum phase estimation. In a more general case when $B$ is invertible, $B^{-1}A$ is diagonalizable and all the eigenvalues are real, we propose a quantum algorithm based on the Fourier spectral method to solve ordinary differential equations (ODEs). The inputs of our algorithms can be any desired states, and the outputs are superpositions of the eigenpairs. The complexities are polylog in the matrix size and linear in the precision. The dependence on precision is optimal. Secondly, we show that when $B$ is singular, any quantum algorithm uses at least $\Omega(\sqrt{n})$ queries to compute the eigenvalues, where $n$ is the matrix size. Thirdly, based on the linearization method and the connection between PEPs and higher-order ODEs, we provide two quantum algorithms to solve PEPs by extending the quantum algorithm for GEPs. We also give detailed complexity analysis of the algorithm for two special types of quadratic eigenvalue problems that are important in practice. Finally, under an extra assumption, we propose a quantum algorithm to solve PEPs when the eigenvalues are complex.

•Oct 28, 2020•0 citations

Variational Quantum Singular Value Decomposition

Xin Wang, Zhixin Song, Youle Wang

Singular value decomposition is central to many problems in engineering and scientific fields. Several quantum algorithms have been proposed to determine the singular values and their associated singular vectors of a given matrix. Although these algorithms are promising, the required quantum subroutines and resources are too costly on near-term quantum devices. In this work, we propose a variational quantum algorithm for singular value decomposition (VQSVD). By exploiting the variational principles for singular values and the Ky Fan Theorem, we design a novel loss function such that two quantum neural networks (or parameterized quantum circuits) could be trained to learn the singular vectors and output the corresponding singular values. Furthermore, we conduct numerical simulations of VQSVD for random matrices as well as its applications in image compression of handwritten digits. Finally, we discuss the applications of our algorithm in recommendation systems and polar decomposition. Our work explores new avenues for quantum information processing beyond the conventional protocols that only works for Hermitian data, and reveals the capability of matrix decomposition on near-term quantum devices.

arXiv:2006.02336•Quantum•Jun 29, 2021•84 citations
Non-Hermitian generalized eigenvalue problems (GEPs) play a significant role in many practical applications, such as mechanical engineering. Based on the generalized Schur decomposition, we propose a variational quantum algorithm for solving the GEPs in non-Hermitian systems. The algorithm transforms the generalized eigenvalue problem into a process of searching for unitary transformation matrices. We demonstrate a method for evaluating both the loss function and its gradients on near-term quantum devices. We validate numerically the algorithm's performance through simulations, and demonstrate its application to GEPs in ocean acoustics. The algorithm's robustness is further confirmed through noise simulations.
Many quantum algorithms are developed to evaluate eigenvalues for Hermitian matrices. However, few practical approach exists for the eigenanalysis of non-Hermintian ones, such as arising from modern power systems. The main difficulty lies in the fact that, as the eigenvector matrix of a general matrix can be non-unitary, solving a general eigenvalue problem is inherently incompatible with existing unitary-gate-based quantum methods. To fill this gap, this paper introduces a Variational Quantum Universal Eigensolver (VQUE), which is deployable on noisy intermediate scale quantum computers. Our new contributions include: (1) The first universal variational quantum algorithm capable of evaluating the eigenvalues of non-Hermitian matrices-Inspired by Schur's triangularization theory, VQUE unitarizes the eigenvalue problem to a procedure of searching unitary transformation matrices via quantum devices; (2) A Quantum Process Snapshot technique is devised to make VQUE maintain the potential quantum advantage inherited from the original variational quantum eigensolver-With additional [Formula: see text] quantum gates, this method efficiently identifies whether a unitary operator is triangular with respect to a given basis; (3) Successful deployment and validation of VQUE on a real noisy quantum computer, which demonstrates the algorithm's feasibility. We also undertake a comprehensive parametric study to validate VQUE's scalability, generality, and performance in realistic applications.
Generalized eigenvalue problems (GEPs) play an important role in the variety of fields including engineering, machine learning, and quantum chemistry. Especially, many problems in these fields can be reduced to finding the minimum or maximum eigenvalue of GEPs. One of the key problems to handle GEPs is that the memory usage and computational complexity explode as the size of the system of interest grows. This paper aims at extending sequential quantum optimizers for GEPs. Sequential quantum optimizers are a family of algorithms that iteratively solve the analytical optimization of single-qubit gates in a coordinate descent manner. The contribution of this paper is as follows. First, we formulate the GEP as the minimization or maximization problem of the fractional form of the expectations of two Hermitians. We then show that the fractional objective function can be analytically minimized or maximized with respect to a single-qubit gate by solving a GEP of a $4\ifmmode\times\else\texttimes\fi{}4$ matrix. Second, we show that a system of linear equations characterized by a positive-definite Hermitian can be formulated as a GEP and thus be attacked using the proposed method. Finally, we demonstrate two applications to important engineering problems formulated with the finite-element method. Through the demonstration, we have the following bonus finding; a problem having a real-valued solution can be solved more effectively using quantum gates generating a complex-valued state vector, which demonstrates the effectiveness of the proposed method.
Solving non-Hermitian quantum many-body systems on a quantum computer by minimizing the variational energy is challenging as the energy can be complex. Here, we propose a variational quantum algorithm for solving the non-Hermitian Hamiltonian by minimizing a type of energy variance, where zero variance can naturally determine the eigenvalues and the associated left and right eigenstates. Moreover, the energy is set as a parameter in the cost function and can be tuned to scan the whole spectrum efficiently by using a two-step optimization scheme. Through numerical simulations, we demonstrate the algorithm for preparing the left and right eigenstates, verifying the biorthogonal relations, as well as evaluating the observables. We also investigate the impact of quantum noise on our algorithm and show that its performance can be largely improved using error mitigation techniques. Therefore, our work suggests an avenue for solving non-Hermitian quantum many-body systems with variational quantum algorithms on near-term noisy quantum computers.
Non-Hermitian operators naturally arise in the description of open quantum systems, which exhibit features such as resonances and decay processes, where the associated eigenvalues are complex. Standard quantum algorithms, including the Variational Quantum Eigensolver (VQE), are designed for Hermitian operators and are ineffective in recovering correct eigenvalues for non-Hermitian matrices. We present a systematic formulation based on a Real Variance-based Variational Quantum Eigensolver (RVVQE) for non-Hermitian operators. A correct cost function that guarantees convergence to the true eigenstates is identified. Our implementation utilizes Hermitian measurements only, rendering the algorithm easily deliverable. The performance and scalability of the proposed algorithm on a hierarchy of dense non-Hermitian matrices of increasing dimension are demonstrated with numerical results and computational metrics.
Polynomial eigenvalue problems (PEPs) arise in a variety of science and engineering applications, and many breakthroughs in the development of classical algorithms to solve PEPs have been made in the past decades. Here we attempt to solve PEPs in a quantum computer. Firstly, for generalized eigenvalue problems (GEPs) $A\x = \lambda B\x$ with A,BA,BA,B symmetric, and BBB positive definite, we give a quantum algorithm based on block-encoding and quantum phase estimation. In a more general case when BBB is invertible, B−1AB^{-1}AB−1A is diagonalizable and all the eigenvalues are real, we propose a quantum algorithm based on the Fourier spectral method to solve ordinary differential equations (ODEs). The inputs of our algorithms can be any desired states, and the outputs are superpositions of the eigenpairs. The complexities are polylog in the matrix size and linear in the precision. The dependence on precision is optimal. Secondly, we show that when BBB is singular, any quantum algorithm uses at least Ω(n)\Omega(\sqrt{n})Ω(n​) queries to compute the eigenvalues, where nnn is the matrix size. Thirdly, based on the linearization method and the connection between PEPs and higher-order ODEs, we provide two quantum algorithms to solve PEPs by extending the quantum algorithm for GEPs. We also give detailed complexity analysis of the algorithm for two special types of quadratic eigenvalue problems that are important in practice. Finally, under an extra assumption, we propose a quantum algorithm to solve PEPs when the eigenvalues are complex.
Singular value decomposition is central to many problems in engineering and scientific fields. Several quantum algorithms have been proposed to determine the singular values and their associated singular vectors of a given matrix. Although these algorithms are promising, the required quantum subroutines and resources are too costly on near-term quantum devices. In this work, we propose a variational quantum algorithm for singular value decomposition (VQSVD). By exploiting the variational principles for singular values and the Ky Fan Theorem, we design a novel loss function such that two quantum neural networks (or parameterized quantum circuits) could be trained to learn the singular vectors and output the corresponding singular values. Furthermore, we conduct numerical simulations of VQSVD for random matrices as well as its applications in image compression of handwritten digits. Finally, we discuss the applications of our algorithm in recommendation systems and polar decomposition. Our work explores new avenues for quantum information processing beyond the conventional protocols that only works for Hermitian data, and reveals the capability of matrix decomposition on near-term quantum devices.