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:2407.11235 · Faraday Discussions

Spiers Memorial Lecture: Quantum chemistry, classical heuristics, and quantum advantage

Garnet Kin‐Lic Chan

Published Jan 1, 2024• 34 citations
arXivHTMLPDF

Abstract

We describe the problems of quantum chemistry, the intuition behind classical heuristic methods used to solve them, a conjectured form of the classical complexity of quantum chemistry problems, and the subsequent opportunities for quantum advantage. This article is written for both quantum chemists and quantum information theorists. In particular, we attempt to summarize the domain of quantum chemistry problems as well as the chemical intuition that is applied to solve them within concrete statements (such as a classical heuristic cost conjecture) in the hope that this may stimulate future analysis.

DOI
10.1039/d4fd00141a

Related papers

Evaluating the evidence for exponential quantum advantage in ground-state quantum chemistry

Seunghoon Lee, Joonho Lee, Huanchen Zhai +15 more

Due to intense interest in the potential applications of quantum computing, it is critical to understand the basis for potential exponential quantum advantage in quantum chemistry. Here we gather the evidence for this case in the most common task in quantum chemistry, namely, ground-state energy estimation, for generic chemical problems where heuristic quantum state preparation might be assumed to be efficient. The availability of exponential quantum advantage then centers on whether features of the physical problem that enable efficient heuristic quantum state preparation also enable efficient solution by classical heuristics. Through numerical studies of quantum state preparation and empirical complexity analysis (including the error scaling) of classical heuristics, in both ab initio and model Hamiltonian settings, we conclude that evidence for such an exponential advantage across chemical space has yet to be found. While quantum computers may still prove useful for ground-state quantum chemistry through polynomial speedups, it may be prudent to assume exponential speedups are not generically available for this problem.

arXiv:2208.02199•Nature Communications•Apr 7, 2023•346 citations

Quantum Information and Quantum Computing for Chemical Systems

The development and use of quantum computers has the potential for revolutionary impact on the waycomputing supports chemical applications. Quantum computation for chemical applications has received enormous attention in recent years with rapid progress in both theoretical and experimental fronts. The development of quantum algorithms for quantum chemistry is stimulated by the greater availability of more capable quantum computing devices. But major challenges remain with one key example the development of quantum algorithms for solving chemical problems thought to be intractable for classical computers. Other challenges include understanding the role of quantum entanglement, coherence, and superposition in complex chemical processes such as photosynthesis.Theoretical chemists have encountered and analyzed quantum effects in physical chemistry for decades.Combining the results of the chemical physics community with insights from the quantum informationcommunity can lead to a fresh understanding of important chemical processes and the emergence of thenovel many-body formulations amenable for quantum computing. This Research Topic will invite leading scientists from all over the world who work in the fields of quantum information and computation to report their recent research results.

Frontiers research topics•Jan 1, 2021•0 citations

Quantum Chemistry in the Age of Quantum Computing

Yudong Cao, Jonathan Romero, Jonathan P. Olson +10 more

Practical challenges in simulating quantum systems on classical computers have been widely recognized in the quantum physics and quantum chemistry communities over the past century. Although many approximation methods have been introduced, the complexity of quantum mechanics remains hard to appease. The advent of quantum computation brings new pathways to navigate this challenging and complex landscape. By manipulating quantum states of matter and taking advantage of their unique features such as superposition and entanglement, quantum computers promise to efficiently deliver accurate results for many important problems in quantum chemistry, such as the electronic structure of molecules. In the past two decades, significant advances have been made in developing algorithms and physical hardware for quantum computing, heralding a revolution in simulation of quantum systems. This Review provides an overview of the algorithms and results that are relevant for quantum chemistry. The intended audience is both quantum chemists who seek to learn more about quantum computing and quantum computing researchers who would like to explore applications in quantum chemistry.

arXiv:1812.09976•Chemical Reviews•Aug 30, 2019•1,852 citations

Assessing quantum and classical approaches to combinatorial optimization: Testing quadratic speed-ups for heuristic algorithms

Pedro C. S. Costa, Mauro E. S. Morales, Dong Un An +1 more

Many recent investigations have concluded, based on asymptotic complexity analyses, that quantum computers could accelerate combinatorial optimization (CO) tasks relative to a purely classical computer. However, asymptotic analysis alone cannot support a credible claim of quantum advantage. Here, we highlight the challenges involved in benchmarking quantum and classical heuristics for CO, with a focus on the Sherrington-Kirkpatrick problem. Whereas hope remains that a quadratic quantum advantage is possible, our numerical analysis casts doubt on the idea that current methods exhibit any quantum advantage at all. This doubt arises because even a simple classical approach can match with quantum methods we investigated. We conclude that more careful numerical investigations are needed to evaluate the potential for quantum advantage in CO, and we give some possible future directions for such investigations.

arXiv:2412.13035•Physical Review A•Aug 4, 2025•0 citations

Simulating Chemistry Using Quantum Computers

Ivan Kassal, James Daniel Whitfield, Alejandro Perdomo‐Ortiz +2 more

The difficulty of simulating quantum systems, well known to quantum chemists, prompted the idea of quantum computation. One can avoid the steep scaling associated with the exact simulation of increasingly large quantum systems on conventional computers, by mapping the quantum system to another, more controllable one. In this review, we discuss to what extent the ideas in quantum computation, now a well-established field, have been applied to chemical problems. We describe algorithms that achieve significant advantages for the electronic-structure problem, the simulation of chemical dynamics, protein folding, and other tasks. Although theory is still ahead of experiment, we outline recent advances that have led to the first chemical calculations on small quantum information processors.

arXiv:1007.2648•Annual Review of Physical Chemistry•Mar 3, 2011•378 citations

Quantum computing and chemistry

Jared D. Weidman, Manas Sajjan, Camille A. Mikolas +4 more

As the year-to-year gains in speeds of classical computers continue to taper off, computational chemists are increasingly examining quantum computing as a possible route to achieve greater computational performance. Quantum computers, built upon the properties of superposition, interference, and entanglement of quantum bits, offer, in principle, the possibility to outperform classical computers for solving many important classes of problems. In the field of chemistry, quantum algorithm development offers promising propositions for solving classically intractable problems in areas such as electronic structure, chemical quantum dynamics, spectroscopy, and cheminformatics. However, physical implementations of quantum computers are still in their infancy and have yet to outperform classical computers for useful computations. Still, quantum software development for chemistry is a highly active area of research. In this perspective, we summarize recent progress in the areas of quantum computing algorithms, hardware, and software, and we describe the challenges that remain for useful implementations of quantum computing for chemical applications.

Cell Reports Physical Science•Jul 15, 2024•51 citations
We describe the problems of quantum chemistry, the intuition behind classical heuristic methods used to solve them, a conjectured form of the classical complexity of quantum chemistry problems, and the subsequent opportunities for quantum advantage. This article is written for both quantum chemists and quantum information theorists. In particular, we attempt to summarize the domain of quantum chemistry problems as well as the chemical intuition that is applied to solve them within concrete statements (such as a classical heuristic cost conjecture) in the hope that this may stimulate future analysis.
Due to intense interest in the potential applications of quantum computing, it is critical to understand the basis for potential exponential quantum advantage in quantum chemistry. Here we gather the evidence for this case in the most common task in quantum chemistry, namely, ground-state energy estimation, for generic chemical problems where heuristic quantum state preparation might be assumed to be efficient. The availability of exponential quantum advantage then centers on whether features of the physical problem that enable efficient heuristic quantum state preparation also enable efficient solution by classical heuristics. Through numerical studies of quantum state preparation and empirical complexity analysis (including the error scaling) of classical heuristics, in both ab initio and model Hamiltonian settings, we conclude that evidence for such an exponential advantage across chemical space has yet to be found. While quantum computers may still prove useful for ground-state quantum chemistry through polynomial speedups, it may be prudent to assume exponential speedups are not generically available for this problem.
The development and use of quantum computers has the potential for revolutionary impact on the waycomputing supports chemical applications. Quantum computation for chemical applications has received enormous attention in recent years with rapid progress in both theoretical and experimental fronts. The development of quantum algorithms for quantum chemistry is stimulated by the greater availability of more capable quantum computing devices. But major challenges remain with one key example the development of quantum algorithms for solving chemical problems thought to be intractable for classical computers. Other challenges include understanding the role of quantum entanglement, coherence, and superposition in complex chemical processes such as photosynthesis.Theoretical chemists have encountered and analyzed quantum effects in physical chemistry for decades.Combining the results of the chemical physics community with insights from the quantum informationcommunity can lead to a fresh understanding of important chemical processes and the emergence of thenovel many-body formulations amenable for quantum computing. This Research Topic will invite leading scientists from all over the world who work in the fields of quantum information and computation to report their recent research results.
Practical challenges in simulating quantum systems on classical computers have been widely recognized in the quantum physics and quantum chemistry communities over the past century. Although many approximation methods have been introduced, the complexity of quantum mechanics remains hard to appease. The advent of quantum computation brings new pathways to navigate this challenging and complex landscape. By manipulating quantum states of matter and taking advantage of their unique features such as superposition and entanglement, quantum computers promise to efficiently deliver accurate results for many important problems in quantum chemistry, such as the electronic structure of molecules. In the past two decades, significant advances have been made in developing algorithms and physical hardware for quantum computing, heralding a revolution in simulation of quantum systems. This Review provides an overview of the algorithms and results that are relevant for quantum chemistry. The intended audience is both quantum chemists who seek to learn more about quantum computing and quantum computing researchers who would like to explore applications in quantum chemistry.
Many recent investigations have concluded, based on asymptotic complexity analyses, that quantum computers could accelerate combinatorial optimization (CO) tasks relative to a purely classical computer. However, asymptotic analysis alone cannot support a credible claim of quantum advantage. Here, we highlight the challenges involved in benchmarking quantum and classical heuristics for CO, with a focus on the Sherrington-Kirkpatrick problem. Whereas hope remains that a quadratic quantum advantage is possible, our numerical analysis casts doubt on the idea that current methods exhibit any quantum advantage at all. This doubt arises because even a simple classical approach can match with quantum methods we investigated. We conclude that more careful numerical investigations are needed to evaluate the potential for quantum advantage in CO, and we give some possible future directions for such investigations.
The difficulty of simulating quantum systems, well known to quantum chemists, prompted the idea of quantum computation. One can avoid the steep scaling associated with the exact simulation of increasingly large quantum systems on conventional computers, by mapping the quantum system to another, more controllable one. In this review, we discuss to what extent the ideas in quantum computation, now a well-established field, have been applied to chemical problems. We describe algorithms that achieve significant advantages for the electronic-structure problem, the simulation of chemical dynamics, protein folding, and other tasks. Although theory is still ahead of experiment, we outline recent advances that have led to the first chemical calculations on small quantum information processors.
As the year-to-year gains in speeds of classical computers continue to taper off, computational chemists are increasingly examining quantum computing as a possible route to achieve greater computational performance. Quantum computers, built upon the properties of superposition, interference, and entanglement of quantum bits, offer, in principle, the possibility to outperform classical computers for solving many important classes of problems. In the field of chemistry, quantum algorithm development offers promising propositions for solving classically intractable problems in areas such as electronic structure, chemical quantum dynamics, spectroscopy, and cheminformatics. However, physical implementations of quantum computers are still in their infancy and have yet to outperform classical computers for useful computations. Still, quantum software development for chemistry is a highly active area of research. In this perspective, we summarize recent progress in the areas of quantum computing algorithms, hardware, and software, and we describe the challenges that remain for useful implementations of quantum computing for chemical applications.