Papers › Using Quantum Annealers to Calculate Ground State Properties of Molecules
Using Quantum Annealers to Calculate Ground State Properties of Molecules
Justin Copenhaver, Adam Wasserman, Birgit Wehefritz-Kaufmann
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
Quantum annealers are an alternative approach to quantum computing which make use of the adiabatic theorem to efficiently find the ground state of a physically realizable Hamiltonian. Such devices are currently commercially available and have been successfully applied to several combinatorial and discrete optimization problems. However, the application of quantum annealers to problems in chemistry remains a relatively sparse area of research due to the difficulty in mapping molecular systems to the Ising model Hamiltonian. In this paper we review two different methods for finding the ground state of molecular Hamiltonians using Ising model-based quantum annealers. In addition, we compare the relative effectiveness of each method by calculating the binding energies, bond lengths, and bond angles of the H+3and H2O molecules and mapping their potential energy curves. We also assess the resource requirements of each method by determining the number of qubits and computation time required to simulate each molecule using various parameter values. While each of these methods is capable of accurately predicting the ground state properties of small molecules, we find that they are still outperformed by modern classical algorithms and that the scaling of the resource requirements remains a challenge.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections