Mario Motta's research while affiliated with IBM Research and other places

Modeling chemical reactions with quantum chemical methods is challenging when the electronic structure varies significantly throughout the reaction, as well as when electronic excited states are involved. Multireference methods such as complete active space self-consistent field (CASSCF) can handle these multiconfigurational situations. However, even if the size of needed active space is affordable, in many cases the active space does not change consistently from reactant to product, causing discontinuities in the potential energy surface. The localized active space SCF (LASSCF) is a cheaper alternative to CASSCF for strongly correlated systems with weakly correlated fragments. The method is used for the first time to study a chemical reaction, namely the bond dissociation of a mono-, di-, and triphenylsulfonium cation. LASSCF calculations generate smooth potential energy scans more easily than the corresponding, more computationally expensive, CASSCF calculations, while predicting similar bond dissociation energies. Our calculations suggest a homolytic bond cleavage for di- and triphenylsulfonium, and a heterolytic pathway for monophenylsulfonium.

Quantum subspace methods (QSMs) are a class of quantum computing algorithms where the time-independent Schrodinger equation for a quantum system is projected onto a subspace of the underlying Hilbert space. This projection transforms the Schrodinger equation into an eigenvalue problem determined by measurements carried out on a quantum device. The eigenvalue problem is then solved on a classical computer, yielding approximations to ground- and excited-state energies and wavefunctions. QSMs are examples of hybrid quantum-classical methods, where a quantum device supported by classical computational resources is employed to tackle a problem. QSMs are rapidly gaining traction as a strategy to simulate electronic wavefunctions on quantum computers, and thus their design, development, and application is a key research field at the interface between quantum computation and electronic structure. In this review, we provide a self-contained introduction to QSMs, with emphasis on their application to the electronic structure of molecules. We present the theoretical foundations and applications of QSMs, and we discuss their implementation on quantum hardware, illustrating the impact of noise on their performance.

The simulation of chemical reactions is an anticipated application of quantum computers. Using a Diels-Alder reaction as a test case, in this study we explore the potential applications of quantum algorithms and hardware in investigating chemical reactions. Our specific goal is to calculate the activation barrier of a reaction between ethylene and cyclopentadiene forming a transition state. To achieve this goal, we use quantum algorithms for near-term quantum hardware (entanglement forging and quantum subspace expansion) and classical post-processing (many-body perturbation theory) in concert. We conduct simulations on IBM quantum hardware using up to 8 qubits, and compute accurate activation barriers in the reaction between cyclopentadiene and ethylene by accounting for both static and dynamic electronic correlation. This work illustrates a hybrid quantum-classical computational workflow to study chemical reactions on near-term quantum devices, showcasing the potential of quantum algorithms and hardware in accurately calculating activation barriers.

A prominent goal in quantum chemistry is to solve the molecular electronic structure problem for ground state energy with high accuracy. While classical quantum chemistry is a relatively mature field, the accurate and scalable prediction of strongly correlated states found, e.g., in bond breaking and polynuclear transition metal compounds remains an open problem. Within the context of a variational quantum eigensolver, we propose a new family of ansatzes which provides a more physically appropriate description of strongly correlated electrons than a unitary coupled cluster with single and double excitations (qUCCSD), with vastly reduced quantum resource requirements. Specifically, we present a set of local approximations to the unitary cluster Jastrow wavefunction motivated by Hubbard physics. As in the case of qUCCSD, exactly computing the energy scales factorially with system size on classical computers but polynomially on quantum devices. The local unitary cluster Jastrow ansatz removes the need for SWAP gates, can be tailored to arbitrary qubit topologies (e.g., square, hex, and heavy-hex), and is well-suited to take advantage of continuous sets of quantum gates recently realized on superconducting devices with tunable couplers. The proposed family of ansatzes demonstrates that hardware efficiency and physical transparency are not mutually exclusive; indeed, chemical and physical intuition regarding electron correlation can illuminate a useful path towards hardware-friendly quantum circuits.

Modeling electronic systems is an important application for quantum computers. In the context of materials science, an important open problem is the computational description of chemical reactions on surfaces. In this work, we outline a workflow to model the adsorption and reaction of molecules on surfaces using quantum computing algorithms. We develop and compare two local embedding methods for the systematic determination of active spaces. These methods are automated and based on the physics of molecule-surface interactions and yield systematically improvable active spaces. Furthermore, to reduce the quantum resources required for the simulation of the selected active spaces using quantum algorithms, we introduce a technique for exact and automated circuit simplification. This technique is applicable to a broad class of quantum circuits and critical to enable demonstration on near-term quantum devices. We apply the proposed combination of active-space selection and circuit simplification to the dissociation of water on a magnesium surface using classical simulators and quantum hardware. Our study identifies reactions of molecules on surfaces, in conjunction with the proposed algorithmic workflow, as a promising research direction in the field of quantum computing applied to materials science.

We introduce an adiabatic state preparation protocol which implements quantum imaginary time evolution under the Hamiltonian of the system. Unlike the original quantum imaginary time evolution algorithm, adiabatic quantum imaginary time evolution does not require quantum state tomography during its runtime, and unlike standard adiabatic state preparation, the final Hamiltonian is not the system Hamiltonian. Instead, the algorithm obtains the adiabatic Hamiltonian by integrating a classical differential equation that ensures that one follows the imaginary time evolution state trajectory. We introduce some heuristics that allow this protocol to be implemented on quantum architectures with limited resources. We explore the performance of this algorithm via classical simulations in a one-dimensional spin model and highlight essential features that determine its cost, performance, and implementability for longer times. We find competitive performance when compared to the original quantum imaginary time evolution, and argue that the rapid convergence of this protocol and its low resource requirements make it attractive for near-term state preparation applications.

Quantum computers promise to solve certain computational problems much faster than classical computers. However, current quantum processors are limited by their modest size and appreciable error rates. Recent efforts to demonstrate quantum speedups have therefore focused on problems that are both classically hard and naturally suited to current quantum hardware, such as sampling from complicated—although not explicitly useful—probability distributions1–3. Here we introduce and experimentally demonstrate a quantum algorithm that is similarly well suited to current hardware, but which samples from complicated distributions arising in several applications. The algorithm performs Markov chain Monte Carlo (MCMC), a prominent iterative technique⁴, to sample from the Boltzmann distribution of classical Ising models. Unlike most near-term quantum algorithms, ours provably converges to the correct distribution, despite being hard to simulate classically. But like most MCMC algorithms, its convergence rate is difficult to establish theoretically, so we instead analysed it through both experiments and simulations. In experiments, our quantum algorithm converged in fewer iterations than common classical MCMC alternatives, suggesting unusual robustness to noise. In simulations, we observed a polynomial speedup between cubic and quartic over such alternatives. This empirical speedup, should it persist to larger scales, could ease computational bottlenecks posed by this sampling problem in machine learning⁵, statistical physics⁶ and optimization⁷. This algorithm therefore opens a new path for quantum computers to solve useful—not merely difficult—sampling problems.