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

Chemically motivated simulation problems are efficiently solvable on a quantum computer

Philipp Schleich, Lasse Bjørn Kristensen, Jorge A. Campos-Gonzalez-Angulo, Abdulrahman Aldossary, Davide Avagliano, Mohsen Bagherimehrab, Christoph Gorgulla, Joe Fitzsimons, Alán Aspuru‐Guzik

Published Nov 27, 2025• 12 citations
arXivHTMLPDF

Abstract

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

Related papers

The Potential of Quantum Computing Algorithms for Solving Chemistry Problems

Kunhuan Liu

•Jan 1, 2017•0 citations

Quantum Algorithms for Chemistry and Differential Equations

Philipp Schleich

Quantum computers were first proposed to perform simulation -- in particular, quantum simulation. The premise is that such computers can simulate quantum dynamics exponentially faster than a classical computer. Some of the early proposals of practical applications of quantum computers come from quantum chemistry. Algorithms for more general systems, described by ordinary and partial differential equations, emerged later on. This thesis grounds on an extensive amount of prior research and proposes a set of improvements as well as new algorithms or algorithmic tools, focusing on applications from quantum chemistry and differential equations.First, we propose a technique relating to finding ground-states for electronic systems via the variational quantum eigensolver. The presented method enables solving the problem on early quantum hardware by a partitioning of the computational problem into smaller problems, using only classical resources to perform the partitioning. Next, the thesis considers simulation problems from chemistry in a more general sense. Following the idea that dynamical simulation of many chemical systems is efficient, whereas preparing ground-states is a `hard' problem, our computational framework leverages simulation routines to prepare molecular states as an input to a computation, relying only on `hard' input states for small problem instances. The preparation relies on dynamical scattering of initial fragments supported by a trap potential, allowing to estimate the success probability for certain bonds. A weak measurement scheme enables preparation of molecular states. Furthermore, this dissertation investigates quantum algorithms for differential equations. More specifically, the the Carleman linearization approach is considered to solve nonlinear differential equations. This entails bounding the Carleman truncation error, re-scaling of the solution to avoid an exponentially vanishing success probability, and discussing higher-order discretization. Moreover, this thesis introduced a penalty-based method to enforce constraints on the solution of differential equations, with inspiration from complex absorbing potentials and the quantum Zeno effect. We bound the approximation errors and embed the penalty method into an efficient quantum algorithm, with computational overhead only logarithmic in the penalty's strength. Efficiency is enabled by an interaction-picture approach with fast-forwardable constraint projections.

•Oct 1, 2025•0 citations

Quantum algorithms for simulation of quantum chemistry problems by quantum computers: an appraisal

Smriti Sharma

Foundations of Chemistry•May 15, 2022•4 citations

Fast-forwarding molecular ground state preparation with optimal control on analog quantum simulators

Davide Castaldo, Marta Rosa, Stefano Corni

We show that optimal control of the electron dynamics is able to prepare molecular ground states, within chemical accuracy, with evolution times approaching the bounds imposed by quantum mechanics. We propose a specific parameterization of the molecular evolution only in terms of interaction already present in the molecular Hamiltonian. Thus, the proposed method solely utilizes quantum simulation routines, retaining their favorable scalings. Due to the intimate relationships between variational quantum algorithms and optimal control, we compare, when possible, our results with state-of-the-art methods in the literature. We found that the number of parameters needed to reach chemical accuracy and algorithmic scaling is in line with compact adaptive strategies to build variational Ansätze. The algorithm, which is also suitable for quantum simulators, is implemented by emulating a digital quantum processor (up to 16 qubits) and tested on different molecules and geometries spanning different degrees of electron correlation.

arXiv:2402.11667•The Journal of Chemical Physics•Jul 1, 2024•0 citations

Advancing Practical Quantum Embedding Simulations via Operator Commutativity Based State Preparation for Complex Chemical Systems

Dibyendu Mondal, Ashish Kumar Patra, Rahul Maitra

Determining the exponentially scaled ground state wavefunction and the associated molecular properties remains one of the central challenges in quantum chemistry. Hybrid quantum-classical algorithms implemented on quantum computers offer a promising route toward addressing this problem. However, despite several successful demonstrations on small molecular systems, accurate simulations of large and chemically realistic molecules remain difficult due to the limited capability of noisy intermediate scale quantum (NISQ) hardware. To bypass the limitations of NISQ devices, while simultaneously retaining the accuracy of the ground state energy estimations, we propose a dynamic ansatz construction strategy based on operator commutativity and energy driven screening within density matrix embedding theory (DMET) framework. The partitioning of the full system allows us to dynamically construct the ansatz over individual embedded subsystems, allowing each embedding problem be solved individually to a desired accuracy. The embedding Hamiltonian is updated in a self-consistent manner with dynamically formulated wavefunction, and their coupled optimization leads to accurate and efficient description of the overall system. To assess the performance of this approach, we apply it to several molecular systems and chemical processes with up to 144 qubits. These simulations require at most 20 qubits at a time and demonstrate improved accuracy and significantly reduced quantum gate requirements compared with conventional ansatze. We further investigate the impact of various fragmentation strategies and demonstrate the adaptability of our approach at each step of the DMET self-consistency cycle that leads to significantly improved accuracy for strongly correlated system.

quant-pharXiv:2604.19470•Chemical Science•Apr 22, 2026•0 citations

Quantum chemical calculations by the real quantum computer

Takumi Kato, Koji Okuwaki, Yuji Mochizuki +2 more

The Japan Society of Applied Physics•Jul 6, 2021•0 citations
Quantum computers were first proposed to perform simulation -- in particular, quantum simulation. The premise is that such computers can simulate quantum dynamics exponentially faster than a classical computer. Some of the early proposals of practical applications of quantum computers come from quantum chemistry. Algorithms for more general systems, described by ordinary and partial differential equations, emerged later on. This thesis grounds on an extensive amount of prior research and proposes a set of improvements as well as new algorithms or algorithmic tools, focusing on applications from quantum chemistry and differential equations.First, we propose a technique relating to finding ground-states for electronic systems via the variational quantum eigensolver. The presented method enables solving the problem on early quantum hardware by a partitioning of the computational problem into smaller problems, using only classical resources to perform the partitioning. Next, the thesis considers simulation problems from chemistry in a more general sense. Following the idea that dynamical simulation of many chemical systems is efficient, whereas preparing ground-states is a `hard' problem, our computational framework leverages simulation routines to prepare molecular states as an input to a computation, relying only on `hard' input states for small problem instances. The preparation relies on dynamical scattering of initial fragments supported by a trap potential, allowing to estimate the success probability for certain bonds. A weak measurement scheme enables preparation of molecular states. Furthermore, this dissertation investigates quantum algorithms for differential equations. More specifically, the the Carleman linearization approach is considered to solve nonlinear differential equations. This entails bounding the Carleman truncation error, re-scaling of the solution to avoid an exponentially vanishing success probability, and discussing higher-order discretization. Moreover, this thesis introduced a penalty-based method to enforce constraints on the solution of differential equations, with inspiration from complex absorbing potentials and the quantum Zeno effect. We bound the approximation errors and embed the penalty method into an efficient quantum algorithm, with computational overhead only logarithmic in the penalty's strength. Efficiency is enabled by an interaction-picture approach with fast-forwardable constraint projections.
We show that optimal control of the electron dynamics is able to prepare molecular ground states, within chemical accuracy, with evolution times approaching the bounds imposed by quantum mechanics. We propose a specific parameterization of the molecular evolution only in terms of interaction already present in the molecular Hamiltonian. Thus, the proposed method solely utilizes quantum simulation routines, retaining their favorable scalings. Due to the intimate relationships between variational quantum algorithms and optimal control, we compare, when possible, our results with state-of-the-art methods in the literature. We found that the number of parameters needed to reach chemical accuracy and algorithmic scaling is in line with compact adaptive strategies to build variational Ansätze. The algorithm, which is also suitable for quantum simulators, is implemented by emulating a digital quantum processor (up to 16 qubits) and tested on different molecules and geometries spanning different degrees of electron correlation.
Determining the exponentially scaled ground state wavefunction and the associated molecular properties remains one of the central challenges in quantum chemistry. Hybrid quantum-classical algorithms implemented on quantum computers offer a promising route toward addressing this problem. However, despite several successful demonstrations on small molecular systems, accurate simulations of large and chemically realistic molecules remain difficult due to the limited capability of noisy intermediate scale quantum (NISQ) hardware. To bypass the limitations of NISQ devices, while simultaneously retaining the accuracy of the ground state energy estimations, we propose a dynamic ansatz construction strategy based on operator commutativity and energy driven screening within density matrix embedding theory (DMET) framework. The partitioning of the full system allows us to dynamically construct the ansatz over individual embedded subsystems, allowing each embedding problem be solved individually to a desired accuracy. The embedding Hamiltonian is updated in a self-consistent manner with dynamically formulated wavefunction, and their coupled optimization leads to accurate and efficient description of the overall system. To assess the performance of this approach, we apply it to several molecular systems and chemical processes with up to 144 qubits. These simulations require at most 20 qubits at a time and demonstrate improved accuracy and significantly reduced quantum gate requirements compared with conventional ansatze. We further investigate the impact of various fragmentation strategies and demonstrate the adaptability of our approach at each step of the DMET self-consistency cycle that leads to significantly improved accuracy for strongly correlated system.