WorksPhysics and Astronomy
Solution of the Equation-of-Motion Phonon Method eigenvalue problems on the D-Wave quantum annealer
Abstract
The solution of large-scale eigenvalue problems is crucial in nuclear many-body theory, where Hamiltonian matrices often reach extremely large dimensions. Quantum computing opens new perspectives for addressing such demanding problems. Although the Quantum Phase Estimation algorithm offers, in principle, a systematic route to matrix diagonalization, its practical deployment demands levels of coherence and error correction that current quantum hardware cannot yet support. A viable near-term strategy is instead to exploit quantum annealing, which enables the recasting of eigenvalue problems into quadratic unconstrained binary optimization formulations that can be addressed by existing annealing-based processors. Here, we propose a hybrid quantum-classical algorithm that combines quantum annealing and classical deflation to iteratively extract the full eigenspectrum of both standard and generalized eigenvalue problems. We benchmark this method on eigenvalue problems arising from the Equation of Motion Phonon Method performing calculations on real quantum hardware. Our approach illustrates the capabilities and limitations of near-term quantum devices in addressing nuclear eigenvalue problems.
INTRODUCTION
The nuclear many-body problem cannot be solved exactly for systems with more than a few nucleons [1–5], due to the extremely rapid growth of the Hilbert space dimension. As a consequence, a wide variety of many-body methods has been developed, each introducing controlled approximations to make the problem computationally tractable. The size of the Hamiltonian matrices resulting from these approaches depends both on the chosen truncation scheme and on the number of active nucleons; nevertheless, even with sophisticated approximations, the resulting matrices can reach extremely large dimensions [6]. Among others we mention the ab initio methods, such as Coupled-Cluster (CC) theory [7, 8] and the In-Medium Similarity Renormalization Group (IM-SRG) [9–11], the random-phase approximation and its extensions [12–15], the Relativistic Time-Blocking Approximation (RTBA) [16–18], and, finally, the method adopted in this work, the Equation of Motion Phonon Method (EMPM) [19].
This approach has been successfully applied to study low- and high-energy spectroscopic properties of even-even [20, 21] and odd-even nuclei [22, 23], as well as extended to the quasiparticle basis for open-shell systems [24]. The EMPM mitigates the challenges of large-scale many-body nuclear problems by constructing an orthonormal basis of multiphonon states built upon one-phonon excitations computed in the Tamm-Dancoff Approximation (TDA). By solving a set of equations of motion, EMPM captures collective correlations up to arbitrary phonon number while compressing the Hamiltonian into smaller blocks. Nevertheless, these matrices can still reach very large dimensions, and repeated diagonalizations remain computationally costly in large-scale calculations.
Classical iterative eigensolvers-such as the Lanczos [25, 26] and Davidson algorithm [27]-exploit sparsity and subspace projection to compute extremal eigenpairs without constructing the full spectrum [28]. These methods build progressively larger Krylov or Davidson subspaces and converge rapidly when spectral gaps are large. However, the storage of growing subspaces becomes a bottleneck, even with modern high-performance implementations [26, 28].
Quantum computing offers an alternative route to solve eigenvalue problems. In principle, the Quantum Phase Estimation (QPE) algorithm [29] can extract eigenvalues of Hermitian operators with arbitrary precision, provided fault-tolerant qubits and deep circuits are available. Despite its theoretical potential, QPE remains out of reach for current Noisy Intermediate-Scale Quantum (NISQ) devices due to coherence and error correction limitations [30].
To bridge the gap between quantum algorithms and today’s noisy hardware, many hybrid approaches have been developed. Most of these methods were initially designed to approximate the ground-state energy of a quantum system, with the Variational Quantum Eigensolver (VQE) and its numerous extensions playing a central role [31, 32]. Other hybrid formulations, such as the quantum version of the Lanczos algorithm [33], were likewise introduced with the primary goal of improving ground-state calculations. Building on the success of ground-state VQE, extensions aimed at computing excited states were subsequently proposed [34, 35, 36]. Despite their practical relevance, these approaches inherit several limitations of the variational framework: the optimization landscape is highly nonlinear, the energy estimators are affected by stochastic noise, and the complexity grows significantly when multiple excited states are included. Further hybrid strategies based on the Davidson algorithm have also been explored for excited-state targeting [37].
An alternative and increasingly influential direction for excited-state calculations on quantum computers is based on quantum subspace methods. This class of approaches includes quantum subspace expansion [38, 39, 40], non-orthogonal VQE [41], equation-of-motion techniques [42, 43, 44, 45], and the Quantum Krylov Subspace (QKS) framework, inspired by classical Krylov algorithms [46, 47, 48]. These methods aim to overcome some of the limitations of standard variational algorithms by projecting the problem onto a suitably constructed low-dimensional subspace, often resulting in more stable and scalable excited-state computations.
Another hybrid approach is based on quantum annealing and Quadratic Unconstrained Binary Optimization (QUBO) problems. Recent works have demonstrated the feasibility of quantum annealing for addressing both Standard (SEVPs) and Generalized EigenValue Problems (GEVPs) [49, 50, 51, 52]. In particular, the authors in [49] introduced an iterative steepest-descent approach where each step of Rayleigh quotient minimization is encoded into a QUBO instance, solved via quantum annealing. Repeated annealing steps drive convergence toward the ground-state eigenpair of a symmetric matrix, as shown in proof-of-principle demonstrations on small-scale problems [53]. However, this scheme is intrinsically limited to computing only the lowest-energy solution.
Building on this foundation, the authors in [54] demonstrated that it is possible to compute the minimal or maximal right eigenvalue-and corresponding eigenvector-of nonsymmetric GEVPs using a QUBO formulation compatible with quantum annealers. Their specific target stems from the discretization of the homogeneous Bethe-Salpeter equation (hBSE) in ladder approximation, formulated directly in four-dimensional Minkowski space. This development shows that quantum annealers, such as the D-Wave Advantage system with more than 5,000 qubits and 15-way connectivity, can be employed not only to solve symmetric GEVPs but also to tackle nonsymmetric problems relevant to relativistic bound-state equations.
In this work, we build upon the algorithm outlined in [49] and extend it to recover the full eigenspectrum for both SEVPs and GEVPs. We present a hybrid classical-quantum framework where successive eigenpairs are extracted by alternating QUBO-based quantum optimizations with classical deflation steps. After obtaining the -th eigenpair via quantum annealing, we project out the span of previously found eigenvectors, allowing the next QUBO call to target the subsequent eigenstate in descending order of energy magnitude.
We benchmark our extended algorithm on Hamiltonian matrices arising from EMPM calculations in nuclear structure. By varying parameters such as the harmonic-oscillator basis size and binary encoding precision, we compare simulated annealing and quantum annealing in terms of convergence behaviour, eigenvalue accuracy, and scalability. This work provides a practical strategy for exploiting near-term quantum hardware in nuclear-structure calculations. By combining classical preprocessing with quantum annealing strategies in a scalable framework, our approach opens new directions for solving large nuclear eigenvalue problems, moving closer to exploiting quantum computational resources for realistic physical applications.
The EMPM: A Brief Outline
Assuming that the -phonon basis states of energies are known, we construct the set of redundant states
where
creates a TD phonon of energy out of HF vacuum through the action of the particle () and hole () creation operators.
We first extract from the redundant set a basis of linearly independent (though not orthogonal) states using the Cholesky decomposition method and use this basis to derive and solve the eigenvalue problem within the -subspace. To this end we start from the equations of motion
After expanding the commutator and carrying out the standard algebraic manipulations detailed in Ref. [21], we obtain the generalized eigenvalue equations
or more explicitly
Here
where defines the phonon-phonon interaction, and
is the overlap or metric matrix which preserves the Pauli principle. The expressions of and can be found, for instance, in Ref. [21].
At this stage, we employ the singular value decomposition (SVD) to identify and remove spurious states [20]. The intrinsic states obtained after this projection satisfy the transformed eigenvalue equation
The c.m. free -phonon eigenstates so obtained can be recast in terms of the original basis
By iterating this procedure for successive values of , we generate a complete orthonormal set of multiphonon state which, added to the HF vacuum () and the TD phonons (), form an orthonormal basis ().
This basis is then used to construct and solve the eigenvalue problem in the full multiphonon space
where for . The coupling of the -phonon to the -phonon states has the structure
for and
for . The formulas giving and , can be found elsewhere [21]. The solution of the final eigenvalue Eq. (10) yields the eigenvectors ()
QUBO-BASED ALGORITHM
Having outlined the EMPM formalism, we now describe the QUBO-based algorithm used to solve the associated eigenvalue problems. Let be a symmetric matrix, a well-known consequence of the spectral theorem is that the smallest eigenvalue and the corresponding eigenvector are global minima for the Rayleigh quotient , therefore
Equivalently, one can search for the maximum magnitude of the Rayleigh quotient. Thus, for given a real symmetric matrix , one has to compute
The maximum magnitude of a function can be found by evaluating both its minimum and maximum values and taking the one with the largest absolute value. Moreover, the maximum of a function can be conveniently computed by minimizing its negation.
To encode this minimization problem on a quantum annealer, the continuous Rayleigh quotient optimization must be reformulated in terms of binary variables to both obtain a good initial guess for the global minimum, and to implement an iterative descent from this initial estimate.
To address a real-variable optimization problem, one can encode it in the QUBO form by first approximating each real variable with binary variables. Once the number of bits has been set, we can build the precision vector of length
the real variable can be approximated as
where is a binary vector of dimension . So, the set of all the real values we can obtain with a precision vector of dimension is
More generally, the -fold product of is the set
where is the identity matrix and the set is a discretized cube. Now, let be a symmetric matrix, an -vector and suppose we want to solve the constrained quadratic programming problem
To get an approximate solution to Eq. (20) using a QUBO, we first replace the unit cube by a discretized unit cube to get the optimization problem
Setting , , and defining the precision matrix as
the (21) is equivalent to the following QUBO problem
where refers to the diagonal matrix with entries from . Therefore, given a number of bits , this procedure approximates the real optimization problem in variables of (20) with the QUBO of (23) of size . We conclude by highlighting that we are not restricted to the cube , but if we want to optimize over the cube , we need to repeat the same construction with the precision vector .
Algorithms that solve continuous optimization problems rely on a good initial guess and an iterative descent rule. These tasks can be formulated as QUBO problems when trying to minimize the Rayleigh quotient over the unit sphere.
Initial guess phase
As in most iterative optimization procedures, a suitable initial guess is required to ensure convergence of the descent phase. Suppose that are the eigenvalues of . To get an initial approximation of , one can ask to solve
as approximation of
To avoid the collapse of the solution to when is positive definite we replace with , where for some . This spectral shift preserves the eigenvectors, while the eigenvalues can be recovered from the new matrix
A relatively good initial choice for is the average of the eigenvalues as suggested in [49]. This is a natural choice since it ensures that the initial guess lies within the bounds of the eigenspectrum. Nevertheless, this estimate can be refined. In fact, following the statistical analogy introduced in [55], one defines the mean and standard deviation of the spectrum as
As a consequence,
that for reduces to
In general we have that,
Once set the initial value for the eigenvalue, as the algorithm progresses, it decreases towards the target . These observations lead to the following algorithm, based on a iterative fixed-point method. The algorithm starts with the initial guess phase, where we first solve (26) to produce a guess eigenvector . Then, we update using the Rayleigh quotient and we solve (24) again using as a bias vector to produce a second guess vector . This procedure is repeated until is no longer decreasing.
Iterative descent phase
After obtaining an initial approximation of the lowest eigenvalue, the algorithm refines it through an iterative descent procedure.
Suppose we want to minimize a function , and let and denote the gradient and Hessian of , respectively. Starting with an initial guess , a common strategy is to Taylor expand around , namely
where , and choose a to minimize (gradient descent), or (second order methods such as Newton’s method, BFGS, and Newton-CG [56]). Once a better solution has been found, we Taylor expand around again and repeat. The proposed algorithm obtains a good descent direction by using a QUBO to find good approximate solutions to
Similar to Newton-CG and BFGS, this method requires computing, but not inverting, the Hessian matrix , and benefits from a line search which possibly increases the size of . If the -th approximate solution is closer to the true solution than any point in the discretized cube, one cannot expect minimizing the QUBO to produce a better solution. If the new candidate solution is worse than the previous one, the algorithm discards the candidate and replaces the discretized unit cube by a scaled-down discretized cube , where , which amounts to repeating the procedure outlined above with the new precision vector . Once the discretized cube has been scaled down, the algorithm continues running until it needs to scale down the cube further, or terminates once the desired accuracy is reached.
Extension to the generalized eigenvalue problem
In many cases, one needs to solve a generalized eigenvalue problem of the form , where , are symmetric and is Strictly Positive Definite (SPD). Under these conditions, the smallest generalized eigenvalue minimizes the generalized Rayleigh quotient
Therefore, the following small changes adapt the algorithm discussed so far to solve the generalized eigenvalue problem with essentially arbitrary precision. First, instead of , one can generate a random unit vector and compute as . Second, we have to replace every Rayleigh quotient with the corresponding generalized Rayleigh quotient. Lastly, instead of updating as , we update , since this preserves the -eigenspectrum of , whereas the former does not.
Matrix deflation techniques
The previously discussed algorithm computes a single eigenpair. To extend this approach to the computation of the full eigenspectrum, we employ matrix deflation techniques, which enable the sequential extraction of eigenvalues and eigenvectors.
Deflation is a classical strategy in numerical linear algebra: once an eigenpair has been computed, the system matrix is modified so that the same eigenpair does not reappear in subsequent iterations. This enables iterative procedures—such as the QUBO-based eigenvalue search described earlier—to identify additional eigenpairs one at a time.
Our use of deflation is motivated by the structure of the QUBO formulation. Unlike global eigensolvers (e.g., the QZ [57, 58] algorithm or dense QR methods [59, 60]), which compute multiple eigenpairs simultaneously, the QUBO solver isolates a single eigenpair per optimization instance. After each eigenpair is found, deflation ”peels away” its influence from the matrix, allowing the algorithm to target the next dominant mode without interference.
Although a fully quantum deflation framework could, in principle, be implemented as part of a future quantum eigensolver, such an extension lies beyond the scope of this work.
Deflation techniques can be broadly grouped into two main categories:
Subtractive deflation: The contribution of the computed eigenpair is subtracted from the matrix to eliminate its influence. Examples include Hotelling’s deflation and Orthogonal Projection deflation.
Orthogonalization-based deflation: The search space for subsequent eigenvector estimates is restricted to vectors orthogonal to the previously computed eigenvectors. Householder deflation is a representative method in this class.
In our procedure, we implement three classical and widely-used deflation techniques—Hotelling, Orthogonal Projection, and Householder deflation—covering both categories above. These methods are employed for both the standard and the generalized eigenvalue problems, enabling the sequential reconstruction of the full eigenspectrum as detailed in § 6. A summary of their main properties is provided in Table I.
Hotelling Deflation
Hotelling deflation is a technique used in eigenvalue problems to find additional eigenvalues after the dominant eigenpair (eigenvalue and eigenvector ) has been found. It modifies the original matrix to ”remove” the influence of the found eigenpair. Given a matrix and its dominant eigenpair , with normalized so that , the deflated matrix is defined as
| Feature | Hotelling | Orthogonal Projection | Householder |
| Basic Idea | Subtracts the rank-1 update formed by the found eigenpair from the matrix | Projects the matrix onto the subspace orthogonal to found eigenvectors | Uses Householder reflections to transform the matrix, removing found eigenvectors |
| Type | Subtractive | Subtractive | Orthogonalization-based |
| Mathematical Operation for SEVP | , where , are eigenvalue/vector | , where is the eigenvector | Applies orthogonal Householder transformation to deflate, where , and is the eigenvector |
| Mathematical Operation for GEVP | , where , are eigenvalue/vector | , , where is the eigenvector | Applies orthogonal Householder transformation to both and matrices as follows: , |
| Preserves Symmetry? | Yes | Yes | Yes |
| Numerical Stability | Moderate; can introduce errors due to subtraction | Higher stability due to projection | High stability from orthogonal transformations |
| Ease of Implementation | Simple | More complex; requires projection operations | More complex; requires constructing Householder reflectors |
Table 1. Comparison of Hotelling, Orthogonal Projection, and Householder deflation methods.
As result, the deflated matrix will have as an eigenvector corresponding to an eigenvalue of zero. All other eigenvalues of (and their corresponding eigenvectors) remain unchanged in . It is conceptually straightforward, but stability is its major weakness. Hotelling deflation is highly sensitive to errors in the computed and . Small inaccuracies can accumulate rapidly, leading to poor accuracy for subsequently found eigenpairs. This makes it less suitable for accurately finding many eigenvalues.
To extend this deflation technique to the GEVP, the matrix must be introduced. A common form of Hotelling-like deflation often involves modifying while keeping the same. If we have , with normalized such that , a Hotelling-like deflated matrix can be defined as
Numerical instability, as in the standard problem, remains the primary issue, because the subtraction of terms like assumes perfect knowledge of and . In practice, computed eigenpairs are only approximate. Errors in and are introduced at each deflation step, and these errors can accumulate rapidly.
Orthogonal Projection Deflation
Orthogonal Projection deflation is a technique used in SEVP to find multiple eigenpairs by ensuring that subsequent eigenvector estimates are orthogonal to previously found eigenvectors. This is done by projecting the matrix onto the subspace orthogonal to the space spanned by the known eigenvectors.
Given a matrix and its dominant eigenpair , with normalized so that , the deflated matrix is defined as
where is the identity matrix.
This projection removes the influence of the known eigenvectors, allowing iterative methods to converge to new eigenpairs orthogonal to those already found. While conceptually useful and offering some advantages over the most basic Hotelling deflation, it is generally less numerically stable than Householder deflation and is not the primary method employed by state-of-the-art numerical libraries for computing complete eigenspectra (dense matrices) or subsets (sparse matrices).
For GEVP, Orthogonal Projection deflation removes the influence of already computed eigenvectors by projecting onto the subspace orthogonal to them with respect to the -inner product. This is achieved by defining the projection operators
and applying them to the matrices and
Householder Deflation
Householder deflation is another technique used in the SEVP to find additional eigenvalues, but employing Householder transformations. These transformations are orthogonal reflections that zero out components of vectors, allowing the matrix to be iteratively reduced in a numerically stable manner while preserving symmetry and orthogonality. By applying Householder deflation, the influence of already computed eigenvectors is effectively removed, which facilitates the computation of subsequent eigenpairs. Given a matrix and an eigenvector , a Householder reflector is constructed such that
where is the first canonical basis vector and . Applying to produces a transformed matrix
The transformed matrix will have a block structure where is isolated, and the remaining submatrix contains the other eigenvalues of . Iterative deflation steps are then applied to .
Householder deflation is numerically stable due to the orthogonality of and is widely used in QR algorithms and advanced eigensolvers for SEVP.
For GEVP we apply Householder reflectors to both and matrices as follows
However, as can be seen later in § 7 B, this approach distorts the original symmetry. Applying a single Householder transformation simultaneously to both and does not directly achieve deflation of an eigenpair in a clean and isolated manner. More specifically, such a transformation does not preserve the essential structural properties of the GEVP, such as maintaining as a symmetric positive definite metric, or reducing and to triangular form. The objective of deflation is not only to eliminate the contribution of a specific eigenpair, but to do so while preserving the generalized eigenvalue structure and the mathematical relationship between and . For this reason, modern approaches such as the generalized Schur decomposition (QZ algorithm) are preferred for the systematic computation of the eigenspectrum in the generalized case.
Hybrid Algorithm for Full Spectrum Eigenpair Computation
In this section, we present a hybrid quantum-classical eigensolver algorithm designed to compute the full spectrum of eigenvalues and corresponding eigenvectors for both SEVP and GEVP. The proposed approach combines the algorithm presented in Section III with iterative eigenpair extraction via matrix deflation, using one of the deflation techniques described in § 5. The algorithm is termed hybrid as it combines a classical numerical procedure, matrix deflation, with a quantum-based formulation, namely the QUBO formulation of the Rayleigh quotient optimization problem.
Algorithm 1 Dominant eigenpair finder for the SEVP
Require: Symmetric matrix
Ensure: Eigenvalue with maximum magnitude and corresponding eigenvector
Solve QUBO to maximize the Rayleigh quotient:
Solve QUBO to minimize the Rayleigh quotient:
if then
,
else
,
end if
return
Algorithm 2 Hybrid full spectrum solver for the SEVP
Require: Symmetric matrix , and a chosen deflation method
Ensure: Eigenvalues and eigenvectors
Initialize set of computed eigenpairs:
Initialize deflated matrices:
for to desired number of eigenpairs do
Find eigenpair using Algorithm 1:
Add eigenpair to the set:
Apply deflation to to obtain
end for
return
While in orthogonalization-based deflation (like Householder deflation), finding the minimum of the Rayleigh quotient at each iteration is sufficient to proceed, since the corresponding eigenpair is fully removed from the problem, this is not the case for subtractive deflation methods. In the latter, each iteration annihilates (but does not fully eliminate) the influence of the computed eigenpair. As a result, the same eigenpair might reappear as the minimum in subsequent iterations. If the matrix is positive definite, this issue typically manifests already at the first deflation step. To overcome this issue, we employed the QUBO-based Algorithm 1, to search for the maximum magnitude of the Rayleigh quotient, which corresponds to identifying the dominant eigenpair. Taking into account all the considerations discussed above, we formulate Algorithm 2 and Algorithm 3, which are designed to compute the complete eigenspectrum of the SEVP and the GEVP, respectively.
A potential performance issue arises because computing the maximum magnitude requires solving two QUBO problems at each iteration, resulting in a total of
Algorithm 3 Hybrid full spectrum solver for the GEVP
Require: Symmetric matrix pair , where is SPD, and a chosen deflation method
Ensure: Eigenvalues and eigenvectors
Initialize set of computed eigenpairs:
Initialize deflated matrices:
for to desired number of eigenpairs do
Find eigenpair using Algorithm 1, extended for the GEVP:
Add eigenpair to the set:
Apply deflation to to obtain
end for
return
QUBO problems for iterations. To mitigate this computational cost, we implement a strategy where, at each iteration, the QUBO result that is not immediately used (i.e., the eigenpair corresponding to the minimum magnitude) is stored and reused in the subsequent iteration. This approach reduces the total number of QUBO problems to solve, thereby improving computational efficiency.
Specifically, for the SEVP, only iterations are required if the matrix is strictly positive definite or strictly negative definite, whereas iterations are needed if is not strictly positive or negative definite. The same applies to the GEVP: only iterations are needed if the matrix pair satisfies strict definiteness conditions; otherwise, iterations are necessary.
Hereafter, we analyse the computational cost of each of the aforementioned deflation methods. All three methods share the same asymptotic complexity when extracting the full spectrum of dense matrices:
Total time: for each method (arising from work per deflation step, repeated times; this excludes the cost of the eigensolver used to compute individual pairs).
Memory: (storage of , , and dense aux-
iliary matrices).
Despite sharing the same asymptotic cost, the methods differ in numerical robustness, hidden constants, and structure preservation.
The Hotelling method computes and performs a rank-one correction of at each deflation step, for a cost of . It is simple and has low hidden constants, but may introduce numerical instabilities unless combined with re-orthogonalization or filtering.
The Orthogonal Projection approach also performs , followed by orthogonalization in the -inner product and projection, again yielding an cost per step. Its cost is stable across iterations, and it is typically the most numerically robust method, producing fewer spurious eigenpairs.
Finally, the Householder deflation applies congruent reflectors to progressively smaller active submatrices. The -th iteration costs with , leading to a total of but with smaller leading constants because later steps are cheaper.
This approach preserves symmetry and congruence and is often efficient in practice on dense problems, though repeated updates of and may compromise the orthogonality of the computed eigenvectors.
Numerical Implementation and Results
As a study case, we consider . The starting Hamiltonian is defined as
Here, denotes the intrinsic kinetic energy, and is the Daejeon interaction derived from the component of the N3LO potential [61] through a two-step procedure. First, the potential is softened using the SRG method [62] with flow parameter then, a phase-equivalent transformation is applied to determine an optimal parametrization of the force. We use this Hamiltonian to generate a HF basis encompassing 3 major shells. We use the HF states to create the TD phonon basis and generate the 2-phonon basis by deriving and solving iteratively the EMPM Eq. (5); the basis so constructed is adopted to solve the final eigenvalue problem in the multiphonon space Eq. (10).
Ground state
We begin by evaluating the performance of the QUBO-based algorithm for computing the ground-state eigenpair using a D-Wave quantum annealer. All quantum annealing (QA) calculations were carried out on the Advantage System 6.4 [63], which provides 5,614 working qubits. For comparison, we also performed the same simulations using a classical Simulated Annealing (SA) solver.
The analysis covers different multipolarities, corresponding to different matrix dimensions , and two bit resolutions, and . The starting point in the plots corresponds to the output of the initial-guess phase, where the precision parameter (see Section III) is set to 1. The subsequent evolution shows how the accuracy improves during the descent phase as the discretized search cube is progressively refined by increasing .
For each configuration, we monitor the errors on the eigenvalue (eval_error) and eigenvector (evec_error) as functions of both and of the iteration number (). Here, eval_error denotes the deviation of the computed eigenvalue from the exact one, while evec_error is the Euclidean distance between the computed eigenvector and the true ground-state eigenvector. Reference solutions were obtained using standard numerical eigensolvers.
We first discuss the results shown in Figure 1 for . The figure reports the number of correct digits of the lowest eigenvalue and the corresponding eigenvector for the TDA Hamiltonian, comparing SA and QA. Panels (a), (c), and (e) refer to SA, while panels (b), (d), and (f) refer to QA. The parameter is also indicated. As test cases, we consider three Hamiltonians: the TDA Hamiltonian for with dimension , the TDA Hamiltonian for with dimension , and the full Hamiltonian for with dimension .

Figure 1. Digits of accuracy of the lowest eigenvalue and of the corresponding eigenvector for the TDA Hamiltonian diagonalization with and , performed with SA (a,c,e) and with QA (b,d,f). The value is also reported.
Let us start with (panels (a),(b)). We observe no significant difference between SA and QA in terms of the number of iterations ().
As the dimension increases with (panels (c),(d)), QA (panel (d)) begins to show better performance compared to SA (panel (c)), with the number of iterations decreasing from with SA to with QA.
The most interesting scenario is the full Hamiltonian case (panels (e), (f)). Here, SA (panel (e)) fails to improve the accuracy of the lowest energy eigenvalue beyond the initial guess phase. On the other hand, QA (panel (f)) achieves machine-precision accuracy on the computed eigenvalue within iterations.
We now analyse the case with increased bit resolution, setting (Figure 2). Compared to the case, we observe a significant improvement in the performance of QA over SA. For the largest matrix size , SA (panel (e)) requires approximately iterations to achieve machine-precision accuracy on the lowest eigenvalue, whereas QA (panel (f)) reaches the same level of accuracy within only iterations.

Figure 2. Same as Figure 1, for .
Let’s conclude this Section with an analysis of QA performance in solving a GEVP. Specifically, we discuss the results obtained for the EMPM Hamiltonian with and and of dimension , respectively.
Even in the GEVP case, we find a meaningful improvement in performance when using QA over SA. This is already clear for (Figure 3), where using QA we get the eigenvalue with accuracy in , while with SA we need , as shown in Figure 3(a),(Figure 3b) for . For the eigenvector, the level of accuracy is for with QA, versus for with SA. For (Figure 3), we can formulate similar observations when comparing the result for SA, in Figure 3(c), with the one for QA in Figure 3(d). The SA is not sufficient to achieve 8-digit accuracy, while using QA the algorithm is able to gain in accuracy for . An analogous behaviour comes out also for , shown in Figure 3(e) for SA and in Figure 3(f) for QA. The error on the lowest eigenvector reflects the trend described for the eigenvalue error and it remains above in all the cases.

Figure 3. Results for the solution of the GEVP within the Equation-of-Motion Phonon Method with and .
Our results demonstrate a significant performance advantage of QA algorithm over SA also when solving GEVPs with , as shown in Figure 4. Here, QA achieves an eigenvalue accuracy of within only , while SA requires (Figure 4(a) and (Figure 4b) for ). Similarly, QA finds the eigenvector with an accuracy of for compared to needed by SA to reach the same level of accuracy.

Figure 4. Same as Figure 3, for .
Similar observations hold for and (Figure 4(c-Figure 4f)). While SA struggles to achieve 8-digit accuracy in these cases, requiring from to , QA readily converges to an accuracy of within to .
From the above analysis, we can conclude that in all examined cases, the use of QA over SA guarantees a quicker convergence to the accuracy, since it requires less iterations. This gap in performance becomes more noticeable as the matrix size increases. In particular, there are cases in which SA doesn’t even let reach the eigenvalue accuracy of , as shown in Figure 4(c),(Figure 4e) for . In all the other cases, the boost in performances found ranges between 78% and 98% for the number of iterations, indicating a clear improvement in sampling efficiency of QA with respect to SA.
Full spectrum
We now analyse the results for the full spectrum. Due to the limited Quantum Processing Unit (QPU) time available on the D-Wave quantum annealer, in this section we only demonstrate the reliability of our approach for the SA case. Here, the QUBO algorithm used to determine the dominant eigenpair (Algorithm 1) is combined with the three different deflation methods outlined in § 5.
We start by analysing the results obtained for the SEVP. Here, we report the results for the EMPM full Hamiltonian with (Figure 5) and (Figure 6). A detailed inspection of the results shows that all the implemented deflation techniques yield highly accurate final eigenvalues and eigenvectors, achieving up to 13 and 8 correct digits, respectively.

Figure 5. Digits of accuracy of the eigenpairs of the SEVP EMPM full Hamiltonian with respect to the three different methods adopted, with .

Figure 6. Same as Fig. 5, for .
The total execution time (), comprising both the deflation step and the annealing phase time, varies across the three deflation methods. For the Hotelling method,
s with and it increases to 526.06 s with . For the Orthogonal Projection method, s with and it increases to 533.20 s with . Lastly, the Householder method is significantly faster, with s with and s with . This performance advantage stems from its deflation strategy, which progressively reduces the size of the active submatrix, thereby minimizing computational effort as the algorithm advances.
In the case of the GEVP, at variance with the SEVP, the repeated application of Householder reflectors for deflation introduces a progressive deterioration of the matrix that compromises numerical stability. Although each reflector
is orthogonal, the transformations, reported in Eq. (42), that it generates, induce fill-in and distort the original symmetry (see, e.g., [64, 65]). Furthermore, rounding errors introduced in the early deflations are amplified in the subsequent ones, preventing already deflated vectors from remaining normalized with respect to the -inner product. Additionally, when eigenvalues lie close together [66], the procedure tends to fail to converge to the target eigenvalue, since adjacent spectral values accentuate small perturbations in the basis and make it difficult to correctly isolate the desired eigenvalue. As a result, the Householder deflation procedure is unstable and not applicable in this phase of the numerical comparison.
The other two methods, Hotelling and Orthogonal Projection, instead, produce results with high accuracy, comparable to the standard case.

Figure 8. Same as Figure 7, for .

Figure 7. Digits of accuracy of the eigenpairs of the GEVP EMPM with with respect to the three different methods adopted, with .
The total execution time () for the three deflation methods varies as follows. For the Hotelling method, s with and it increases to s with . For the Orthogonal Projection method, s with and it increases to s with .
b = 4. In contrast, the Householder method remains significantly faster, with s with and s with .
Conclusion
In this manuscript we have applied a QUBO-based hybrid quantum-classical framework for computing the eigenspectrum of realistic EMPM Hamiltonians. The first part of the analysis focused on the ground-state estimation, where direct comparison between simulated annealing and quantum annealing reveals that the quantum approach yields systematically better results. This clearly highlights an advantage of quantum sampling with respect to classical simulated annealing.
Building upon the validated ground-state methodology, we have then extended the approach to full-spectrum reconstruction via an iterative deflation strategy. Our findings demonstrate that the proposed QUBO-based iterative scheme, combined with classical postprocessing, accurately recovers all eigenpairs of the EMPM Hamiltonian.
In the SEVP case, all three deflation strategies-Hotelling, Orthogonal Projection and Householder-yield eigenvalues and eigenvectors with machine precision for both and , confirming the numerical robustness of the method for the solution of symmetric eigenvalue problems. In contrast, for the GEVP, the progressive loss of orthogonality induced by repeated Householder updates leads to rapid numerical deterioration. Consequently, Householder deflation cannot be reliably employed in this context. The Hotelling and Orthogonal Projection methods, instead, preserve accuracy across all iterations and remain effective also in the generalized case.
Overall, these findings confirm that the proposed hybrid QUBO-deflation framework provides a viable route to extend quantum annealing methods beyond ground-state estimation toward systematic reconstruction of the entire spectrum. The comparison between simulated annealing and quantum annealing indicates a performance advantage of the quantum approach in exploring the energy landscape associated with the QUBO formulation of the EMPM Hamiltonian. Although this result is obtained within the present QUBO framework and for matrix sizes compatible with current quantum annealing hardware, it supports the potential of quantum annealing as an effective strategy for spectral estimation problems of this class.
The demonstrated robustness of the deflation mechanisms establishes the required groundwork for future implementations fully executed on quantum annealers. In particular, a natural next step will be to reduce the degree of classical part of the algorithm by encoding also the deflation step directly as a QUBO minimization problem, with the long-term goal of realizing a fully quantum annealing-based spectral solver with minimal hybrid overhead.
Acknowledgments
G.D.G. acknowledges the support from the EU-FESR, PON Ricerca e Innovazione, Grant No. 2014-2020-DM 1062/2021. This work is also supported the Czech Science Foundation (Czech Republic), P203-26-21972S. Computational resources were partially provided by the e-INFRA CZ project (ID:90254), supported by the Ministry of Education, Youth and Sports of the Czech Republic, and by the ELIXIR-CZ project (ID:90255), supported by the Ministry of Education, Youth and Sports of the Czech Republic, and by the ELIXIR-CZ project (ID:90255).
References
- [31]A. Peruzzo, J. McClean, P. Shadbolt, M.-H. Yung, X.-Q. Zhou, P. J. Love, A. Aspuru-Guzik, and J. L. O’Brien, A variational eigenvalue solver on a photonic quantum processor, Nature Communications 5, 4213 (2014).DOI
- [32]J. Tilly, H. Chen, S. Cao, D. Picozzi, K. Setia, Y. Li, E. Grant, L. Wossnig, I. Rungger, G. H. Booth, and J. Tennyson, The variational quantum eigensolver: A review of methods and best practices, Physics Reports 986, 1 (2022), the Variational Quantum Eigensolver: a review of methods and best practices.DOI
- [33]W. Kirby, M. Motta, and A. Mezzacapo, Exact and efficient Lanczos method on a quantum computer, Quantum 7, 1018 (2023).DOI
- [34]K. M. Nakanishi, K. Mitarai, and K. Fujii, Subspace-search variational quantum eigensolver for excited states, Phys. Rev. Res. 1, 033062 (2019).DOI
- [35]O. Higgott, D. Wang, and S. Brierley, Variational quantum eigensolver for excited states, Quantum 3, 156 (2019).
- [36]R. M. Parrish, E. G. Hohenstein, P. L. McMahon, and T. J. Martínez, Quantum computation of electronic transitions using a variational quantum eigensolver, Phys. Rev. Lett. 122, 230401 (2019).DOI
- [37]N. V. Tkachenko, L. Cincio, A. I. Boldyrev, S. Tretiak, P. A. Dub, and Y. Zhang, Quantum davidson algorithm for excited states, Quantum Science and Technology 9, 035012 (2024).arxiv.org/abs/2204.10741
- [38]J. R. McClean, M. E. Kimchi-Schwartz, J. Carter, and W. A. de Jong, Hybrid quantum-classical hierarchy for mitigation of decoherence and determination of excited states, Phys. Rev. A 95, 042308 (2017).
- [39]J. I. Colless, V. V. Ramasesh, D. Dhlen, M. S. Blok, M. E. Kimchi-Schwartz, J. R. McClean, J. Carter, W. A. de Jong, and I. Siddiqi, Computation of molecular spectra on a quantum processor with an error-resilient algorithm, Phys. Rev. X 8, 011021 (2018).DOI
- [40]T. Takeshita, N. C. Rubin, Z. Jiang, E. Lee, R. Babbush, and J. R. McClean, Increasing the representation accuracy of quantum simulations of chemistry without extra quantum resources, Phys. Rev. X 10, 011004 (2020).
- [41]W. J. Huggins, J. Lee, U. Baek, B. O’Gorman, and K. B. Whaley, A non-orthogonal variational quantum eigensolver, New Journal of Physics 22, 073009 (2020).DOI
- [42]P. J. Ollitrault, A. Kandala, C.-F. Chen, P. K. Barkoutsos, A. Mezzacapo, M. Pistoia, S. Sheldon, S. Woerner, J. M. Gambetta, and I. Tavernelli, Quantum equation of motion for computing molecular excitation energies on a quantum computer, Phys. Rev. Res. 2, 043140 (2020).
- [43]A. Asthana et al., Equation-of-motion based methods for quantum computing: excited states and beyond, Chemical Science 14, 2405 (2023).
- [44]A. Kumar, A. Asthana, V. Abraham, T. D. Crawford, N. J. Mayhall, Y. Zhang, L. Cincio, S. Tretiak, and P. A. Dub, Variational quantum eigensolver for excited states using equation-of-motion ansatz, Journal of Chemical Theory and Computation 19, 9136 (2023).
- [45]M. Q. Hlatshwayo, J. Novak, and E. Litvinova, Quantum benefit of the quantum equation of motion for the strongly coupled many-body problem, Phys. Rev. C 109, 014306 (2024).
- [46]C. L. Cortes and S. K. Gray, Quantum krylov subspace algorithms for quantum dynamics simulations, Phys. Rev. A 105, 022417 (2022).
- [47]N. H. Stair, R. Huang, and F. A. Evangelista, Simulating many-body quantum chemistry with quantum computers, Journal of Chemical Theory and Computation 16, 2236 (2020).
- [48]M. Motta, C. Sun, A. T. K. Tan, M. J. O’Rourke, E. Ye, A. J. Minnich, F. G. S. L. Brandão, and G. K.-L. Chan, Determining eigenstates and thermal states on a quantum computer using quantum imaginary time evolution, Nat. Phys. 16, 205 (2020).
- [49]B. Krakoff, S. M. Mniszewski, and C. F. A. Negre, Controlled precision qubo-based algorithm to compute eigenvectors of symmetric matrices, PLOS ONE 17, 1 (2022).
- [50]M. Illa and M. J. Savage, Basic elements for simulations of standard-model physics with quantum annealers: Multigrid and clock states, Physical Review A 106, 052605 (2022).
- [51]M. G. Balducci, B. Chen, M. Möller, M. Gerritsma, and R. D. Breuker, Review and perspectives in quantum computing for partial differential equations in structural mechanics, Frontiers in Mechanical Engineering 8, 914241 (2022).
- [52]A. Stockley and K. Briggs, Optimizing antenna beam-forming with quantum computing, in Proceedings of the 2023 17th European Conference on Antennas and Propagation (EuCAP) (IEEE, 2023) pp. 1–5.
- [53]A. Rajak, S. Suzuki, A. Dutta, and B. K. Chakrabarti, Quantum annealing: an overview, Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences 381, 20210417 (2023).DOI
- [54]F. Fornetti, A. Gnec, T. Frederico, F. Pedretti, M. Rinaldi, A. Roggero, G. Salmè, S. Scopetta, and M. Viviani, Solving the homogeneous bethe-salpeter equation with a quantum annealer, Phys. Rev. D 110, 056012 (2024).arxiv.org/abs/2406.18669
- [55]H. Wolkowicz and G. P. H. Styan, Bounds for eigenvalues using traces, Linear Algebra and its Applications 29, 471 (1980).DOI
- [56]J. Nocedal and S. J. Wright, Numerical Optimization, 2nd ed. (Springer, New York, 2006).
- [57]C. B. Moler and G. W. Stewart, An algorithm for generalized matrix eigenvalue problems, SIAM Journal on Numerical Analysis 10, 241 (1973).DOI
- [58]B. Kågström and D. Kressner, Multishift variants of the qz algorithm with aggressive early deflation, SIAM Journal on Matrix Analysis and Applications 29, 199 (2006).
- [59]J. G. F. Francis, The qr transformation. a unitary analogue to the lr transformation—part 1, The Computer Journal 4, 265 (1961).
- [60]J. G. F. Francis, The qr transformation—part 2, The Computer Journal 4, 332 (1962).
- [61]A. Shirokov, I. Shin, Y. Kim, M. Sosonkina, P. Maris, and J. Vary, N3LO NN interaction adjusted to light nuclei in ab exit[u] approach, Physics Letters B 761, 87 (2016).
- [62]F. Wegner, Flow-equations for hamiltonians, Annalen der Physik 506, 77 (1994).
- [63]D.-W. Quantum, The advantage2 quantum computer systems, https://www.dwavequantum.com/solutions-and-products/systems/ (2025).
- [64]G. W. Stewart, Matrix Algorithms, Volume II: Eigensystems (SIAM, 2001).
- [65]C. F. Mehl and P. V. Dooren, On the stability of deflation techniques for generalized eigenvalue problems, SIAM Journal on Matrix Analysis and Applications 24, 658 (2003).
- [66]D. S. Watkins, The Matrix Eigenvalue Problem: GR and Krylov Subspace Methods (SIAM, 2007).