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:2606.07035 · Physical Review C

Solution of the Equation-of-Motion Phonon Method eigenvalue problems on the D-Wave quantum annealer

C. De Lucia, A. Martone, F. A. D'Aniello, A. Mastroianni, G. Nunziata, G. De Gregorio, R. Folprecht, F. Knapp, N. Lo Iudice, P. Vesely

nucl-thquant-phSubmitted Jun 5, 2026• Announced Jun 8, 2026• 0 citations
arXivHTMLPDF

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.

Comments
16 pages, 8 figures, 1 Tables, accepted for publication on Phys. Rev. C

Related papers

Solving Standard and Generalized EMPM Eigenvalue Problems: A QUBO Approach for the D-Wave Quantum Annealer

G. De Gregorio, C. De Lucia, Angelo Martone +6 more

Within the Equation of Motion Phonon Method (EMPM) framework, we address the computation of the ground-state eigenpair of nuclear Hamiltonians by reformulating the eigenvalue problem as a Quadratic Unconstrained Binary Optimization (QUBO). To this end, we adopt a QUBO-based iterative steepest-descent algorithm and validate its performance using Simulated An­nealing, demonstrating its feasibility for nuclear many-body calculations. This work represents a first step toward implementations on quantum annealers and extensions to the full eigenspectrum.

EPJ Web of Conferences•Jan 1, 2025•0 citations

Solving Standard and Generalized EMPM Eigenvalue Problems: A QUBO Approach for the D-Wave Quantum Annealer

G. De Gregorio, C. De Lucia, A. Martone +6 more

Within the Equation of Motion Phonon Method (EMPM) framework, we address the computation of the ground-state eigenpair of nuclear Hamiltonians by reformulating the eigenvalue problem as a Quadratic Unconstrained Binary Optimization (QUBO). To this end, we adopt a QUBO-based iterative steepest-descent algorithm and validate its performance using Simulated An­nealing, demonstrating its feasibility for nuclear many-body calculations. This work represents a first step toward implementations on quantum annealers and extensions to the full eigenspectrum.

•Nov 21, 2025•0 citations

Electronic structure with direct diagonalization on a D-wave quantum annealer

Alexander Teplukhin, Brian K. Kendrick, Sergei Tretiak +1 more

Quantum chemistry is regarded to be one of the first disciplines that will be revolutionized by quantum computing. Although universal quantum computers of practical scale may be years away, various approaches are currently being pursued to solve quantum chemistry problems on near-term gate-based quantum computers and quantum annealers by developing the appropriate algorithm and software base. This work implements the general Quantum Annealer Eigensolver (QAE) algorithm to solve the molecular electronic Hamiltonian eigenvalue-eigenvector problem on a D-Wave 2000Q quantum annealer. The approach is based on the matrix formulation, efficiently uses qubit resources based on a power-of-two encoding scheme and is hardware-dominant relying on only one classically optimized parameter. We demonstrate the use of D-Wave hardware for obtaining ground and excited electronic states across a variety of small molecular systems. The approach can be adapted for use by a vast majority of electronic structure methods currently implemented in conventional quantum-chemical packages. The results of this work will encourage further development of software such as qbsolv which has promising applications in emerging quantum information processing hardware and has expectation to address large and complex optimization problems intractable for classical computers.

arXiv:2009.01373•Scientific Reports•Nov 27, 2020•40 citations

Quantum computing of phonon spectra and thermal properties of crystalline solids

Naman Khandelwal, Bikash K. Behera, Ashok Kumar +1 more

Abstract Variational quantum algorithms offer a promising framework for solving eigenvalue problems on near-term quantum hardware, yet their applicability beyond electronic structure calculations remains relatively unexplored. In this work, we investigate the quantum computing of lattice vibrational and thermodynamical properties by applying the variational quantum eigensolver and variational quantum deflation to phonon Hamiltonians derived from first-principles force constants obtained using density functional theory. The mass-weighted dynamical matrix is mapped onto a qubit-encoded Hermitian operator, enabling computation of the full set of acoustic and optical phonon branches of crystalline silicon and graphene using a reduced qubit register and direct benchmarking against classical diagonalization. The quantum-computed phonon spectrum is further used to evaluate vibrational entropy, constant-volume specific heat, and thermal expansion coefficient, reproducing expected low-temperature quantum behavior and the high-temperature Dulong–Petit limit. We further demonstrate that combined error mitigation strategies help recover phonon dispersions and thermodynamic behavior consistent with expected trends on near-term quantum hardware. Although classical phonon methods remain computationally superior, our results establish phonon-based thermodynamics as a stringent and physically transparent benchmark for assessing variational quantum algorithms on near-term quantum devices.

arXiv:2604.16863•Physica Scripta•Jun 16, 2026•0 citations

Floating-Point Calculations on a Quantum Annealer: Division and Matrix Inversion

Michael L. Rogers, Robert Singleton

Systems of linear equations are employed almost universally across a wide range of disciplines, from physics and engineering to biology, chemistry and statistics. Traditional solution methods such as Gaussian elimination become very time consuming for large matrices, and more efficient computational methods are desired. In the twilight of Moore\rq{}s Law, quantum computing is perhaps the most direct path out of the darkness. There are two complementary paradigms for quantum computing, namely, gated systems and quantum annealers. In this paper, we express floating point operations such as division and matrix inversion in terms of a {\em quadratic unconstrained binary optimization} (QUBO) problem, a formulation that is ideal for a quantum annealer. We first address floating point division, and then move on to matrix inversion. We provide a general algorithm for any number of dimensions, but we provide results from the D-Wave quantum anneler for 2x2 and 3x3 general matrices. Our algorithm scales to very large numbers of linear equations. We should also mention that our algorithm provides the full solution the the matrix problem, while HHL provides only an expectation value.

arXiv:1901.06526•Frontiers in Physics•Nov 6, 2020•25 citations

Hybrid quantum annealing for price optimization under cross‑elastic demand

Ricardo Pérez‐Castillo, Fernando Lorente

In highly competitive markets, optimal price setting is a key strategic lever, particularly when item demand is elastic and interrelated. Small changes in the price of one item can significantly influence the demand for others through cross-elasticities, making the search for profit-maximizing price combinations a computationally challenging NP-hard problem. This paper proposes a hybrid quantum–classical approach to address large-scale price optimization under elastic demand with cross-item dependencies. The method combines quantum annealing, executed on D-Wave’s adiabatic quantum computing platform, with classical graph-based clustering to partition the problem into smaller subproblems compatible with current quantum hardware constraints. Each subproblem is formulated as a Quadratic Unconstrained Binary Optimization (QUBO) model that maximizes total profit while enforcing pricing constraints and incorporating cross-elasticity effects. The system was validated on synthetic datasets simulating item catalogs of up to 2,500 items, with varying price ranges, profit margins, and elasticity densities. Results show that the hybrid solver can deliver high-quality solutions in operationally reasonable times, outperforming pure quantum execution and achieving a substantially more favorable scalability–efficiency trade-off than classical approaches such as exhaustive search and simulated annealing. The proposed framework demonstrates the feasibility of applying quantum annealing to real-world decision-support problems in the near term, even under the technological limitations of current quantum devices. This work anticipates future enhancements in quantum hardware and provides a foundation for integrating quantum optimization into dynamic pricing strategies, allowing organizations to periodically and adaptively recalculate prices as demand patterns and market conditions evolve in commerce and e-commerce environments.

Computers & Operations Research•Mar 25, 2026•0 citations
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.
Within the Equation of Motion Phonon Method (EMPM) framework, we address the computation of the ground-state eigenpair of nuclear Hamiltonians by reformulating the eigenvalue problem as a Quadratic Unconstrained Binary Optimization (QUBO). To this end, we adopt a QUBO-based iterative steepest-descent algorithm and validate its performance using Simulated An­nealing, demonstrating its feasibility for nuclear many-body calculations. This work represents a first step toward implementations on quantum annealers and extensions to the full eigenspectrum.
Within the Equation of Motion Phonon Method (EMPM) framework, we address the computation of the ground-state eigenpair of nuclear Hamiltonians by reformulating the eigenvalue problem as a Quadratic Unconstrained Binary Optimization (QUBO). To this end, we adopt a QUBO-based iterative steepest-descent algorithm and validate its performance using Simulated An­nealing, demonstrating its feasibility for nuclear many-body calculations. This work represents a first step toward implementations on quantum annealers and extensions to the full eigenspectrum.
Quantum chemistry is regarded to be one of the first disciplines that will be revolutionized by quantum computing. Although universal quantum computers of practical scale may be years away, various approaches are currently being pursued to solve quantum chemistry problems on near-term gate-based quantum computers and quantum annealers by developing the appropriate algorithm and software base. This work implements the general Quantum Annealer Eigensolver (QAE) algorithm to solve the molecular electronic Hamiltonian eigenvalue-eigenvector problem on a D-Wave 2000Q quantum annealer. The approach is based on the matrix formulation, efficiently uses qubit resources based on a power-of-two encoding scheme and is hardware-dominant relying on only one classically optimized parameter. We demonstrate the use of D-Wave hardware for obtaining ground and excited electronic states across a variety of small molecular systems. The approach can be adapted for use by a vast majority of electronic structure methods currently implemented in conventional quantum-chemical packages. The results of this work will encourage further development of software such as qbsolv which has promising applications in emerging quantum information processing hardware and has expectation to address large and complex optimization problems intractable for classical computers.
Abstract Variational quantum algorithms offer a promising framework for solving eigenvalue problems on near-term quantum hardware, yet their applicability beyond electronic structure calculations remains relatively unexplored. In this work, we investigate the quantum computing of lattice vibrational and thermodynamical properties by applying the variational quantum eigensolver and variational quantum deflation to phonon Hamiltonians derived from first-principles force constants obtained using density functional theory. The mass-weighted dynamical matrix is mapped onto a qubit-encoded Hermitian operator, enabling computation of the full set of acoustic and optical phonon branches of crystalline silicon and graphene using a reduced qubit register and direct benchmarking against classical diagonalization. The quantum-computed phonon spectrum is further used to evaluate vibrational entropy, constant-volume specific heat, and thermal expansion coefficient, reproducing expected low-temperature quantum behavior and the high-temperature Dulong–Petit limit. We further demonstrate that combined error mitigation strategies help recover phonon dispersions and thermodynamic behavior consistent with expected trends on near-term quantum hardware. Although classical phonon methods remain computationally superior, our results establish phonon-based thermodynamics as a stringent and physically transparent benchmark for assessing variational quantum algorithms on near-term quantum devices.
Systems of linear equations are employed almost universally across a wide range of disciplines, from physics and engineering to biology, chemistry and statistics. Traditional solution methods such as Gaussian elimination become very time consuming for large matrices, and more efficient computational methods are desired. In the twilight of Moore\rq{}s Law, quantum computing is perhaps the most direct path out of the darkness. There are two complementary paradigms for quantum computing, namely, gated systems and quantum annealers. In this paper, we express floating point operations such as division and matrix inversion in terms of a {\em quadratic unconstrained binary optimization} (QUBO) problem, a formulation that is ideal for a quantum annealer. We first address floating point division, and then move on to matrix inversion. We provide a general algorithm for any number of dimensions, but we provide results from the D-Wave quantum anneler for 2x2 and 3x3 general matrices. Our algorithm scales to very large numbers of linear equations. We should also mention that our algorithm provides the full solution the the matrix problem, while HHL provides only an expectation value.
In highly competitive markets, optimal price setting is a key strategic lever, particularly when item demand is elastic and interrelated. Small changes in the price of one item can significantly influence the demand for others through cross-elasticities, making the search for profit-maximizing price combinations a computationally challenging NP-hard problem. This paper proposes a hybrid quantum–classical approach to address large-scale price optimization under elastic demand with cross-item dependencies. The method combines quantum annealing, executed on D-Wave’s adiabatic quantum computing platform, with classical graph-based clustering to partition the problem into smaller subproblems compatible with current quantum hardware constraints. Each subproblem is formulated as a Quadratic Unconstrained Binary Optimization (QUBO) model that maximizes total profit while enforcing pricing constraints and incorporating cross-elasticity effects. The system was validated on synthetic datasets simulating item catalogs of up to 2,500 items, with varying price ranges, profit margins, and elasticity densities. Results show that the hybrid solver can deliver high-quality solutions in operationally reasonable times, outperforming pure quantum execution and achieving a substantially more favorable scalability–efficiency trade-off than classical approaches such as exhaustive search and simulated annealing. The proposed framework demonstrates the feasibility of applying quantum annealing to real-world decision-support problems in the near term, even under the technological limitations of current quantum devices. This work anticipates future enhancements in quantum hardware and provides a foundation for integrating quantum optimization into dynamic pricing strategies, allowing organizations to periodically and adaptively recalculate prices as demand patterns and market conditions evolve in commerce and e-commerce environments.