Solving challenging problems in quantum chemistry is one of the most promising applications of quantum computers. Within the quantum algorithms proposed for problems in excited state quantum chemistry, subspace-based quantum algorithms, including quantum subspace expansion (QSE), quantum equation of motion (qEOM) and quantum self-consistent equation-of-motion (q-sc-EOM), are promising for pre-fault-tolerant quantum devices. The working equation of QSE and qEOM requires solving a generalized eigenvalue equation with associated matrix elements measured on a quantum computer. Our careful analytical and numerical analysis of the standard and generalized eigenvalue problems, especially in the context of excited-state methods, shows that the errors in eigenvalues magnify drastically with an increase in the condition number of the overlap matrix when a generalized eigenvalue equation is solved in the presence of statistical sampling errors. This makes methods such as QSE unstable to errors that are unavoidable when using quantum computers. Further, at very high condition numbers of the overlap matrix, the QSE's working equation could not be solved without any additional steps in the presence of sampling errors, as it becomes ill-conditioned. It was possible to use the thresholding technique in this case to solve the equation, but the solutions achieved had missing excited states, which may be a problem for future chemical studies. We also show that excited-state methods that have an eigenvalue equation as the working equation, such as q-sc-EOM, do not have the problems associated with the condition number and could be generally more stable to errors, and therefore, more suitable candidates for excited-state quantum chemistry calculations using quantum computers.
Solving challenging problems in quantum chemistry is one of the most promising applications of quantum computers. Within the quantum algorithms proposed for problems in excited state quantum chemistry, subspace-based quantum algorithms, including quantum subspace expansion (QSE), quantum equation of motion (qEOM) and quantum self-consistent equation-of-motion (q-sc-EOM), are promising for pre-fault-tolerant quantum devices. The working equation of QSE and qEOM requires solving a generalized eigenvalue equation with associated matrix elements measured on a quantum computer. Our careful analytical and numerical analysis of the standard and generalized eigenvalue problems, especially in the context of excited-state methods, shows that the errors in eigenvalues magnify drastically with an increase in the condition number of the overlap matrix when a generalized eigenvalue equation is solved in the presence of statistical sampling errors. This makes methods such as QSE unstable to errors that are unavoidable when using quantum computers. Further, at very high condition numbers of the overlap matrix, the QSE's working equation could not be solved without any additional steps in the presence of sampling errors, as it becomes ill-conditioned. It was possible to use the thresholding technique in this case to solve the equation, but the solutions achieved had missing excited states, which may be a problem for future chemical studies. We also show that excited-state methods that have an eigenvalue equation as the working equation, such as q-sc-EOM, do not have the problems associated with the condition number and could be generally more stable to errors, and therefore, more suitable candidates for excited-state quantum chemistry calculations using quantum computers.
Solving challenging problems in quantum chemistry is one of the most promising applications of quantum computers. Within the quantum algorithms proposed for problems in excited-state quantum chemistry, subspace-based quantum algorithms, including quantum subspace expansion (QSE), quantum equation of motion (qEOM), and quantum self-consistent equation-of-motion (q-sc-EOM), are promising for pre-fault-tolerant quantum devices. The working equation of QSE and qEOM requires solving a generalized eigenvalue equation with associated matrix elements measured on a quantum computer. Our careful analytical and numerical analysis of the standard and generalized eigenvalue problems, especially in the context of excited-state methods, shows that the errors in eigenvalues magnify drastically with an increase in the condition number of the overlap matrix when a generalized eigenvalue equation is solved in the presence of statistical sampling errors. This makes methods such as QSE unstable for errors that are unavoidable when using quantum computers. Further, at very high condition numbers of the overlap matrix, the QSE's working equation could not be solved without any additional steps in the presence of sampling errors, as it becomes ill-conditioned. It was possible to use the thresholding technique in this case to solve the equation, but the solutions achieved had missing excited states, which may be a problem for future chemical studies. We also show that excited-state methods that have an eigenvalue equation as the working equation, such as q-sc-EOM, do not have the problems associated with the condition number and could be generally more stable to errors and therefore more suitable candidates for excited-state quantum chemistry calculations using quantum computers.
Problems in quantum chemical simulations, especially achieving accurate excited-state potential energy surfaces, are among the primary applications to achieve quantum utility. On near-term quantum hardware, variants of the variational quantum eigensolver (VQE) algorithms are the primary choice for chemistry simulation. In this study, a combination of leading ground and excited state quantum algorithms for general excited states, namely, ADAPT-VQE/LUCJ and q-sc-EOM, are utilized to calculate accurate excited state potential energy surfaces in challenging bond-breaking scenarios and compared with the classical scalable EOM-CCSD method. This work investigates avenues toward quantum utility in excited-state quantum chemistry using the q-sc-EOM approach. We assess its accuracy while mitigating major scaling bottlenecks through the Davidson algorithm and basis rotation grouping, reducing the measurement scaling from O(N12) to O(N5), and implementing the method on quantum hardware with various error mitigation strategies to reduce gate and measurement errors in excited states. The hardware implementation of the q-sc-EOM algorithm, augmented by mitigation of M3 readout error and symmetry projection, produces reasonably accurate excited-state energies with gate noise identified as the predominant source of error. This paves the way for accurate and scalable, generally applicable quantum excited-state methods with potential for quantum utility while identifying critical problems that require advancements.
Accurate computation of multiple eigenvalues of quantum Hamiltonians is essential in quantum chemistry, materials science, and molecular spectroscopy. Estimating excited-state energies is challenging for classical algorithms due to exponential scaling with system size, posing an even harder problem than ground-state calculations. We present a quantum algorithm for estimating eigenvalues and singular values of parametrized matrix families, including solving generalized eigenvalue problems that frequently arise in quantum simulations. Our method uses quantum amplitude amplification and phase estimation to identify matrix eigenvalues by locating minima in the singular value spectrum. We demonstrate our algorithm by proposing a quantum computing formulation of the pseudospectral collocation method for the Schrödinger equation. We estimate fault-tolerant quantum resource requirements for the quantum collocation method, showing favorable scaling in the size of the problem N [up to O ̃ ( N ) ] compared to classical implementations with O ̃ ( N ) , for certain well-behaved potentials. Additionally, unlike the standard collocation method, which results in a generalized eigenvalue problem requiring matrix inversion, our algorithm circumvents the associated numerical instability by scanning a parametrized matrix family and detecting eigenvalues through singular value minimization. This approach is particularly effective when multiple eigenvalues are needed or when the generalized eigenvalue problem involves a high condition number. In the fault-tolerant era, our method may thus be useful for simulating high-dimensional molecular systems with dense spectra involving highly excited states, such as those encountered in molecular photodynamics or quasicontinuum regimes in many-body and solid-state systems.
Krylov subspace methods are among the most extensively studied early fault-tolerant quantum algorithms for estimating ground-state energies of quantum systems. However, the rapid onset of ill-conditioning might make accurate energies difficult or even impossible to retrieve. In this communication, we analyse the numerical stability and statistical problems of these methods using numerical simulations both in the presence and absence of sampling noise. While in ideal numerical simulations the generalized eigenvalue problem indeed becomes unstable with increased Krylov subspace size, we find that, in realistic noisy settings, these methods do not primarily suffer from ill-conditioning. Instead, statistical fluctuations dominate and can prevent reliable solution extraction unless appropriate regularization or filtering techniques are employed. We consequently introduce two new metrics, the imaginary and unitary filters, that successfully assess the reliability of the obtained solutions without any knowledge of the true eigenspectrum.
Accurate treatment of excited states remains challenging for classical electronic-structure methods, motivating quantum algorithms that may provide more favorable resource scaling. We systematically assess the practical performance of Quantum Subspace Expansion (QSE) for low-lying electronic states across 28 organic molecules from the Thiel benchmark set. Statevector simulations reveal that QSE representability depends strongly on the target state, active space, and molecular electronic structure, with multiconfigurational character emerging as an important factor. In several cases, the one-body QSE subspace cannot adequately represent the target states, while explicit double-excitation operators improve representability at the cost of a larger operator space. Analysis of the QSE overlap matrix shows that although eigenmodes with small eigenvalues drive numerical instability, they cannot be discarded indiscriminately without compromising spectral accuracy. Under finite-shot sampling, energy errors exhibit an empirical scaling of approximately n2 orb/ √ Nshots, which, combined with the growth in measurement groups, yields a total measurement cost of approximately O(n11 orb) for constant accuracy under our direct-estimation protocol. These results expose a central tension between representability, numerical stability, and measurement cost. Encouragingly, we find that the projected matrices exhibit recurring structural patterns, while the finite-shot perturbations in the Hamiltonian and overlap matrices show nontrivial covariance, suggesting opportunities for more efficient structure-aware measurement and reconstruction strategies. Overall, our results provide an assessment of QSE across chemically-relevant organic molecules, identifying present limitations while highlighting potential routes toward more practical future implementations.
Accurate treatment of excited states remains challenging for classical electronic-structure methods, motivating quantum algorithms that may provide more favorable resource scaling. We systematically assess the practical performance of Quantum Subspace Expansion (QSE) for low-lying electronic states across 28 organic molecules from the Thiel benchmark set. Statevector simulations reveal that QSE representability depends strongly on the target state, active space, and molecular electronic structure, with multiconfigurational character emerging as an important factor. In several cases, the one-body QSE subspace cannot adequately represent the target states, while explicit double-excitation operators improve representability at the cost of a larger operator space. Analysis of the QSE overlap matrix shows that although eigenmodes with small eigenvalues drive numerical instability, they cannot be discarded indiscriminately without compromising spectral accuracy. Under finite-shot sampling, energy errors exhibit an empirical scaling of approximately n_{\mathrm{orb}}^2/\sqrt{N_{\mathrm{shots}}} , which, combined with the growth in measurement groups, yields a total measurement cost of approximately \mathcal{O}(n_{\mathrm{orb}}^{11}) for constant accuracy under our direct-estimation protocol. These results expose a central tension between representability, numerical stability, and measurement cost. Encouragingly, we find that the projected matrices exhibit recurring structural patterns, while the finite-shot perturbations in the Hamiltonian and overlap matrices show nontrivial covariance, suggesting opportunities for more efficient structure-aware measurement and reconstruction strategies. Overall, our results provide an assessment of QSE across chemically-relevant organic molecules, identifying present limitations while highlighting potential routes toward more practical future implementations.