Abstract Solving the electronic structure for multi-electronic systems is a hard problem. Even for small atoms and molecules, approximations have to be made in order to solve numerically the Schrödinger equation. Although different methods have been developed to take into account electron correlations, their computational cost reduces their feasibility. Quantum simulation provides an alternative to traditional computational methods for enquiring the electronic structure of molecules. Specifically, the Variational Quantum Eigensolver (VQE) algorithm provides a hybrid quantum-classical algorithm for the implementation on current near term quantum devices. In this work, we explore the implementation of VQE on Qiskit for calculating the ground-state energy of diatomic Hydrogen molecule.
Abstract Solving the electronic structure for multi-electronic systems is a hard problem. Even for small atoms and molecules, approximations have to be made in order to solve numerically the Schrödinger equation. Although different methods have been developed to take into account electron correlations, their computational cost reduces their feasibility. Quantum simulation provides an alternative to traditional computational methods for enquiring the electronic structure of molecules. Specifically, the Variational Quantum Eigensolver (VQE) algorithm provides a hybrid quantum-classical algorithm for the implementation on current near term quantum devices. In this work, we explore the implementation of VQE on Qiskit for calculating the ground-state energy of diatomic Hydrogen molecule.
Feynmans ideas to employ quantum systems for simulating other quantum systems gave rise to quantum simulation. While current quantum computers are still prone to decoherence and rely on error correction, the development of hybrid algorithms that employ both quantumand classical computation allow to perform quantum simulation. Among these algorithms, the Variational Quantum Eigensolver algorithm has permitted to explore the electronic structure of simple atoms and molecules by exploiting the Rayleigh Ritz variational principle. In this work we provide the implementation of the VQE algorithm for finding the ground state energy of the hydrogen molecule on Qiskit library for python.
Quantum computing has emerged as a promising technology for solving problems that are intractable for classical computers. In this study, we introduce quantum computing and implement the Variational Quantum Eigensolver (VQE) algorithm using Qiskit on the IBM Quantum platform to calculate the ground state energy of a hydrogen molecule. We provide a theoretical framework of quantum mechanics, qubits, quantum gates, and the VQE algorithm. Our implementation process is described, and we simulate the results. Additionally, experiments are conducted on the IBM Quantum platform, and the results are analyzed. Our fi ndings demonstrate that VQE can effi ciently calculate molecular properties with high accuracy. However, limitations and challenges in scaling the algorithm for larger molecules are also identifi ed. This work contributes to the growing body of research on quantum computing and highlights the potential applications of VQE for real-world problem-solving.
In this work, the underlying theory of variational quantum algorithms applied to the study of simple quantum systems has been reviewed. Using the Qiskit library, the VQE (Variational Quantum Eigensolver) algorithm has been implemented to obtain the ground state energy of three simple quantum systems: the hydrogen molecule, an electron in a Yukawa potential, and two electrons in an infinite potential well with contact interaction. The algorithm parameters that yielded the best results were the UCCSD ansatz, the COBYLA optimizer, and a high number of shots. Although the results of simulations using quantum algorithms did not achieve the same precision as classical algorithms, especially under noise models, the implementation of the VQE algorithm has been successful in exploring the current capabilities and limitations of quantum computing. These results demonstrate the ability of quantum algorithms to solve simple quantum systems, despite current challenges. Furthermore, they underscore their potential to surpass classical algorithms in solving complex quantum systems.
Quantum mechanics has introduced a new theoretical framework for the study of molecules, enabling the prediction of properties and dynamics through the solution of the Schrödinger equation applied to these systems. However, solving this equation is computationally expensive, which has led to the development of various mathematical frameworks and computational methods designed to balance the available resources with the desired level of accuracy. In particular, quantum computers have emerged as a promising technology with the potential to address these problems more efficiently in the coming decades, whether through reductions in memory, time, and energy consumption, i. e., reductions in computational complexity or by enhancing precision. This research field is known as Quantum Simulation. Given the current technological limitations of quantum computers, Variational Quantum Algorithms (VQAs), especially the Variational Quantum Eigensolver (VQE), stand out as a feasible approach to demonstrating advantages over classical methods in the near term. This feasibility arises from their lower demand for quantum gates and the reduced depth of the circuits required for their implementation. In this work, we present the application of quantum mechanics to the study of molecules, provide an introduction to the fundamentals of quantum computing, and explore the integration of these fields by employing the VQE in molecular simulations. Finally, we discuss the spatial and temporal complexity associated with the algorithm, highlighting its implications and challenges.
High Resolution Image Download MS PowerPoint Slide The recent developments of quantum computing present novel potential pathways for quantum chemistry as the scaling of the computational power of quantum computers could be harnessed to naturally encode and solve electronic structure problems. Theoretically exact quantum algorithms for chemistry have been proposed (e.g., quantum phase estimation), but the limited capabilities of current noisy intermediate-scale quantum devices motivated the development of less demanding hybrid algorithms. In this context, the variational quantum eigensolver (VQE) algorithm was successfully introduced as an effective method to compute the ground-state energies of small molecules. This study investigates the folded spectrum (FS) method as an extension of the VQE algorithm for the computation of molecular excited states. It provides the possibility of directly computing excited states around a selected target energy using the same or quantum circuit as for the ground-state calculation. Inspired by the variance-based methods from the quantum Monte Carlo literature, the FS method minimizes the energy variance, thus, in principle, requiring a computationally expensive squared Hamiltonian to be applied. We alleviate this potentially poor scaling by employing a Pauli grouping procedure to identify sets of commuting Pauli strings that can be evaluated simultaneously. This allows for a significant reduction in the computational cost. We applied the FS-VQE method to small molecules (H 2, LiH), obtaining all electronic excited states with chemical accuracy on ideal quantum simulators. Furthermore, we explore the application of quantum error mitigation techniques, demonstrating improved energy accuracy on noisy simulators compared with simulations without mitigation.
We use the Variational Quantum Eigensolver (VQE) as implemented in the Qiskit software package to compute the ground state energy of small molecules derived from water, H2O, and hydrogen cyanide, HCN. The work aims to benchmark algorithms for calculating the electronic structure and energy surfaces of molecules of relevance to prebiotic chemistry, beginning with water and hydrogen cyanide, and to run them on the available simulated and physical quantum hardware. The numerical calculations of the algorithms for small quantum processors allow us to design more efficient protocols to be run in real hardware, as well as to analyze their performance. Future implementations on accessible quantum processing prototypes will benchmark quantum computers and provide tests of quantum advantage with heuristic quantum algorithms.