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.
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.
Quantum computing promises to efficiently and accurately solve many important problems in quantum chemistry which elude classical solvers, such as the electronic structure problem of highly correlated materials. Two leading methods in solving the ground state problem are the Variational Quantum Eigensolver (VQE) and Adiabatic Quantum Computing (AQC) algorithms. VQE often struggles with convergence due to the energy landscape being highly non-convex and the existence of barren plateaux, and implementing AQC is beyond the capabilities of current quantum devices as it requires deep circuits. Adiabatically-inspired algorithms aim to fill this gap. In this paper, we first present a unifying framework for these algorithms and then benchmark the following methods: the Adiabatically Assisted VQE (AAVQE) (Garcia-Saez and Latorre (2018)), the Variational Adiabatic Quantum Computing (VAQC) (Harwood et al (2022)), and the Adiabatic Quantum Computing with Parametrized Quantum Circuits (AQC-PQC) (Kolotouros et al (2025)) algorithms. Second, we introduce a novel hybrid approach termed G-AQC-PQC, which generalizes the AQC-PQC method, and combines adiabatic-inspired initialization with the low-memory BFGS optimizer, reducing the quantum computational cost of the method. Third, we compare the accuracy of the methods for chemistry applications using the beryllium hydride molecule (BeH
2). We compare the approaches across a number of different choices (ansätze types, depth, discretization steps, initial Hamiltonian, adiabatic schedules and method used). Our results show that the G-AQC-PQC outperforms conventional VQE. We further discuss limitations such as the zero-gradient problem and identify regimes where adiabatically-inspired methods offer a tangible advantage for near-term quantum chemistry applications.
Abstract The advancement of quantum computation paves a novel way for addressing the issue of eigenstates. In this paper, two full quantum eigenvalue solvers based on quantum gradient descent are put forward. Compared to the existing classical-quantum hybrid approaches such as the variance-variational quantum eigenvalue solver, our method enables faster convergent computations on quantum computers without the participation of classical algorithms. As any eigenstate of a Hamiltonian has zero variance, this paper takes the variance as the objective function and utilizes the quantum gradient descent method to optimize it, demonstrating the optimization of the objective function on the quantum simulator. With the swift progress of quantum computing hardware, the two variance full quantum eigensolvers proposed in this paper are anticipated to be implemented on quantum computers, thereby offering an efficient and potent calculation approach for solving eigenstate problems. Employing this algorithm, we showcase 2 qubits of deuterium and hydrogen molecule. Furthermore, we numerically investigate the energy and variance of the Ising model in larger systems, including 3, 4, 5, 6, and 10 qubits.
Exponential scaling presents a significant challenge in electronic structure calculations performed on classical computers. This paper explores how quantum computer algorithms can accurately represent quantum systems. Variational Quantum Eigensolver (VQE) algorithm is used to compute the ground state energy of hydrogen and helium sequences by implementing variational principle and quantum gates as trial wavefunction. This technique combines classical optimization with quantum computing calculations to simulate quantum systems on noisy and resource-limited computers. The resulting calculated energy is highly consistent to the corresponding exact values and Hartree-Fock calculations with a trend of when the number of atoms increases the calculated energy becomes more negative, leading to a decrease in the percentage error. Moreover, the convergence of the ground state energy of hydrogen and helium atoms was effectively optimized. The desired energy was reached, proven by adjusting the expectation value, and gradually achieving unity in state overlap. These findings demonstrate the VQE method's accuracy in calculating simple quantum systems and its scalability for larger atomic and molecular system, such as those in quantum chemistry and material science. However, challenges in quantum computer simulations, such as limited in qubit numbers and the presence of noise, require further advancements. Therefore, implementing a larger basis sets, advanced qubit mapping, specific chemistry ansatz, and flexible optimization techniques is one way to improve overall calculation.
Quantum chemistry models atoms and molecules using quantum mechanics, with the electronic structure problem at its core. This problem, which determines the energy and properties of electrons in a molecule, is exponentially hard to solve exactly on classical computers. To approximate solutions, effective models introduce layers of simplifications. However, these approximations can fail for strongly correlated systems, necessitating alternative approaches. Quantum computers, capable of processing quantum information natively, offer a promising path to simulate molecular systems beyond classical reach, with potential applications in catalysis, materials science, and photochemistry. Despite rapid advancements in quantum hardware, practical quantum computations remain challenging due to limited resources. This thesis optimizes quantum resource usage in computational chemistry, introducing novel embedding techniques and exploring applications beyond ground-state energies. Chapter 1 establishes the foundation by reviewing quantum chemistry methods, from Hartree-Fock and Density Functional Theory (DFT) to active space approaches. It also provides an introduction to quantum computing for chemistry, focusing on near-term algorithms. The following chapters present novel methods aimed at reducing quantum resource requirements and tackling problems classical methods struggle with. Chapter 2 introduces a technique to reduce the
λ-norm of the electronic structure Hamiltonian, a key measure of quantum resource demand. By transforming molecular orbitals, this method enhances sampling efficiency in Noisy Intermediate-Scale Quantum (NISQ) algorithms and reduces runtime in Fault-Tolerant Quantum Computing (FTQC). Localized orbitals outperform canonical ones, and an orbital-optimization scheme is proposed to minimize the
λ-norm. Benchmarks on hydrogen chains, FeMoco, and Ruthenium complexes demonstrate its effectiveness. Chapter 3 presents the FragPT2 framework for simulating large systems with multiple interacting fragments. This method embeds each fragment in the mean field of others and applies multi-reference perturbation theory to capture inter-fragment correlations such as dispersion and charge transfer efficiently. The approach reduces computational overhead and enables scalable simulations, as shown in applications to \ce{N2} dimers, aromatic dimers, and butadiene. Chapter 4 focuses on photochemical systems, where multiple electronic states must be treated equally. The state-averaged orbital-optimized variational quantum eigensolver (SAOOVQE) is extended with analytical energy gradients and non-adiabatic couplings, enabling geometry optimizations and simulations of non-adiabatic dynamics on quantum hardware. This is demonstrated by locating the conical intersection in formaldimine, highlighting SAOOVQE’s potential for studying photoisomerization in biomolecules. Building on this, Chapter 5 develops a quantum algorithm to detect conical intersections, where the Born-Oppenheimer approximation breaks down. These intersections are characterized by a discrete Berry phase (0 or
π), representing their topological nature. The algorithm extracts this phase as a single bit of information, ensuring resilience to noise. Analytical proof and numerical validation using a toy molecular model illustrate its effectiveness for studying light-perception biochemistry and related photochemical processes. Finally, Chapter 6 explores machine learning density functionals trained on noisy quantum data. While DFT is computationally efficient, its accuracy depends on approximated exchange-correlation functionals. This work proposes a neural network-based approach to learn the exact functional from quantum data, showing that training on noisy outputs from NISQ devices can mitigate sampling errors. Applications to the Fermi-Hubbard model and other systems demonstrate its potential to generalize and provide accurate results under noise. This thesis advances quantum computational chemistry by optimizing quantum resource usage, developing new embedding strategies, and expanding the scope of quantum simulations beyond ground-state properties. These contributions pave the way for practical quantum algorithms that could revolutionize molecular simulations in the near future.