Journal of Computational Chemistry

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

Mäel Bosson, Caroline Richard, Antoine Plet, Sergei Grudinin, Stéphane Redon

Published Jan 7, 2012• 30 citations

Abstract

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.

DOI: 10.1002/jcc.22905

Related papers

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

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

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.

Journal of Computational ChemistryOct 29, 20128 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.14789Aug 31, 20221 citation

Divide-and-Conquer Linear-Scaling Quantum Chemical Computations

Hiromi Nakai, Masato Kobayashi, Takeshi Yoshikawa +3 more

Fragmentation and embedding schemes are of great importance when applying quantum-chemical calculations to more complex and attractive targets. The divide-and-conquer (DC)-based quantum-chemical model is a fragmentation scheme that can be connected to embedding schemes. This feature article explains several DC-based schemes developed by the authors over the last two decades, which was inspired by the pioneering study of DC self-consistent field (SCF) method by Yang and Lee ( J. Chem. Phys . 1995, 103, 5674–5678). First, the theoretical aspects of the DC-based SCF, electron correlation, excited-state, and nuclear orbital methods are described, followed by the two-component relativistic theory, quantum-mechanical molecular dynamics simulation, and the introduction of three programs, including DC-based schemes. Illustrative applications confirmed the accuracy and feasibility of the DC-based schemes.

The Journal of Physical Chemistry AJan 11, 202332 citations

Towards the Practical Application of Near-Term Quantum Computers in Quantum Chemistry Simulations: A Problem Decomposition Approach

Takeshi Yamazaki, Shunji Matsuura, Ali Narimani +2 more

With the aim of establishing a framework to efficiently perform the practical application of quantum chemistry simulation on near-term quantum devices, we envision a hybrid quantum--classical framework for leveraging problem decomposition (PD) techniques in quantum chemistry. Specifically, we use PD techniques to decompose a target molecular system into smaller subsystems requiring fewer computational resources. In our framework, there are two levels of hybridization. At the first level, we use a classical algorithm to decompose a target molecule into subsystems, and utilize a quantum algorithm to simulate the quantum nature of the subsystems. The second level is in the quantum algorithm. We consider the quantum--classical variational algorithm that iterates between an expectation estimation using a quantum device and a parameter optimization using a classical device. We investigate three popular PD techniques for our hybrid approach: the fragment molecular-orbital (FMO) method, the divide-and-conquer (DC) technique, and the density matrix embedding theory (DMET). We examine the efficacy of these techniques in correctly differentiating conformations of simple alkane molecules. In particular, we consider the ratio between the number of qubits for PD and that of the full system; the mean absolute deviation; and the Pearson correlation coefficient and Spearman's rank correlation coefficient. Sampling error is introduced when expectation values are measured on the quantum device. Therefore, we study how this error affects the predictive performance of PD techniques. The present study is our first step to opening up the possibility of using quantum chemistry simulations at a scale close to the size of molecules relevant to industry on near-term quantum hardware.

arXiv:1806.01305Jun 4, 201817 citations

A Review of the Role of Quantum Computing in Simulating Molecular Interaction

Ayaann Kaalra, Abhinav Srivastava, Shashank Awasthi +1 more

However, accurately simulating molecular interactions constitutes the central, but open question of computer chemistry. This is a core task for efforts in drug development, catalyst design, and materials science. Most classical algorithms perform well on smaller systems, but incumbent exponential scaling penalties are unavoidable as models grow larger and more complex to describe quantum behaviour. An entirely new paradigm for this problem is now introduced by quantum computing: superposition and entanglement resources natively encode quantum states and model their electronic structures. The paper will thus take a high-level view of the leading quantum algorithms, with particular regard to those called Variational Quantum Eigensolver (VQE) and Quantum Phase Estimation (QPE), while evaluating their performance on today's Noisy Intermediate Scale Quantum (NISQ) devices. Next will follow discussions on algorithm design and current hardware capabilities, before which open challenges on scalability, error mitigation, and algorithm design will be outlined. Emphasis shall also be placed on the ethics and accessibility issues as well as the timelines with which quantum computing might gain a practical advantage. Linking together the recent advances and limitations, this paper posits how quantum computer implementation may change the face of chemical modelling and scientific discovery.

IEEE Uttar Pradesh Section Women in Engineering International Conference on Electrical, Electronics and Computer Engineering (UPWIECON)Oct 30, 20250 citations

Faster quantum simulation of quantum chemistry with tailored algorithms and Hamiltonians

Ian Kivlichan

With quantum computers on the horizon, it is essential to understand what problems they can be used to solve. One potential application is simulating quantum systems, in particular, systems with many interacting electrons. However, there is a disparity between the computational resources required to study these problems and the capabilities of modern experimental quantum devices. In this thesis, we make progress toward closing this gap by reducing the cost of quantum simulation of quantum chemistry on a number of fronts. In the first half, we develop three improved quantum simulation algorithms by approximating time evolution under the Hamiltonian using a truncated Taylor series rather than the Trotter-Suzuki decomposition. We do this first for the molecular electronic structure Hamiltonian in two representations, obtaining asymptotic improvements in terms of both the number of orbitals and the required precision. We also apply the truncated Taylor series paradigm to quantum simulation in real space, where we consider simulation of general wave functions discretized on a uniform grid. In the second half, by working with Hamiltonians tailored specifically to quantum algorithms, we demonstrate that Trotter steps of the electronic structure Hamiltonian can be simulated in exactly N depth and with only linear connectivity, where N is the number of spin-orbitals. This resolves the problem of non-locality in fermion-to-qubit mappings, and has wide-ranging applications for variational and phase estimation-based quantum simulation of quantum chemistry. We further study this algorithm on an error-corrected quantum computer using the surface code. Benchmarking it alongside other product formula approaches, we show that quantum simulation of scientifically important instances of the electronic structure problem that are classically intractable can be performed with only a few hundred thousand physical qubits and fewer than one billion costly fault-tolerant gates. Finally, we study the effect of using randomized Hamiltonians in iterative phase estimation, and how this allows us to reduce the costs of simulation as well as to exploit knowledge of the ground state in how we design our simulation algorithm.

Jan 8, 20200 citations