The variational quantum eigensolver (VQE), which has attracted attention as a promising application of noisy intermediate-scale quantum devices, finds a ground state of a given Hamiltonian by variationally optimizing the parameters of quantum circuits called Ans\"atze. Since the difficulty of the optimization depends on the complexity of the problem Hamiltonian and the structure of the Ans\"atze, it has been difficult to systematically analyze the performance of optimizers for the VQE. To resolve this problem, we propose a technique to construct a benchmark problem whose ground state is guaranteed to be achievable with a given Ansatz by using the idea of a parent Hamiltonian of a low-depth parametrized quantum circuit. We compare the convergence of several optimizers by varying the distance of the initial parameters from the solution and find that the converged energies showed a thresholdlike behavior depending on the distance. This work provides a systematic way to analyze optimizers for the VQE and contribute to the design of the Ansatz and its initial parameters.
The variational quantum eigensolver (VQE), which has attracted attention as a promising application of noisy intermediate-scale quantum devices, finds a ground state of a given Hamiltonian by variationally optimizing the parameters of quantum circuits called Ans"atze. Since the difficulty of the optimization depends on the complexity of the problem Hamiltonian and the structure of the Ans"atze, it has been difficult to systematically analyze the performance of optimizers for the VQE. To resolve this problem, we propose a technique to construct a benchmark problem whose ground state is guaranteed to be achievable with a given Ansatz by using the idea of a parent Hamiltonian of a low-depth parametrized quantum circuit. We compare the convergence of several optimizers by varying the distance of the initial parameters from the solution and find that the converged energies showed a thresholdlike behavior depending on the distance. This work provides a systematic way to analyze optimizers for the VQE and contribute to the design of the Ansatz and its initial parameters.
The Variational Quantum Eigensolver (VQE) is a promising candidate for quantum applications on near-term Noisy Intermediate-Scale Quantum (NISQ) computers. Despite a lot of empirical studies and recent progress in theoretical understanding of VQE's optimization landscape, the convergence for optimizing VQE is far less understood. We provide the first rigorous analysis of the convergence of VQEs in the over-parameterization regime. By connecting the training dynamics with the Riemannian Gradient Flow on the unit-sphere, we establish a threshold on the sufficient number of parameters for efficient convergence, which depends polynomially on the system dimension and the spectral ratio, a property of the problem Hamiltonian, and could be resilient to gradient noise to some extent. We further illustrate that this overparameterization threshold could be vastly reduced for specific VQE instances by establishing an ansatz-dependent threshold paralleling our main result. We showcase that our ansatz-dependent threshold could serve as a proxy of the trainability of different VQE ansatzes without performing empirical experiments, which hence leads to a principled way of evaluating ansatz design. Finally, we conclude with a comprehensive empirical study that supports our theoretical findings.
A variational quantum eigensolver (VQE) solves the ground state problem of a given Hamiltonian by finding the parameters of a quantum circuit Ansatz that minimizes the Hamiltonian expectation value. Among possible quantum circuit Ansätze, the Hamiltonian variational Ansatz (HVA) is widely studied for quantum many-body problems as the Ansatz with sufficiently large depth is theoretically guaranteed to express the ground state. However, since the HVA shares the same symmetry with the Hamiltonian, it is not necessarily good at finding symmetry-broken ground states that prevail in nature. In this paper, we systematically explore the limitations of the HVA for solving symmetry-broken systems and propose an alternative quantum circuit Ansatz with symmetry-breaking layers. With extensive numerical simulations, we show that the proposed Ansatz finds the ground state in depth significantly shorter than the bare HVA when the target Hamiltonian has symmetry-broken ground states.
Quantum chemistry is one of the most promising applications of quantum computers in the near future. For noisy intermediate-scale quantum devices, the quantum-classical hybrid framework based on the variational quantum eigensolver (VQE) has become the method of choice. In the literature, there are many different variants of VQE, but it is not known which one is optimal for a given molecule. For this purpose, we perform a thorough benchmarking on more than ten different kinds of VQE ansatzes (in systems up to 30 qubits), based on their performance on the energy accuracy, runtime until convergence, and number of parameters. Our results show that the ADAPT ansatz can be used to obtain more accurate energy for small systems (below 14 qubits), but it costs much more computational resources. For larger molecules, UCCSD0 has better performance. However, all the tested ansatzes can hardly reach chemical accuracy at stretched bond lengths. Our results were obtained using MindSpore Quantum, where the codes and the benchmarking toolkit are publicly available at Gitee.
Electronic structure calculations become computationally expensive on classical computers as electron correlation increases. Quantum computing offers a promising alternative through hybrid quantum-classical Variational Quantum Eigensolver (VQE) on Noisy-Intermediate Scale Quantum (NISQ) devices. The choice of ansatz plays a pivotal role in the performance and scalability of the VQE, yet selecting an optimal ansatz remains challenging. Existing approaches including chemically inspired ansatz, adaptive schemes and Hardware Efficient Ansätze (HEA) lack a unified comparison. This gap makes the scalability and trade-offs of each method unclear for varying molecular sizes. This work presents a systematic benchmarking study comparing Unitary Couples Cluster Singles and Doubles Ansatz (UCCSD), fermionic ADAPT-VQE, BasicPCA HEA, and Excitation Preserving HEA across molecules of varying size like H2, LiH, N2. We evaluate trade-offs among circuit depth, parameter count, ground-state energy error, and NISQ feasibility. ADAPT-VQE achieves accuracy comparable to UCCSD with lower resource overhead, but becomes impractical for modest system sizes ($\sim$10 electrons) due to increasing circuit complexity. In contrast, HEA reduces hardware costs but requires more parameters and sacrifices accuracy, with performance strongly dependent on molecular size. The Excitation Preserving ansatz remains below chemical accuracy for H2 and LiH, and fails for N2, underscoring the need to balance expressibility and trainability. Overall, these results highlight key trade-offs between accuracy and resource efficiency across VQE ansätze, emphasizing the need to improve ADAPT-VQE scalability and HEA accuracy while addressing optimization challenges for near-term quantum hardware.
Variational quantum algorithms (VQAs) are a modern family of quantum algorithms designed to solve optimization problems using a quantum computer. Typically VQAs rely on a feedback loop between the quantum device and a classical optimization algorithm. The appeal of VQAs lies in their versatility, resistance to noise, and ability to demonstrate some results even with circuits of small depth. We primarily focus on the algorithm called variational quantum eigensolver (VQE), which takes a qubit Hamiltonian and returns its approximate ground state. We first present our numerical findings regarding VQE applied to two spin models and a variant of the Hubbard model. Next, we briefly touch the topic of quantum machine learning by developing a quantum classifier to partition quantum data. We further study the phenomenon of vanishing derivatives in VQAs, also known as barren plateaus phenomenon. We derive a new lower bound on variance of the derivatives, which depends on the causal structure of the ansatz circuit and the individual terms entering the Pauli decomposition of the problem Hamiltonian. In the final chapter of the thesis, we present our results on bounding the fidelity of experimentally prepared Clifford states using their parent Hamiltonians.
Variational quantum eigensolvers (VQEs) are one of the most important and effective applications of quantum computing, especially in the current noisy intermediate-scale quantum (NISQ) era. There are two main approaches for VQEs: problem-agnostic and problem-specific. For problem-agnostic methods, they often suffer from trainability issues. For problem-specific methods, their performance usually relies upon the choice of initial reference states, which are often hard to determine. In this paper, we propose an entanglement-variational hardware-efficient ansatz (EHA), and numerically compare it with some widely used ansatzes by solving benchmark problems in quantum many-body systems and quantum chemistry. Our EHA is problem-agnostic and hardware-efficient, is especially suitable for NISQ devices, and has potential for wide applications. Our EHA can achieve a higher level of accuracy in finding ground states and their energies in most cases, even compared with problem-specific methods. The performance of the EHA is robust to the choice of initial states and to parameter initialization, and it has the ability to quickly adjust the entanglement to the required amount, which is also the fundamental reason for its superiority.