Solving complex eigenvalue problems on a quantum annealer with applications to quantum scattering resonances
Open accessThe DOI matches its Crossref record; 21 of the 22 references it cites were found in a registry or an index.
Abstract
The Quantum Annealer Eigensolver (QAE) is applied to the calculation of quantum scattering resonances and their lifetimes on a D-Wave quantum annealer.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
The cited source says what the claim attributes to it.
In the citing paper
“In addition, a QUBO decomposition algorithm (i.e., QBSolv) splits a large QUBO matrix into small pieces of subQUBO matrices, allowing us to handle a QUBO matrix with dimensions higher than the maximum number of qubits in the QA hardware 26,27 .”
From Quantum annealing for combinatorial optimization: a benchmarking study (2025) · cites this paper as [26]
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Quantum Computing in the NISQ era and beyond
Preskill, J. (2018) · Quantum · doi:10.22331/q-2018-08-06-79 · Cited by 8,830
A variational eigenvalue solver on a photonic quantum processor
Peruzzo, A., McClean, J., Shadbolt, P., Yung, M.-H., Zhou, X.-Q., Love, P. J., Aspuru-Guzik, A., & O’Brien, J. L. (2014) · Nature Communications · doi:10.1038/ncomms5213 · Cited by 4,552
Anderson, E., Bai, Z., Bischof, C., Blackford, L. S., Demmel, J., Dongarra, J., Du Croz, J., Greenbaum, A., Hammarling, S., McKenney, A., et al. (1999) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9780898719604 · Cited by 4,435
Ladd, T. D., Jelezko, F., Laflamme, R., Nakamura, Y., Monroe, C., & O’Brien, J. L. (2010) · Nature · doi:10.1038/nature08812 · Cited by 3,592
The theory of variational hybrid quantum-classical algorithms
McClean, J. R., Romero, J., Babbush, R., & Aspuru-Guzik, A. (2016) · New Journal of Physics · doi:10.1088/1367-2630/18/2/023023 · Cited by 2,227
Quantum computational chemistry
McArdle, S., Endo, S., Aspuru-Guzik, A., Benjamin, S. C., & Yuan, X. (2020) · Reviews of Modern Physics · doi:10.1103/revmodphys.92.015003 · Cited by 1,621
Quantum Chemistry in the Age of Quantum Computing
Cao, Y., Romero, J., Olson, J. P., Degroote, M., Johnson, P. D., Kieferová, M., Kivlichan, I. D., Menke, T., Peropadre, B., Sawaya, N. P. D., et al. (2019) · Chemical Reviews · doi:10.1021/acs.chemrev.8b00803 · Cited by 1,560
Quantum Chemistry in the Age of Quantum Computing
Cao, Y., Romero, J., Olson, J., Degroote, M., Johnson, P., Kieferová, M., Kivlichan, I., Menke, T., Peropadre, B., Sawaya, N., et al. (n.d.) · OPUS - Open Publications of UTS Scholars (University of Technology Sydney) · Cited by 1,265
Quantum algorithms: an overview
Montanaro, A. (2016) · npj Quantum Information · doi:10.1038/npjqi.2015.23 · Cited by 1,071
A Survey on quantum computing technology
Gyongyosi, L., & Imre, S. (2019) · Computer Science Review · doi:10.1016/j.cosrev.2018.11.002 · Cited by 646
Research works printed but not linked: 3
- O'Malley, 2016, Phys. Rev. X, 6, 031007
- M. Streif , F.Neukart and M.Leib , International Workshop on Quantum Technology and Optimization Problems, 2019, pp. 111-122
- S. N. Genin , I. G.Ryabinkin and A. F.Izmaylov , arXiv preprint arXiv:1901.04715, 2019 · arXiv
Cited by
SU(2) lattice gauge theory on a quantum annealer
Rahman, S. A., Lewis, R., Mendicelli, E., & Powell, S. J. M. (2021) · Physical review. D/Physical review. D. · doi:10.1103/physrevd.104.034501 · Cited by 109
“(14)) [62] and was also extended to accommodate complex matrices [63].”
BackgroundScalable distributed gate-model quantum computers
Gyöngyösi, L., & Imre, S. (2021) · Scientific Reports · doi:10.1038/s41598-020-76728-5 · Cited by 95
Illa, M., & Savage, M. J. (2022) · Physical Review A · doi:10.1103/physreva.106.052605 · Cited by 79
Quantum annealing for combinatorial optimization: a benchmarking study
Kim, S., Ahn, S.-W., Suh, I.-S., Dowling, A. W., Lee, E., & Luo, T. (2025) · npj Quantum Information · doi:10.1038/s41534-025-01020-1 · Cited by 46
“In addition, a QUBO decomposition algorithm(i.e.,QBSolv)splitsalargeQUBOmatrixintosmallpiecesofsub-QUBOmatrices,allowingustohandleaQUBOmatrixwithdimensions higherthanthemaximumnumberofqubitsintheQAhardware 26,27 .”
Computing molecular excited states on a D-Wave quantum annealer
Teplukhin, A., Kendrick, B. K., Mniszewski, S. M., Zhang, Y., Kumar, A., Negre, C. F. A., Anisimov, P. M., Tretiak, S., & Dub, P. A. (2021) · Scientific Reports · doi:10.1038/s41598-021-98331-y · Cited by 38
Self-citationGyöngyösi, L., & Imre, S. (2025) · Quantum Information and Computation · doi:10.2478/qic-2025-0006 · Cited by 40
Zhang, J. H., & Iyengar, S. S. (2022) · Journal of Chemical Theory and Computation · doi:10.1021/acs.jctc.1c01303 · Cited by 21
Resource prioritization and balancing for the quantum internet
Gyöngyösi, L., & Imre, S. (2020) · Scientific Reports · doi:10.1038/s41598-020-78960-5 · Cited by 19
Mapping Quantum Chemical Dynamics Problems to Spin-Lattice Simulators
Saha, D., Iyengar, S. S., Richerme, P., Smith, J. M., & Sabry, A. (2021) · Journal of Chemical Theory and Computation · doi:10.1021/acs.jctc.1c00688 · Cited by 17
Teplukhin, A., Kendrick, B. K., Mniszewski, S. M., Tretiak, S., & Dub, P. A. (2022) · PLoS ONE · doi:10.1371/journal.pone.0263849 · Cited by 16
“For example, previously we have manually limited the largest elements of the complex vibrational Hamiltonian matrix [11] to improve the results.”
BackgroundMethodSelf-citationMolecular dynamics on quantum annealers
Gaidai, I., Babikov, D., Teplukhin, A., Kendrick, B. K., Mniszewski, S. M., Zhang, Y., Tretiak, S., & Dub, P. A. (2022) · Scientific Reports · doi:10.1038/s41598-022-21163-x · Cited by 16
“…and several attempts to harness the power of quantum computing for its benefit have already been made, including a method for solution of the quantum vibrational eigenvalue problem on a quantum annealer 22,23 , and the trajectory simulation of molecular vibrations on the IBM quantum devices 24,25 .”
MethodSelf-citationAdaptive Problem Solving Dynamics in Gate-Model Quantum Computers
Gyöngyösi, L. (2022) · Entropy · doi:10.3390/e24091196 · Cited by 14
Kumar, A., DeGregorio, N., Ricard, T. C., & Iyengar, S. S. (2022) · Journal of Chemical Theory and Computation · doi:10.1021/acs.jctc.2c00484 · Cited by 14
Three-flavor collective neutrino oscillation simulations on a qubit quantum annealer
Chernyshev, I. A. (2025) · Physical review. D/Physical review. D. · doi:10.1103/physrevd.111.043017 · Cited by 9
HUBO formulations for solving the eigenvalue problem
Jun, K., & Lee, H. (2022) · Results in Control and Optimization · doi:10.1016/j.rico.2023.100222 · Cited by 9
Graph-|Q⟩⟨C|: A Quantum Algorithm with Reduced Quantum Circuit Depth for Electronic Structure
Iyengar, S. S., Zhang, J. H., Saha, D., & Ricard, T. C. (2023) · The Journal of Physical Chemistry A · doi:10.1021/acs.jpca.3c04261 · Cited by 9
Mizuno, Y., & Komatsuzaki, T. (2024) · Physical Review Research · doi:10.1103/physrevresearch.6.043031 · Cited by 5
“Although previous studies [22–25] have pioneered quantum eigensolvers for complex eigenvalue problems, these approaches have limitations such as the lack of the theoretical guarantee of an exponential speedup and requiring a specific form of input states (see Supplemental Material for details).”
BackgroundMethodZade, A. A., Sugisaki, K., Werner, M., Palacios, A., Riu, J., Nogué, J., García-Sáez, A., Riera, A., & Prasannaa, V. S. (2025) · The European Physical Journal Plus · doi:10.1140/epjp/s13360-025-06858-0 · Cited by 7
Solving the homogeneous Bethe-Salpeter equation with a quantum annealer
Fornetti, F., Gnech, A., Frederico, T., Pederiva, F., Rinaldi, M., Roggero, A., Salmè, G., Scopetta, S., & Viviani, M. (2024) · Physical review. D/Physical review. D. · doi:10.1103/physrevd.110.056012 · Cited by 4
Distributed quantum computation for near-term quantum environments
Gyöngyösi, L., & Imre, S. (2021) · doi:10.1117/12.2585996 · Cited by 4
Electronic structure theory with molecular point group symmetries on quantum annealers
Desroches, J., & Dong, S. S. (2025) · The Journal of Chemical Physics · doi:10.1063/5.0261736 · Cited by 3
A Review of Quantum Machine Learning Applications
Marcozzi, M., Filatovas, E., & Paulavičius, R. (2025) · Studies in computational intelligence · doi:10.1007/978-3-031-88486-3_7 · Cited by 2
Solving Helmholtz problems with finite elements on a quantum annealer
Rémi, A., Damanet, F., & Geuzaine, C. (2025) · Physical Review A · doi:10.1103/l4l6-qlj4 · Cited by 1
Approximation Method for Optimization Problems in Gate-Model Quantum Computers
Gyöngyösi, L. (2021) · Chaos Solitons & Fractals X · doi:10.1016/j.csfx.2021.100066 · Cited by 1
Investigating how to simulate lattice gauge theories on a quantum computerPreprint
Mendicelli, E. (2023) · arXiv (Cornell University) · doi:10.48550/arxiv.2308.15421 · Cited by 1
Resource optimization for the quantum Internet
Gyöngyösi, L., & Imre, S. (2022) · Quantum Computing, Communication, and Simulation · doi:10.1117/12.2607957
“The quantum Internet is modeled as a quantum network consisting of quantum repeaters and primarily entangled connections between the quantum repeaters [45-281].”
BackgroundIyengar, S. S., Saha, D., Dwivedi, A., Lopez-Ruiz, M. A., Kumar, A., Zhang, J. H., Ricard, T. C., Richerme, P., & Sabry, A. (2023) · Elsevier eBooks · doi:10.1016/b978-0-12-821978-2.00139-2
Dai, J., Vidwans, A., Wan, E. H., Miller, A. X., & Soley, M. B. (2026) · Journal of Chemical Theory and Computation · doi:10.1021/acs.jctc.5c01939
“…to the development of quantum algorithms to identify eigenstates of associated non-Hermitian Hamiltonians, 20 − 29 including left-and right-eigenvectors associated with parity-time reversal ( ) symmetry breaking at exceptional points 28,29 and resonances (purely outgoing eigenstates) associated…”
Investigating how to simulate gauge theories on a quantum computer
Mendicelli, E. (2023) · YorkSpace (York University) · Cited by 1
Metadata
- Authors
- Teplukhin, A., Kendrick, B. K., & Babikov, D.
- Affiliations
- Los Alamos National Laboratory (US)
- Marquette University (US)
- Corresponding author
- Kendrick, Brian K.
- Venue
- Physical Chemistry Chemical Physics
- Publisher
- Royal Society of Chemistry (RSC)
- Published
- 2020
- Volume
- 22
- Issue
- 45
- Pages
- 26136-26144
- ISSN
- 1463-9076 (ISSN-L)
- 1463-9084
- OpenAlex
- W3089382188
- Cited by
- 28
- References
- 22
- Citations by year
- 2026: 1 · 2025: 7 · 2024: 2 · 2023: 3 · 2022: 7 · 2021: 7 · 2020: 1
- FWCI
- 1.77
- Type
- journal article
- Language
- en
- Open access
- Locations
- Physical Chemistry Chemical Physics (publishedVersion)
- PubMed (publishedVersion)
- e-Publications@Marquette (Marquette University) (submittedVersion)
- OSTI OAI (U.S. Department of Energy Office of Scientific and Technical Information) (submittedVersion)
- Funders
- Laboratory Directed Research and Development (20170221ER, 20200056DR)
- Division of Atmospheric and Geospace Sciences (AGS-1920523)
- U.S. Department of Energy (89233218CNA000001)
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
- Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum Mechanics and Applications
- Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum many-body systems
- Keywords
- complex eigenvalue problem, quantum annealing, D-Wave quantum annealer, complex Hermitian matrices, complex symmetric matrices, O+O collisions, resonance width, vibrational spectra, quantum chemistry on quantum computers
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.