We study the photodissociation of the sulfonium cation using quantum computing algorithms on IBM's hardware. We combine and extend methodologies to compute molecular excited states, photodissociation spectra, and molecular dissociation pathways.
Quantum chemistry simulations of some industrially relevant molecules are reported, employing variational quantum algorithms for near-term quantum devices. The energies and dipole moments are calculated along the dissociation curves for lithium hydride (LiH), hydrogen sulfide, lithium hydrogen sulfide, and lithium sulfide. In all cases, we focus on the breaking of a single bond to obtain information about the stability of the molecular species being investigated. We calculate energies and a variety of electrostatic properties of these molecules using classical simulators of quantum devices, with up to 21 qubits for lithium sulfide. Moreover, we calculate the ground-state energy and dipole moment along the dissociation pathway of LiH using IBM quantum devices. This is the first example, to the best of our knowledge, of dipole moment calculations being performed on quantum hardware.
Knowing the ground state energies of molecules and atoms gives scientists critical insight into these particles' behavior in reactions, thermodynamic and molecular properties, and excitation energies.However, due to the quantum mechanical nature of particles, finding the ground state of a system is intractable, both mathematically and experimentally.Computational methods are utilized to estimate the ground state energies.As we approach the limits of classical computers, quantum computers are viewed as promising alternatives that present a bright future for computational chemistry.In this paper, I review classical and quantum algorithms/methods for computational chemistry.Then, I discuss the current topics in using quantum computers for computational chemistry by analyzing the performance of the Variational Quantum Eigensolver (VQE) in different contexts on IBM's noisy quantum computer simulator, "QasmSimulator," and one of IBM's quantum computers, ibmq_belem.This review presents a theoretical and practical view of quantum computational chemistry.It allows the reader to learn the theory behind the algorithms and implement them with the guidance of the presented code and its detailed explanations.The purpose of this paper is to leave the reader with the necessary theory and adequate programming reference to implement the algorithms in various contexts.
Abstract Chemical simulation is expected to be one of the first practical applications of real quantum computers. Therefore, curricular materials should be developed to teach students the fundamentals of this very important topic. Even the simplest molecule, diatomic hydrogen, is tremendously complicated to simulate with a quantum computer. Much of the complexity is due to the interaction of the two electrons. As a first warm-up exercise in quantum computing for chemistry, we show how to simulate the hydrogen molecule cation, which has only one electron.
The computation of excited electronic states is an important application for quantum computers. In this work, we simulate the excited state spectra of four aromatic heterocycles on IBM superconducting quantum computers, focussing on active spaces of π→π∗ and n→π∗ excitations. We approximate the ground state with the entanglement forging method, a qubit reduction technique that maps a spatial orbital to a single qubit, rather than two qubits. We then determine excited states using the quantum subspace expansion method. We showcase these algorithms on quantum hardware using up to 8 qubits and employing readout and gate error mitigation techniques. Our results demonstrate a successful application of quantum computing in the simulation of active-space electronic wavefunctions of substituted aromatic heterocycles, and outline challenges to be overcome in elucidating the optical properties of organic molecules with hybrid quantum-classical algorithms.
Quantum and hybrid quantum-classical algorithms have the potential to improve the accuracy and scale of quantum chemistry and impact a broad range of applications such as drug discovery and catalysis. In particular, subspace methods such as sample-based quantum diagonalization (SQD) can already tackle classically challenging systems. However, practical algorithms that go beyond the computation of electronic ground and excited states are still scarce. Here, we introduce the variable-geometry sample-based quantum diagonalization (VGSQD) algorithm, which extends SQD to variable molecular geometries by reusing quantum samples from a reference geometry at displaced ones, thus significantly reducing quantum computational cost. Using circuits of up to 124 qubits on ibm-quebec, an IBM Heron r2 quantum processor, we determine the equilibrium geometry and energy of the weakly bound, strongly correlated beryllium dimer, as well as the water molecule. Finally, we extend VGSQD to chemical reactions and compute the minimum energy path and energy barrier of a hydrogen exchange reaction. The results are comparable with state-of-the-art classical methods such as CCSD(T) and DMRG. This work broadens the scope of quantum algorithms for chemistry, from energies to geometry optimization and reaction pathways, both essential for practical applications.
In principle, it is possible to model any physical system exactly using quantum mechanics; in practice, it quickly becomes infeasible. Recognising this, Richard Feynman suggested that quantum systems be used to model quantum problems [1]. For example, the fundamental problem faced in quantum chemistry is the calculation of molecular properties, which are of practical importance in fields ranging from materials science to biochemistry. Within chemical precision, the total energy of a molecule as well as most other properties, can be calculated by solving the Schrödinger equation. However, the computational resources required to obtain exact solutions on a conventional computer generally increase exponentially with the number of atoms involved [1, 2]. In the late 1990’s an efficient algorithm was proposed to enable a quantum processor to calculate molecular energies using resources that increase only polynomially in the molecular size [2–4]. Despite the many different physical architectures that have been explored experimentally since that time—including ions, atoms, superconducting circuits, and photons—this appealing algorithm has not been demonstrated to date.