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:2508.05390 · Digital Discovery

Quantum state preparation of multiconfigurational states for quantum chemistry

Gabriel Greene‐Diniz, Georgia Prokopiou, David Zsolt Manrique, David Muñoz Ramo

Published Dec 12, 2025• 1 citation
arXivHTMLPDF

Abstract

The ability to prepare states for quantum chemistry is a promising feature of quantum computers, and efficient techniques for chemical state preparation is an active area of research.
DOI
10.1039/d5dd00350d

Related papers

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,560 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•42 citations

Quantum Computing Beyond Ground-State Electronic Structure: A Review of Progress Toward Quantum Chemistry Out of the Ground State

Alan Bidart, Prateek Vaish, Tilas Kabengele +3 more

Quantum computing offers the promise of revolutionizing quantum chemistry by enabling the solution of chemical problems for substantially less computational cost. While most demonstrations of quantum computation to date have focused on resolving the energies of the electronic ground states of small molecules, the field of quantum chemistry is far broader than ground-state chemistry; equally important to practicing chemists are chemical reaction dynamics and reaction mechanism prediction. Here, we review progress toward and the potential of quantum computation for understanding quantum chemistry beyond the ground state, including for reaction mechanisms, reaction dynamics, and finite-temperature quantum chemistry. We discuss algorithmic and other considerations these applications share, as well as differences that make them unique. We also highlight the potential speedups these applications may realize and challenges they may face. We hope that this discussion stimulates further research into how quantum computation may better inform experimental chemistry in the future.

arXiv:2509.19709•Annual Review of Physical Chemistry•Feb 27, 2026•3 citations

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•253 citations

Chemically motivated simulation problems are efficiently solvable on a quantum computer

Philipp Schleich, Lasse Bjørn Kristensen, Jorge A. Campos-Gonzalez-Angulo +6 more

Preparing molecular states for chemical simulations by circumventing the need for ground-state preparation through scattering constituents.

Digital Discovery•Nov 27, 2025•2 citations

State Preparation in Quantum Algorithms for Fragment-Based Quantum Chemistry

Ruhee D’Cunha, Matthew Otten, Matthew R. Hermes +2 more

State preparation for quantum algorithms is crucial for achieving high accuracy in quantum chemistry and competing with classical algorithms. The localized active space-unitary coupled cluster (LAS-UCC) algorithm iteratively loads a fragment-based multireference wave function onto a quantum computer. In this study, we compare two state preparation methods, quantum phase estimation (QPE) and direct initialization (DI), for each fragment. We test the two state preparation methods on three systems, ranging from a model system, a set of interacting hydrogen molecules, to more realistic chemical problems, like the C-C double bond breaking in transbutadiene and the spin ladder in a bimetallic system. We analyze the impact of QPE parameters, such as the number of ancilla qubits and Trotter steps, on the prepared state. We find a trade-off between the methods, where DI requires fewer resources for smaller fragments, while QPE is more efficient for larger fragments. Our resource estimates highlight the benefits of system fragmentation in state preparation for subsequent quantum chemical calculations. These findings have broad applications for preparing multireference quantum chemical wave functions on quantum circuits that can be used for realistic chemical applications.

arXiv:2305.18110•Journal of Chemical Theory and Computation•Apr 12, 2024•16 citations
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.
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.
Quantum computing offers the promise of revolutionizing quantum chemistry by enabling the solution of chemical problems for substantially less computational cost. While most demonstrations of quantum computation to date have focused on resolving the energies of the electronic ground states of small molecules, the field of quantum chemistry is far broader than ground-state chemistry; equally important to practicing chemists are chemical reaction dynamics and reaction mechanism prediction. Here, we review progress toward and the potential of quantum computation for understanding quantum chemistry beyond the ground state, including for reaction mechanisms, reaction dynamics, and finite-temperature quantum chemistry. We discuss algorithmic and other considerations these applications share, as well as differences that make them unique. We also highlight the potential speedups these applications may realize and challenges they may face. We hope that this discussion stimulates further research into how quantum computation may better inform experimental chemistry in the future.
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.
State preparation for quantum algorithms is crucial for achieving high accuracy in quantum chemistry and competing with classical algorithms. The localized active space-unitary coupled cluster (LAS-UCC) algorithm iteratively loads a fragment-based multireference wave function onto a quantum computer. In this study, we compare two state preparation methods, quantum phase estimation (QPE) and direct initialization (DI), for each fragment. We test the two state preparation methods on three systems, ranging from a model system, a set of interacting hydrogen molecules, to more realistic chemical problems, like the C-C double bond breaking in transbutadiene and the spin ladder in a bimetallic system. We analyze the impact of QPE parameters, such as the number of ancilla qubits and Trotter steps, on the prepared state. We find a trade-off between the methods, where DI requires fewer resources for smaller fragments, while QPE is more efficient for larger fragments. Our resource estimates highlight the benefits of system fragmentation in state preparation for subsequent quantum chemical calculations. These findings have broad applications for preparing multireference quantum chemical wave functions on quantum circuits that can be used for realistic chemical applications.