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

• URL: http://arxiv.org/abs/2606.07035v1
• Date: Fri, 05 Jun 2026 08:26:12 GMT
• Title: Solution of the Equation-of-Motion Phonon Method eigenvalue problems on the D-Wave quantum annealer
• Abstract summary: Solution of large-scale eigenvalue problems is crucial in nuclear many-body theory.<n>Quantum computing opens new perspectives for addressing such demanding problems.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• 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.

Related papers

• Automatic De-Quantization of Quantum Programs Using Constant Propagation [42.89658025409898]
  Every quantum operation is costly, making it crucial to minimize quantum resource usage in near-term algorithms.<n>In this work, we focus on de-quantizing quantum operations to classical computation whenever possible.<n>We formalize a hybrid state model for quantum-classical constant propagation, implement our optimizations in the open-source MQT Core tool, and evaluate them on benchmark circuits.
  arXiv  Detail & Related papers  (2026-05-21T19:21:11Z)
• Quantum algorithm for solving generalized eigenvalue problems with application to the Schrödinger equation [0.0]
  Estimating excited-state energies is challenging for classical algorithms due to exponential scaling with system size.<n>We present a quantum algorithm for estimating eigenvalues and singular values of parameterized matrix families.
  arXiv  Detail & Related papers  (2025-06-16T14:24:30Z)
• QAMA: Scalable Quantum Annealing Multi-Head Attention Operator for Deep Learning [48.12231190677108]
  Quantum Annealing Multi-Head Attention (QAMA) is proposed, a novel drop-in operator that reformulates attention as an energy-based Hamiltonian optimization problem.<n>In this framework, token interactions are encoded into binary quadratic terms, and quantum annealing is employed to search for low-energy configurations.<n> Empirically, evaluation on both natural language and vision benchmarks shows that, across tasks, accuracy deviates by at most 2.7 points from standard multi-head attention.
  arXiv  Detail & Related papers  (2025-04-15T11:29:09Z)
• On the generalized eigenvalue problem in subspace-based excited state methods for quantum computers [0.0]
  Solving challenging problems in quantum chemistry is one of the leading promised applications of quantum computers.<n>Within the quantum algorithms proposed for problems in excited state quantum chemistry, subspace-based quantum algorithms are promising for pre-fault-tolerant quantum devices.<n>We show that errors in eigenvalues increase 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.<n>We also show that excited-state methods that have an eigenvalue equation as the working equation, such as q-sc-EOM, do not have such problems and
  arXiv  Detail & Related papers  (2025-03-12T17:26:11Z)
• Variational Quantum Subspace Construction via Symmetry-Preserving Cost Functions [36.94429692322632]
  We propose a variational strategy based on symmetry-preserving cost functions to iteratively construct a reduced subspace for extraction of low-lying energy states.<n>As a proof of concept, we test the proposed algorithms on H4 chain and ring, targeting both the ground-state energy and the charge gap.
  arXiv  Detail & Related papers  (2024-11-25T20:33:47Z)
• Quantum Computation of Electronic Structure with Projector Augmented-Wave Method and Plane Wave Basis Set [3.087342164520494]
  In electronic structure calculations on classical computers, resource reduction has been achieved by using the projector augmented-wave method (PAW) and plane wave basis sets.<n>We develop a unitary variant of the PAW that preserves the orthogonality constraints.<n>We provide the quantum resources for energy estimation of a nitrogen-vacancy defect centre in diamond.
  arXiv  Detail & Related papers  (2024-08-06T12:56:10Z)
• Quantum algorithms: A survey of applications and end-to-end complexities [88.57261102552016]
  The anticipated applications of quantum computers span across science and industry.<n>We present a survey of several potential application areas of quantum algorithms.<n>We outline the challenges and opportunities in each area in an "end-to-end" fashion.
  arXiv  Detail & Related papers  (2023-10-04T17:53:55Z)
• Quantum Worst-Case to Average-Case Reductions for All Linear Problems [66.65497337069792]
  We study the problem of designing worst-case to average-case reductions for quantum algorithms. We provide an explicit and efficient transformation of quantum algorithms that are only correct on a small fraction of their inputs into ones that are correct on all inputs.
  arXiv  Detail & Related papers  (2022-12-06T22:01:49Z)
• Error mitigation and quantum-assisted simulation in the error corrected regime [77.34726150561087]
  A standard approach to quantum computing is based on the idea of promoting a classically simulable and fault-tolerant set of operations. We show how the addition of noisy magic resources allows one to boost classical quasiprobability simulations of a quantum circuit.
  arXiv  Detail & Related papers  (2021-03-12T20:58:41Z)
• Electronic structure with direct diagonalization on a D-Wave quantum annealer [62.997667081978825]
  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. We demonstrate the use of D-Wave hardware for obtaining ground and electronically excited states across a variety of small molecular systems.
  arXiv  Detail & Related papers  (2020-09-02T22:46:47Z)
• A Query-based Quantum Eigensolver [8.136660631939154]
  We present an alternative type of quantum method that uses fixed-point quantum search to solve Type II eigenvalue problems. In addition, compared with the QPE method, our query-based method achieves a quadratic speedup in solving Type II problems.
  arXiv  Detail & Related papers  (2020-08-03T00:29:19Z)
• Quantum Solver of Contracted Eigenvalue Equations for Scalable Molecular Simulations on Quantum Computing Devices [0.0]
  We introduce a quantum solver of contracted eigenvalue equations, the quantum analogue of classical methods for the energies. We demonstrate the algorithm though computations on both a quantum simulator and two IBM quantum processing units.
  arXiv  Detail & Related papers  (2020-04-23T18:35:26Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.