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:1502.03771

Unified views of quantum simulation algorithms for chemistry

James Daniel Whitfield

Published Feb 12, 2015• 13 citations
arXivHTMLPDF

Abstract

Time evolution of quantum systems is of interest in physics, in chemistry, and, more recently, in computer science. Quantum computers are suggested as one route to propagating quantum systems far more efficiently than ordinary numerical methods. In the past few years, researchers have actively been improving quantum simulation algorithms, especially those in second quantization. This work continues to advance the state-of-the-art by unifying several diverging approaches under a common framework. In particular, it highlights the similarities and differences of the first and second quantized algorithms which are usually presented in a distinct fashion. By combining aspects of the two approaches, this work moves towards an online second quantized algorithm operating within a single-Fock space. This paper also unifies a host of approaches to algorithmic quantum measurement by removing superficial differences. The aim of the effort is not only to give a high-level understanding of quantum simulation, but to move towards experimentally realizable algorithms with practical applications in chemistry and beyond.

DOI
10.48550/arxiv.1502.03771

Related papers

Using Quantum Computers for Quantum Simulation

Katherine L. Brown, William J. Munro, Vivien M. Kendon

Numerical simulation of quantum systems is crucial to further our understanding of natural phenomena. Many systems of key interest and importance, in areas such as superconducting materials and quantum chemistry, are thought to be described by models which we cannot solve with sufficient accuracy, neither analytically nor numerically with classical computers. Using a quantum computer to simulate such quantum systems has been viewed as a key application of quantum computation from the very beginning of the field in the 1980s. Moreover, useful results beyond the reach of classical computation are expected to be accessible with fewer than a hundred qubits, making quantum simulation potentially one of the earliest practical applications of quantum computers. In this paper we survey the theoretical and experimental development of quantum simulation using quantum computers, from the first ideas to the intense research efforts currently underway.

arXiv:1004.5528•Entropy•Nov 15, 2010•164 citations

End-to-End Simulation of Chemical Dynamics on a Quantum Computer

Elliot C. Eklund, Arkin Tikku, Patrick Sinnott +4 more

Simulations of chemical dynamics are a powerful means for understanding chemistry. However, classical computers struggle to simulate many chemical processes, especially non-adiabatic ones, where the Born-Oppenheimer approximation breaks down. Quantum computers could simulate quantum-chemical dynamics more efficiently than classical computers, but there is currently no complete quantum algorithm for calculating dynamical observables to within a known error. Here, we develop an efficient, end-to-end quantum algorithm for simulating chemical dynamics that avoids all uncontrolled approximations (including the Born-Oppenheimer approximation) and whose error is bounded subject to mild assumptions. To do so, we treat the nuclei and the electrons on an equal footing and simulate the full molecular wavefunction on a momentum-space grid in first quantization, including all algorithmic steps: initial-state preparation, time evolution using qubitization, and measurement of chemical observables such as reaction yields and rates. Our work gives the first algorithm for quantum simulation of chemistry whose end-to-end complexity achieves sublinear scaling in the size of the grid. We achieve this by developing an exponentially faster method for initial-state-preparation. Photochemistry is a likely early application of our algorithm and we estimate resources required for end-to-end simulations of non-adiabatic dynamics of atmospherically important molecules. Classically intractable photochemical computations could be performed using resources comparable to those required for other chemical applications of quantum computing.

quant-pharXiv:2603.19007•Mar 20, 2026•10 citations

Quantum Measurement for Quantum Chemistry on a Quantum Computer

Smik Patel, Praveen Jayakumar, Tzu-Ching Yen +1 more

Quantum chemistry is among the most promising applications of quantum computing, offering the potential to solve complex electronic structure problems more efficiently than classical approaches. A critical component of any quantum algorithm is the measurement step, where the desired properties are extracted from a quantum computer. This review focuses on recent advancements in quantum measurement techniques tailored for quantum chemistry, particularly within the second quantized framework suitable for current and near-term quantum hardware. We provide a comprehensive overview of measurement strategies developed primarily for the Variational Quantum Eigensolver (VQE) and its derivatives. These strategies address the inherent challenges posed by the complexity of the electronic Hamiltonian operator. Additionally, we examine methods for estimating excited states and one- and two-electron properties, extending the applicability of quantum algorithms to broader chemical phenomena. Key aspects of the review include approaches for constructing measurement operators with reduced classical preprocessing and quantum implementation costs, techniques to minimize the number of measurements required for a given accuracy, and error mitigation strategies that leverage symmetries and other properties of the measurement operators. Furthermore, we explore measurement schemes rooted in Quantum Phase Estimation (QPE), which are expected to become viable with the advent of fault-tolerant quantum computing. This review emphasizes foundational concepts and methodologies rather than numerical benchmarks, serving as a resource for researchers aiming to enhance the efficiency and accuracy of quantum measurements in quantum chemistry.

arXiv:2501.14968•Chemical Reviews•Jul 21, 2025•36 citations

Quantum simulations of chemistry in first quantization with any basis set

Timothy N. Georges, Marius Bothe, Christoph Sünderhauf +3 more

Quantum computation of the energy of molecules and materials is one of the most promising applications of fault-tolerant quantum computers. Practical applications require development of quantum algorithms with reduced resource requirements. Previous work has mainly focused on quantum algorithms where the Hamiltonian is represented in second quantization with compact basis sets while existing methods in first quantization are limited to a grid-based basis. In this work, we present a new method to solve the generic ground-state chemistry problem in first quantization using any basis set. We achieve asymptotic speedup in Toffoli count for molecular orbitals, and orders of magnitude improvement using dual plane waves as compared to the second quantization counterparts. In some instances, our approach provides similar or even lower resources compared to previous first quantization plane wave algorithms that, unlike our approach, avoids the loading of the classical data. The developed methodology can be applied to variety of applications, where the matrix elements of a first quantized Hamiltonian lack simple circuit representation.

arXiv:2408.03145•npj Quantum Information•Apr 1, 2025•33 citations

Molecular Quantum Dynamics: A Quantum Computing Perspective

Pauline J. Ollitrault, Alexander Miessen, Ivano Tavernelli

ConspectusSimulating molecular dynamics (MD) within a comprehensive quantum framework has been a long-standing challenge in computational chemistry. An exponential scaling of computational cost renders solving the time dependent Schrödinger equation (TDSE) of a molecular Hamiltonian, including both electronic and nuclear degrees of freedom (DOFs), as well as their couplings, infeasible for more than a few DOFs. In the Born-Oppenheimer (BO), or adiabatic, picture, electronic and nuclear parts of the wave function are decoupled and treated separately. Within this framework, the nuclear wave function evolves along potential energy surfaces (PESs) computed as solutions to the electronic Schrödinger equation parametrized in the nuclear DOFs. This approximation, together with increasingly elaborate numerical approaches to solve the nuclear time dependent Schrödinger equation (TDSE), enabled the treatment of up to a few dozens of degrees of freedom (DOFs). However, for particular applications, such as photochemistry, the BO approximation breaks down. In this regime of non-adiabatic dynamics, solving the full molecular problem including electron-nuclear couplings becomes essential, further increasing the complexity of the numerical solution. Although valuable methods such as multiconfigurational time-dependent Hartree (MCTDH) have been proposed for the solution of the coupled electron-nuclear dynamics, they remain hampered by an exponential scaling in the number of nuclear DOFs and by the difficulty of finding universal variational forms.In this Account, we present a perspective on novel quantum computational algorithms, aiming to alleviate the exponential scaling inherent to the simulation of many-body quantum dynamics. In particular, we focus on the derivation and application of quantum algorithms for adiabatic and non-adiabatic quantum dynamics, which include efficient approaches for the calculation of the BO potential energy surfaces (PESs). Thereafter, we study the time-evolution of a model system consisting of two coupled PESs in first and second quantization. In a first application, we discuss a recently introduced quantum algorithm for the evolution of a wavepacket in first quantization and exploit the potential quantum advantage of mapping its spatial grid representation to logarithmically many qubits. For the second demonstration, we move to the second quantization framework and review the scaling properties of two alternative time-evolution algorithms, namely, a variational quantum algorithm (VQA) (based on the McLachlan variational principle) and conventional Trotter-type evolution (based on a Lie-Trotter-Suzuki formula). Both methods clearly demonstrate the potential of quantum algorithms and their favorable scaling compared to the available classical approaches. However, a clear demonstration of quantum advantage in the context of molecular quantum dynamics may require the implementation of these algorithms in fault-tolerant quantum computers, while their application in near-term, noisy quantum devices is still unclear and deserves further investigation.

Accounts of Chemical Research•Nov 17, 2021•127 citations

Optimization algorithms benchmarking and intra-architecture gate mapping studies for the variational quantum eigensolver

Fotios Gkritsis

The advancements in classical computational components such as CPUs and GPUs have had a reverberating impact on the democratization of computational power available, with the field of computational chemistry reaping significant benefits from the propulsion of the limits of systems studied. The accurate prediction of chemical properties and reaction dynamics through computational simulation is now a centerpiece of modern chemical research, significantly accelerating discoveries research areas of materials science and drug development, as well as industrially relevant processes such as the emission of aldehydes from soft foams, flame retardants and pyrolysis and the carbonylation of epoxides. These achievements of computational chemistry still are overshadowed in the face of fundamental bottlenecks where classical methods remain constrained by the exponential scaling when treating large and/or strongly correlated quantum many-body systems. This innate computational complexity often constitutes chemically accurate calculations based on first principles impractical, or plain impossible, for systems beyond modest sizes. Quantum computing offers a potential pathway around these limitations, originally formally formulated by David Deutsch as a tool for simulating quantum systems, with the first quantum algorithms indicating speed-ups compared to classical counterparts arising from Peter Shor and Lov Grover for the prime factorization of an integer number and unstructured search respectively. Relying on fundamental theorems by Claude Shannon, it has been demonstrated that through the use of error-correcting codes fault-tolerant quantum computers are able to safeguard information against noise and decoherence, strongly indicating towards exponential speedups in solving central computational chemistry problems, such as determining ground state energies or reaction pathways of chemical systems. Substantial strides in experimental quantum computing over the past decade, including proof-of-principle demonstrations of quantum error correction, mean to bring full-scale fault-tolerant quantum computing within the grasp of humanity. The breakthroughs needed to attain scalable, error-corrected quantum computation with capabilities exceeding those of classical methods in real-world scenarios is likely still some years away. While striving to address the engineering challenges standing in the way of achieving fault tolerant quantum computing, substantial effort has been focused toward developing and benchmarking hybrid algorithms tailored for the Noisy Intermediate- Scale Quantum (NISQ) devices, available now to researchers. These hybrid quantum-classical algorithms, with the most notable being the Variational Quantum Eigensolver (VQE), allow the probing of quantum computing’s utility in computational chemistry even in the face of significant hardware noise and limited coherence times. The work presented in this thesis introduces several key additions the VQE framework, geared especially towards to NISQ hardware, where the mindful use of available resources is imperative. First, the implementation of the Conjugate Model Search optimizer is described, an optimization method that integrates simple models that are surrogate to the original function, combined with conjugate gradient optimization to navigate effectively parameter landscapes typical of variational algorithms, prone to noise. Second, this thesis contains the proposal and extensive study of a hyperparameter tuning procedure employing genetic algorithms, allowing for comprehensive simulation benchmarks that augment the robustness and efficiency of VQE implementations with respect to convergence time through real wall-time models of quantum processors. Continuing, a bridge is presented between quantum simulation and quantum chemistry, through qubit-to-fermion mappings of existing quantum gates, further enabling the direct and accurate modeling of chemical systems on trapped atom quantum hardware with the added arsenal provided by techniques designed for qubit architectures. Additionally, experimental data contained in this thesis include detailed benchmarking data collected from state-of-the-art trapped ion quantum processors available at the Johannes Gutenberg Universität Mainz, demonstrating the actual viability and performance of various methodologies for extracting results. Lastly, the state of VQE is examined, as it served as a springboard for a plethora of advancements in the development of quantum computing hardware, as well as the direction the field of simulation of computational quantum chemistry via quantum devices is headed towards in the coming years.

•Jan 1, 2026•0 citations
Time evolution of quantum systems is of interest in physics, in chemistry, and, more recently, in computer science. Quantum computers are suggested as one route to propagating quantum systems far more efficiently than ordinary numerical methods. In the past few years, researchers have actively been improving quantum simulation algorithms, especially those in second quantization. This work continues to advance the state-of-the-art by unifying several diverging approaches under a common framework. In particular, it highlights the similarities and differences of the first and second quantized algorithms which are usually presented in a distinct fashion. By combining aspects of the two approaches, this work moves towards an online second quantized algorithm operating within a single-Fock space. This paper also unifies a host of approaches to algorithmic quantum measurement by removing superficial differences. The aim of the effort is not only to give a high-level understanding of quantum simulation, but to move towards experimentally realizable algorithms with practical applications in chemistry and beyond.
Numerical simulation of quantum systems is crucial to further our understanding of natural phenomena. Many systems of key interest and importance, in areas such as superconducting materials and quantum chemistry, are thought to be described by models which we cannot solve with sufficient accuracy, neither analytically nor numerically with classical computers. Using a quantum computer to simulate such quantum systems has been viewed as a key application of quantum computation from the very beginning of the field in the 1980s. Moreover, useful results beyond the reach of classical computation are expected to be accessible with fewer than a hundred qubits, making quantum simulation potentially one of the earliest practical applications of quantum computers. In this paper we survey the theoretical and experimental development of quantum simulation using quantum computers, from the first ideas to the intense research efforts currently underway.
Simulations of chemical dynamics are a powerful means for understanding chemistry. However, classical computers struggle to simulate many chemical processes, especially non-adiabatic ones, where the Born-Oppenheimer approximation breaks down. Quantum computers could simulate quantum-chemical dynamics more efficiently than classical computers, but there is currently no complete quantum algorithm for calculating dynamical observables to within a known error. Here, we develop an efficient, end-to-end quantum algorithm for simulating chemical dynamics that avoids all uncontrolled approximations (including the Born-Oppenheimer approximation) and whose error is bounded subject to mild assumptions. To do so, we treat the nuclei and the electrons on an equal footing and simulate the full molecular wavefunction on a momentum-space grid in first quantization, including all algorithmic steps: initial-state preparation, time evolution using qubitization, and measurement of chemical observables such as reaction yields and rates. Our work gives the first algorithm for quantum simulation of chemistry whose end-to-end complexity achieves sublinear scaling in the size of the grid. We achieve this by developing an exponentially faster method for initial-state-preparation. Photochemistry is a likely early application of our algorithm and we estimate resources required for end-to-end simulations of non-adiabatic dynamics of atmospherically important molecules. Classically intractable photochemical computations could be performed using resources comparable to those required for other chemical applications of quantum computing.
Quantum chemistry is among the most promising applications of quantum computing, offering the potential to solve complex electronic structure problems more efficiently than classical approaches. A critical component of any quantum algorithm is the measurement step, where the desired properties are extracted from a quantum computer. This review focuses on recent advancements in quantum measurement techniques tailored for quantum chemistry, particularly within the second quantized framework suitable for current and near-term quantum hardware. We provide a comprehensive overview of measurement strategies developed primarily for the Variational Quantum Eigensolver (VQE) and its derivatives. These strategies address the inherent challenges posed by the complexity of the electronic Hamiltonian operator. Additionally, we examine methods for estimating excited states and one- and two-electron properties, extending the applicability of quantum algorithms to broader chemical phenomena. Key aspects of the review include approaches for constructing measurement operators with reduced classical preprocessing and quantum implementation costs, techniques to minimize the number of measurements required for a given accuracy, and error mitigation strategies that leverage symmetries and other properties of the measurement operators. Furthermore, we explore measurement schemes rooted in Quantum Phase Estimation (QPE), which are expected to become viable with the advent of fault-tolerant quantum computing. This review emphasizes foundational concepts and methodologies rather than numerical benchmarks, serving as a resource for researchers aiming to enhance the efficiency and accuracy of quantum measurements in quantum chemistry.
Quantum computation of the energy of molecules and materials is one of the most promising applications of fault-tolerant quantum computers. Practical applications require development of quantum algorithms with reduced resource requirements. Previous work has mainly focused on quantum algorithms where the Hamiltonian is represented in second quantization with compact basis sets while existing methods in first quantization are limited to a grid-based basis. In this work, we present a new method to solve the generic ground-state chemistry problem in first quantization using any basis set. We achieve asymptotic speedup in Toffoli count for molecular orbitals, and orders of magnitude improvement using dual plane waves as compared to the second quantization counterparts. In some instances, our approach provides similar or even lower resources compared to previous first quantization plane wave algorithms that, unlike our approach, avoids the loading of the classical data. The developed methodology can be applied to variety of applications, where the matrix elements of a first quantized Hamiltonian lack simple circuit representation.
ConspectusSimulating molecular dynamics (MD) within a comprehensive quantum framework has been a long-standing challenge in computational chemistry. An exponential scaling of computational cost renders solving the time dependent Schrödinger equation (TDSE) of a molecular Hamiltonian, including both electronic and nuclear degrees of freedom (DOFs), as well as their couplings, infeasible for more than a few DOFs. In the Born-Oppenheimer (BO), or adiabatic, picture, electronic and nuclear parts of the wave function are decoupled and treated separately. Within this framework, the nuclear wave function evolves along potential energy surfaces (PESs) computed as solutions to the electronic Schrödinger equation parametrized in the nuclear DOFs. This approximation, together with increasingly elaborate numerical approaches to solve the nuclear time dependent Schrödinger equation (TDSE), enabled the treatment of up to a few dozens of degrees of freedom (DOFs). However, for particular applications, such as photochemistry, the BO approximation breaks down. In this regime of non-adiabatic dynamics, solving the full molecular problem including electron-nuclear couplings becomes essential, further increasing the complexity of the numerical solution. Although valuable methods such as multiconfigurational time-dependent Hartree (MCTDH) have been proposed for the solution of the coupled electron-nuclear dynamics, they remain hampered by an exponential scaling in the number of nuclear DOFs and by the difficulty of finding universal variational forms.In this Account, we present a perspective on novel quantum computational algorithms, aiming to alleviate the exponential scaling inherent to the simulation of many-body quantum dynamics. In particular, we focus on the derivation and application of quantum algorithms for adiabatic and non-adiabatic quantum dynamics, which include efficient approaches for the calculation of the BO potential energy surfaces (PESs). Thereafter, we study the time-evolution of a model system consisting of two coupled PESs in first and second quantization. In a first application, we discuss a recently introduced quantum algorithm for the evolution of a wavepacket in first quantization and exploit the potential quantum advantage of mapping its spatial grid representation to logarithmically many qubits. For the second demonstration, we move to the second quantization framework and review the scaling properties of two alternative time-evolution algorithms, namely, a variational quantum algorithm (VQA) (based on the McLachlan variational principle) and conventional Trotter-type evolution (based on a Lie-Trotter-Suzuki formula). Both methods clearly demonstrate the potential of quantum algorithms and their favorable scaling compared to the available classical approaches. However, a clear demonstration of quantum advantage in the context of molecular quantum dynamics may require the implementation of these algorithms in fault-tolerant quantum computers, while their application in near-term, noisy quantum devices is still unclear and deserves further investigation.
The advancements in classical computational components such as CPUs and GPUs have had a reverberating impact on the democratization of computational power available, with the field of computational chemistry reaping significant benefits from the propulsion of the limits of systems studied. The accurate prediction of chemical properties and reaction dynamics through computational simulation is now a centerpiece of modern chemical research, significantly accelerating discoveries research areas of materials science and drug development, as well as industrially relevant processes such as the emission of aldehydes from soft foams, flame retardants and pyrolysis and the carbonylation of epoxides. These achievements of computational chemistry still are overshadowed in the face of fundamental bottlenecks where classical methods remain constrained by the exponential scaling when treating large and/or strongly correlated quantum many-body systems. This innate computational complexity often constitutes chemically accurate calculations based on first principles impractical, or plain impossible, for systems beyond modest sizes. Quantum computing offers a potential pathway around these limitations, originally formally formulated by David Deutsch as a tool for simulating quantum systems, with the first quantum algorithms indicating speed-ups compared to classical counterparts arising from Peter Shor and Lov Grover for the prime factorization of an integer number and unstructured search respectively. Relying on fundamental theorems by Claude Shannon, it has been demonstrated that through the use of error-correcting codes fault-tolerant quantum computers are able to safeguard information against noise and decoherence, strongly indicating towards exponential speedups in solving central computational chemistry problems, such as determining ground state energies or reaction pathways of chemical systems. Substantial strides in experimental quantum computing over the past decade, including proof-of-principle demonstrations of quantum error correction, mean to bring full-scale fault-tolerant quantum computing within the grasp of humanity. The breakthroughs needed to attain scalable, error-corrected quantum computation with capabilities exceeding those of classical methods in real-world scenarios is likely still some years away. While striving to address the engineering challenges standing in the way of achieving fault tolerant quantum computing, substantial effort has been focused toward developing and benchmarking hybrid algorithms tailored for the Noisy Intermediate- Scale Quantum (NISQ) devices, available now to researchers. These hybrid quantum-classical algorithms, with the most notable being the Variational Quantum Eigensolver (VQE), allow the probing of quantum computing’s utility in computational chemistry even in the face of significant hardware noise and limited coherence times. The work presented in this thesis introduces several key additions the VQE framework, geared especially towards to NISQ hardware, where the mindful use of available resources is imperative. First, the implementation of the Conjugate Model Search optimizer is described, an optimization method that integrates simple models that are surrogate to the original function, combined with conjugate gradient optimization to navigate effectively parameter landscapes typical of variational algorithms, prone to noise. Second, this thesis contains the proposal and extensive study of a hyperparameter tuning procedure employing genetic algorithms, allowing for comprehensive simulation benchmarks that augment the robustness and efficiency of VQE implementations with respect to convergence time through real wall-time models of quantum processors. Continuing, a bridge is presented between quantum simulation and quantum chemistry, through qubit-to-fermion mappings of existing quantum gates, further enabling the direct and accurate modeling of chemical systems on trapped atom quantum hardware with the added arsenal provided by techniques designed for qubit architectures. Additionally, experimental data contained in this thesis include detailed benchmarking data collected from state-of-the-art trapped ion quantum processors available at the Johannes Gutenberg Universität Mainz, demonstrating the actual viability and performance of various methodologies for extracting results. Lastly, the state of VQE is examined, as it served as a springboard for a plethora of advancements in the development of quantum computing hardware, as well as the direction the field of simulation of computational quantum chemistry via quantum devices is headed towards in the coming years.