We describe a quantum chemistry simulation software program BQ-Chem, which can calculate the low-energy spectrum and potential energy surface of molecules on a quantum computer. BQ-Chem is based on the full quantum eigensolver (FQE), which is implemented with a quantum gradient descent algorithm. Benefiting from FQE, BQ-Chem can perform all the calculations on a quantum computer. Compared with the classical optimization methods which encounter the optimization difficulty of high-dimensional and multivariable functions in dealing with multielectron orbitals of macromolecules, FQE provides an exponential speedup. FQE works fully on a quantum computer; thus, BQ-Chem can be smoothly transited to future large-scale quantum computers.
We describe a quantum chemistry simulation software program BQ-Chem, which can calculate the low-energy spectrum and potential energy surface of molecules on a quantum computer. BQ-Chem is based on the full quantum eigensolver (FQE), which is implemented with a quantum gradient descent algorithm. Benefiting from FQE, BQ-Chem can perform all the calculations on a quantum computer. Compared with the classical optimization methods which encounter the optimization difficulty of high-dimensional and multivariable functions in dealing with multielectron orbitals of macromolecules, FQE provides an exponential speedup. FQE works fully on a quantum computer; thus, BQ-Chem can be smoothly transited to future large-scale quantum computers.
Quantum simulation of quantum chemistry is one of the most compelling applications of quantum computing. It is of particular importance in areas ranging from materials science, biochemistry, and condensed matter physics. Here, we propose a full quantum eigensolver (FQE) algorithm to calculate the molecular ground energies and electronic structures using quantum gradient descent. Compared to existing classical-quantum hybrid methods such as variational quantum eigensolver (VQE), our method removes the classical optimizer and performs all the calculations on a quantum computer with faster convergence. The gradient descent iteration depth has a favorable complexity that is logarithmically dependent on the system size and inverse of the precision. Moreover, the FQE can be further simplified by exploiting a perturbation theory for the calculations of intermediate matrix elements and obtaining results with a precision that satisfies the requirement of chemistry application. The full quantum eigensolver can be implemented on a near-term quantum computer. With the rapid development of quantum computing hardware, the FQE provides an efficient and powerful tool to solve quantum chemistry problems.
The variational quantum eigensolver (VQE) typically optimizes variational parameters in a quantum circuit to prepare eigenstates for a quantum system. Its application to many problems may involve a group of Hamiltonians, e.g., a Hamiltonian of a molecule is a function of the nuclear configurations. In this paper we incorporate derivatives of the Hamiltonian into the VQE and develop some hybrid quantum-classical algorithms, which explore both Hamiltonian and wave-function spaces for solving quantum chemistry problems more efficiently. For geometry optimization, we propose a mutual gradient-descent algorithm that updates the parameters of the Hamiltonian and wave function alternately, which can give a rapid convergence towards equilibrium structures of molecules as demonstrated in numerical simulations. Moreover, to speed up the calculation of the energy potential surface, we establish differential equations that govern how the optimized variational parameters of the wave function change with the intrinsic parameters of the Hamiltonian. Our study suggests a direction for a hybrid quantum-classical algorithm for solving quantum systems more efficiently by considering spaces of both the Hamiltonian and the wave function.
For a complex quantum system, the dimensionality of the Hamiltonian grows exponentially with the size of the system, making it difficult to perform fast large-scale simulations and calculations on a classical computer. The first Variational Quantum Eigenvalue solver (VQE) proposed by Peruzzo et al. This gives the possibility of highly accurate molecular simulations and calculations in the field of quantum chemical computing. VQE is roughly based on the principle of using a quantum computer and set up a trial wave function |ψ(θ)⟩=U(θ)|ψ0⟩ to measure the energy expectation of the wave function |ψ(θ)⟩ at the corresponding initialization parameter, and then using a classical optimization algorithm to iterate θ0→θn over the energy to minimum until convergence. The significance of this paper is to verify the accuracy as well as the feasibility of the VQE algorithm for the calculation of LiH molecules in STO-3g basis, and to perform an error analysis and to verify the exponential acceleration of the classical algorithm implementation. These results shed light on guiding further exploration focusing on quantum computingt.
Optimization problems are prevalent in various fields, and the gradient-based gradient descent algorithm is a widely adopted optimization method. However, in classical computing, computing the numerical gradient for a function with d variables necessitates at least d + 1 function evaluations, resulting in a computational complexity of O ( d ). As the number of variables increases, the classical gradient estimation methods require substantial resources, ultimately surpassing the capabilities of classical computers. Fortunately, leveraging the principles of superposition and entanglement in quantum mechanics, quantum computers can achieve genuine parallel computing, leading to exponential acceleration over classical algorithms in some cases. In this paper, we propose a novel quantum-based gradient calculation method that requires only a single oracle calculation to obtain the numerical gradient result for a multivariate function. The complexity of this algorithm is just O (1). Building upon this approach, we successfully implemented the quantum gradient descent algorithm and applied it to the variational quantum eigensolver (VQE), creating a pure quantum variational optimization algorithm. Compared with classical gradient-based optimization algorithm, this quantum optimization algorithm has remarkable complexity advantages, providing an efficient solution to optimization problems. The proposed quantum-based method shows promise in enhancing the performance of optimization algorithms, highlighting the potential of quantum computing in this field.
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.
The development of quantum algorithms to solve quantum chemistry problems has offered a promising new paradigm of performing computer simulations at the scale of atoms and molecules. Although majority of the research so far has focused on designing quantum algorithms to compute ground and excited state energies and forces, it is useful to run different simulation tasks, such as geometry optimization, with these algorithms as subroutines. Towards this end, we have created an interface for the Variational Quantum Eigensolver based molecular Energy (VQE-E) and molecular Force (VQE-F) code to the Atomic Simulation Environment (ASE). We demonstrate the working of this hybrid quantum-classical interface by optimizing the geometry of water molecule using a native optimizer implemented in ASE. Furthermore, this interface enables one to compare, combine and use quantum algorithms in conjunction with related classical methods quite easily with minimal coding effort.