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

Bulletin of the American Physical Society

A Many Body Eigenvalue Problem for Quantum Computation

Selman Hershfield

Published Mar 11, 2008• 0 citations
OpenAlex

Related papers

An Eigenvalue Problem for Quantum Computing

Selman Hershfield

Bulletin of the American Physical Society•Mar 6, 2007•0 citations

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 +7 more

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.

nucl-thCross-listedarXiv:2606.07035•Physical Review C•Jun 8, 2026•0 citations

Quantum algorithm for solving generalized eigenvalue problems with application to the Schrödinger equation

Grzegorz Rajchel-Mieldzioć, Szymon Pliś, E. J. Zak

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.

arXiv:2506.13534•Physical Review Research•Apr 11, 2026•6 citations

A Many--Body Hamiltonian Approach to Quantum Computation

Mario Rasetti, Elena Tagliati, Paolo Zanardi +1 more

•Jan 1, 1996•0 citations

Entangled-Multi-Body Quantum Simulation

Jincheng Zhang

This paper explores the potential of utilizing entangled multi-body states for enhanced quantum simulation. Traditional quantum simulation methods face limitations when simulating complex quantum systems, primarily due to their inability to effectively represent multi-particle correlations. We propose a novel approach leveraging the inherent properties of entangled states to achieve a more accurate and efficient simulation of these systems. Specifically, we examine the construction of quantum computers incorporating multi-body entangled states and their application to simulating quantum field theories, a domain where complex many-body interactions are prevalent. The core idea centers on exploiting the correlations encoded within entangled states to reduce the computational complexity associated with simulating high-dimensional quantum systems. We present a theoretical framework outlining the key challenges and potential strategies for realizing this approach, focusing on the design of appropriate quantum circuits and the optimization of entanglement protocols. The ultimate goal is to demonstrate a pathway towards simulating intricate quantum phenomena that are currently intractable using conventional simulation techniques. The simulation method is based on mapping the problem to a quantum computer. The quantum computer performs the simulation based on the state of the qubits. The final result is the answer to the original problem. The key mathematical tool is the quantum circuit. The quantum circuit is a series of quantum gates applied to qubits. The quantum gates are unitary transformations. The unitary transformations are represented by matrices. The matrix is a square matrix. The matrix is a linear transformation. The linear transformation is a transformation that preserves linear relationships. The eigenvalues of the matrix are the solutions to the equation det(A - λI) = 0, where A is the matrix and λ is the eigenvalue and I is the identity matrix. The eigenvectors of the matrix are the vectors that are transformed to themselves by the matrix. The eigenvectors are the solutions to the equation (A - λI)v = 0, where A is the matrix, λ is the eigenvalue and v is the eigenvector. The eigenvalues and eigenvectors are important concepts in linear algebra.

•Aug 29, 2026•0 citations

Solving Many-Body Problems on Quantum Computers

Fauseweh, Benedikt

•Jan 1, 2025•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.
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.
This paper explores the potential of utilizing entangled multi-body states for enhanced quantum simulation. Traditional quantum simulation methods face limitations when simulating complex quantum systems, primarily due to their inability to effectively represent multi-particle correlations. We propose a novel approach leveraging the inherent properties of entangled states to achieve a more accurate and efficient simulation of these systems. Specifically, we examine the construction of quantum computers incorporating multi-body entangled states and their application to simulating quantum field theories, a domain where complex many-body interactions are prevalent. The core idea centers on exploiting the correlations encoded within entangled states to reduce the computational complexity associated with simulating high-dimensional quantum systems. We present a theoretical framework outlining the key challenges and potential strategies for realizing this approach, focusing on the design of appropriate quantum circuits and the optimization of entanglement protocols. The ultimate goal is to demonstrate a pathway towards simulating intricate quantum phenomena that are currently intractable using conventional simulation techniques. The simulation method is based on mapping the problem to a quantum computer. The quantum computer performs the simulation based on the state of the qubits. The final result is the answer to the original problem. The key mathematical tool is the quantum circuit. The quantum circuit is a series of quantum gates applied to qubits. The quantum gates are unitary transformations. The unitary transformations are represented by matrices. The matrix is a square matrix. The matrix is a linear transformation. The linear transformation is a transformation that preserves linear relationships. The eigenvalues of the matrix are the solutions to the equation det(A - λI) = 0, where A is the matrix and λ is the eigenvalue and I is the identity matrix. The eigenvectors of the matrix are the vectors that are transformed to themselves by the matrix. The eigenvectors are the solutions to the equation (A - λI)v = 0, where A is the matrix, λ is the eigenvalue and v is the eigenvector. The eigenvalues and eigenvectors are important concepts in linear algebra.