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

Journal of Computational Chemistry

Block‐adaptive quantum mechanics: An adaptive divide‐and‐conquer approach to interactive quantum chemistry

Mäel Bosson, Sergei Grudinin, Stéphane Redon

Published Oct 29, 2012• 8 citations
Publisher

Abstract

We present a novel Block-Adaptive Quantum Mechanics (BAQM) approach to interactive quantum chemistry. Although quantum chemistry models are known to be computationally demanding, we achieve interactive rates by focusing computational resources on the most active parts of the system. BAQM is based on a divide-and-conquer technique and constrains some nucleus positions and some electronic degrees of freedom on the fly to simplify the simulation. As a result, each time step may be performed significantly faster, which in turn may accelerate attraction to the neighboring local minima. By applying our approach to the nonself-consistent Atom Superposition and Electron Delocalization Molecular Orbital theory, we demonstrate interactive rates and efficient virtual prototyping for systems containing more than a thousand of atoms on a standard desktop computer.

DOI
10.1002/jcc.23157

Related papers

Interactive quantum chemistry: A divide‐and‐conquer ASED‐MO method

Mäel Bosson, Caroline Richard, Antoine Plet +2 more

We present interactive quantum chemistry simulation at the atom superposition and electron delocalization molecular orbital (ASED-MO) level of theory. Our method is based on the divide-and-conquer (D&C) approach, which we show is accurate and efficient for this non-self-consistent semiempirical theory. The method has a linear complexity in the number of atoms, scales well with the number of cores, and has a small prefactor. The time cost is completely controllable, as all steps are performed with direct algorithms, i.e., no iterative schemes are used. We discuss the errors induced by the D&C approach, first empirically on a few examples, and then via a theoretical study of two toy models that can be analytically solved for any number of atoms. Thanks to the precision and speed of the D&C approach, we are able to demonstrate interactive quantum chemistry simulations for systems up to a few hundred atoms on a current multicore desktop computer. When drawing and editing molecular systems, interactive simulations provide immediate, intuitive feedback on chemical structures. As the number of cores on personal computers increases, and larger and larger systems can be dealt with, we believe such interactive simulations-even at lower levels of theory-should thus prove most useful to effectively understand, design and prototype molecules, devices and materials.

Journal of Computational Chemistry•Jan 7, 2012•30 citations

Divide-and-conquer variational quantum algorithms for large-scale electronic structure simulations

Ma, Huan, Yi Fan, Jie Liu +3 more

Exploring the potential application of quantum computers in material design and drug discovery has attracted a lot of interest in the age of quantum computing. However, the quantum resource requirement for solving practical electronic structure problems are far beyond the capacity of near-term quantum devices. In this work, we integrate the divide-and-conquer (DC) approaches into the variational quantum eigensolver (VQE) for large-scale quantum computational chemistry simulations. Two popular divide-and-conquer schemes, including many-body expansion~(MBE) fragmentation theory and density matrix embedding theory~(DMET), are employed to divide complicated problems into many small parts that are easy to implement on near-term quantum computers. Pilot applications of these methods to systems consisting of tens of atoms are performed with adaptive VQE algorithms. This work should encourage further studies of using the philosophy of DC to solve electronic structure problems on quantum computers.

arXiv:2208.14789•Aug 31, 2022•1 citation

Divide and conquer approach to quantum Hamiltonian simulation

Stuart Hadfield, Anargyros Papageorgiou

We show a divide and conquer approach for simulating quantum mechanical systems on quantum computers. We can obtain fast simulation algorithms using Hamiltonian structure. Considering a sum of Hamiltonians we split them into groups, simulate each group separately, and combine the partial results. Simulation is customized to take advantage of the properties of each group, and hence yield refined bounds to the overall simulation cost. We illustrate our results using the electronic structure problem of quantum chemistry, where we obtain significantly improved cost estimates under very mild assumptions.

New Journal of Physics•Feb 23, 2018•26 citations

Divide and conquer approach to quantum Hamiltonian simulation

Stuart Hadfield, Anargyros Papageorgiou

We show a divide and conquer approach for simulating quantum mechanical systems on quantum computers. We can obtain fast simulation algorithms using Hamiltonian structure. Considering a sum of Hamiltonians we split them into groups, simulate each group separately, and combine the partial results. Simulation is customized to take advantage of the properties of each group, and hence yield refined bounds to the overall simulation cost. We illustrate our results using the electronic structure problem of quantum chemistry, where we obtain significantly improved cost estimates under very mild assumptions.

New Journal of Physics•Jan 1, 2018•0 citations

More quantum chemistry with fewer qubits

Jakob Günther, Alberto Baiardi, Markus Reiher +1 more

Quantum computation is one of the most promising new paradigms for the simulation of physical systems composed of electrons and atomic nuclei, with applications in chemistry, solid-state physics, materials science, and molecular biology. This requires a truncated representation of the electronic structure Hamiltonian using a finite number of orbitals. While it is, in principle, obvious how to improve on the representation by including more orbitals, this is usually unfeasible in practice (e.g., because of the limited number of qubits available) and severely compromises the accuracy of the obtained results. Here, we propose a quantum algorithm that improves on the representation of the physical problem by virtue of second-order perturbation theory. In particular, our quantum algorithm evaluates the second-order energy correction through a series of time-evolution steps under the unperturbed Hamiltonian. An important application is to go beyond the active-space approximation, allowing to include corrections of virtual orbitals, known as multireference perturbation theory. Here, we exploit the fact that the unperturbed Hamiltonian is diagonal for virtual orbitals and show that the number of qubits is independent of the number of virtual orbitals. This gives rise to more accurate energy estimates without increasing the number of qubits. Moreover, we demonstrate numerically for realistic chemical systems that the total runtime has highly favorable scaling in the number of virtual orbitals compared to previous studies. Numerical calculations confirm the necessity of the multireference perturbation theory energy corrections to reach accurate ground-state energy estimates. Our perturbation theory quantum algorithm can also be applied to symmetry-adapted perturbation theory. As such, we demonstrate that perturbation theory can help to reduce the quantum hardware requirements for quantum chemistry. Published by the American Physical Society 2024

arXiv:2308.16873•Physical Review Research•Oct 7, 2024•7 citations

Adaptive Quantum Potential Model via Quantum Machine Learning

Jincheng Zhang

This paper presents an innovative quantum machine learning model, termed the Adaptive Quantum Potential Model (AQPM), designed to accelerate and enhance quantum chemical simulations. Traditional quantum chemistry relies heavily on precise, handcrafted quantum potential functions, limiting the model's applicability and hindering the ability to accurately predict molecular properties. This work proposes a novel approach utilizing a dynamically adjusted quantum potential landscape, achieved through a quantum machine learning framework, to represent and learn these functions. The AQPM leverages quantum superposition and entanglement to enhance the model's ability to capture subtle correlations within molecular systems, leading to improved accuracy and efficiency in molecular modeling and quantum simulation. This advancement promises to significantly broaden the scope and capabilities of quantum chemistry, particularly in areas demanding high-fidelity simulations and molecular design.

•Sep 3, 2026•0 citations
We present a novel Block-Adaptive Quantum Mechanics (BAQM) approach to interactive quantum chemistry. Although quantum chemistry models are known to be computationally demanding, we achieve interactive rates by focusing computational resources on the most active parts of the system. BAQM is based on a divide-and-conquer technique and constrains some nucleus positions and some electronic degrees of freedom on the fly to simplify the simulation. As a result, each time step may be performed significantly faster, which in turn may accelerate attraction to the neighboring local minima. By applying our approach to the nonself-consistent Atom Superposition and Electron Delocalization Molecular Orbital theory, we demonstrate interactive rates and efficient virtual prototyping for systems containing more than a thousand of atoms on a standard desktop computer.
We present interactive quantum chemistry simulation at the atom superposition and electron delocalization molecular orbital (ASED-MO) level of theory. Our method is based on the divide-and-conquer (D&C) approach, which we show is accurate and efficient for this non-self-consistent semiempirical theory. The method has a linear complexity in the number of atoms, scales well with the number of cores, and has a small prefactor. The time cost is completely controllable, as all steps are performed with direct algorithms, i.e., no iterative schemes are used. We discuss the errors induced by the D&C approach, first empirically on a few examples, and then via a theoretical study of two toy models that can be analytically solved for any number of atoms. Thanks to the precision and speed of the D&C approach, we are able to demonstrate interactive quantum chemistry simulations for systems up to a few hundred atoms on a current multicore desktop computer. When drawing and editing molecular systems, interactive simulations provide immediate, intuitive feedback on chemical structures. As the number of cores on personal computers increases, and larger and larger systems can be dealt with, we believe such interactive simulations-even at lower levels of theory-should thus prove most useful to effectively understand, design and prototype molecules, devices and materials.
Exploring the potential application of quantum computers in material design and drug discovery has attracted a lot of interest in the age of quantum computing. However, the quantum resource requirement for solving practical electronic structure problems are far beyond the capacity of near-term quantum devices. In this work, we integrate the divide-and-conquer (DC) approaches into the variational quantum eigensolver (VQE) for large-scale quantum computational chemistry simulations. Two popular divide-and-conquer schemes, including many-body expansion~(MBE) fragmentation theory and density matrix embedding theory~(DMET), are employed to divide complicated problems into many small parts that are easy to implement on near-term quantum computers. Pilot applications of these methods to systems consisting of tens of atoms are performed with adaptive VQE algorithms. This work should encourage further studies of using the philosophy of DC to solve electronic structure problems on quantum computers.
We show a divide and conquer approach for simulating quantum mechanical systems on quantum computers. We can obtain fast simulation algorithms using Hamiltonian structure. Considering a sum of Hamiltonians we split them into groups, simulate each group separately, and combine the partial results. Simulation is customized to take advantage of the properties of each group, and hence yield refined bounds to the overall simulation cost. We illustrate our results using the electronic structure problem of quantum chemistry, where we obtain significantly improved cost estimates under very mild assumptions.
We show a divide and conquer approach for simulating quantum mechanical systems on quantum computers. We can obtain fast simulation algorithms using Hamiltonian structure. Considering a sum of Hamiltonians we split them into groups, simulate each group separately, and combine the partial results. Simulation is customized to take advantage of the properties of each group, and hence yield refined bounds to the overall simulation cost. We illustrate our results using the electronic structure problem of quantum chemistry, where we obtain significantly improved cost estimates under very mild assumptions.
Quantum computation is one of the most promising new paradigms for the simulation of physical systems composed of electrons and atomic nuclei, with applications in chemistry, solid-state physics, materials science, and molecular biology. This requires a truncated representation of the electronic structure Hamiltonian using a finite number of orbitals. While it is, in principle, obvious how to improve on the representation by including more orbitals, this is usually unfeasible in practice (e.g., because of the limited number of qubits available) and severely compromises the accuracy of the obtained results. Here, we propose a quantum algorithm that improves on the representation of the physical problem by virtue of second-order perturbation theory. In particular, our quantum algorithm evaluates the second-order energy correction through a series of time-evolution steps under the unperturbed Hamiltonian. An important application is to go beyond the active-space approximation, allowing to include corrections of virtual orbitals, known as multireference perturbation theory. Here, we exploit the fact that the unperturbed Hamiltonian is diagonal for virtual orbitals and show that the number of qubits is independent of the number of virtual orbitals. This gives rise to more accurate energy estimates without increasing the number of qubits. Moreover, we demonstrate numerically for realistic chemical systems that the total runtime has highly favorable scaling in the number of virtual orbitals compared to previous studies. Numerical calculations confirm the necessity of the multireference perturbation theory energy corrections to reach accurate ground-state energy estimates. Our perturbation theory quantum algorithm can also be applied to symmetry-adapted perturbation theory. As such, we demonstrate that perturbation theory can help to reduce the quantum hardware requirements for quantum chemistry. Published by the American Physical Society 2024
This paper presents an innovative quantum machine learning model, termed the Adaptive Quantum Potential Model (AQPM), designed to accelerate and enhance quantum chemical simulations. Traditional quantum chemistry relies heavily on precise, handcrafted quantum potential functions, limiting the model's applicability and hindering the ability to accurately predict molecular properties. This work proposes a novel approach utilizing a dynamically adjusted quantum potential landscape, achieved through a quantum machine learning framework, to represent and learn these functions. The AQPM leverages quantum superposition and entanglement to enhance the model's ability to capture subtle correlations within molecular systems, leading to improved accuracy and efficiency in molecular modeling and quantum simulation. This advancement promises to significantly broaden the scope and capabilities of quantum chemistry, particularly in areas demanding high-fidelity simulations and molecular design.