The variational quantum eigensolver (VQE) framework has been instrumental in advancing near-term quantum algorithms. However, parameter optimization remains a significant bottleneck for VQE, requiring a large number of measurements for successful algorithm execution. In this paper, we propose sequential optimization with approximate parabola (SOAP) as an efficient and robust optimizer specifically designed for parameter optimization of the unitary coupled-cluster ansatz on quantum computers. SOAP leverages sequential optimization and approximates the energy landscape as quadratic functions, minimizing the number of energy evaluations required to optimize each parameter. To capture parameter correlations, SOAP incorporates the average direction from previous iterations into the optimization direction set. Numerical benchmark studies on molecular systems demonstrate that SOAP achieves significantly faster convergence and greater robustness to noise compared with traditional optimization methods. Furthermore, numerical simulations of up to 20 qubits reveal that SOAP scales well with the number of parameters in the ansatz. The exceptional performance of SOAP is further validated through experiments on a superconducting quantum computer using a 2-qubit model system.
The variational quantum eigensolver (VQE) framework has been instrumental in advancing near-term quantum algorithms. However, parameter optimization remains a significant bottleneck for VQE, requiring a large number of measurements for successful algorithm execution. In this paper, we propose sequential optimization with approximate parabola (SOAP) as an efficient and robust optimizer specifically designed for parameter optimization of the unitary coupled-cluster ansatz on quantum computers. SOAP leverages sequential optimization and approximates the energy landscape as quadratic functions, minimizing the number of energy evaluations required to optimize each parameter. To capture parameter correlations, SOAP incorporates the average direction from previous iterations into the optimization direction set. Numerical benchmark studies on molecular systems demonstrate that SOAP achieves significantly faster convergence and greater robustness to noise compared with traditional optimization methods. Furthermore, numerical simulations of up to 20 qubits reveal that SOAP scales well with the number of parameters in the ansatz. The exceptional performance of SOAP is further validated through experiments on a superconducting quantum computer using a 2-qubit model system.
Quantum computing on near-term noisy intermediate-scale quantum devices holds significant promise for simulating complex chemical systems. Among various variational quantum algorithms, the adaptive derivative-assembled pseudo-Trotter ansatz variational quantum eigensolver (ADAPT-VQE) is widely used for generating molecule-specific adaptive ansätze for different molecules, yet its measurement requirement is extensive, calling for suitable optimizers. In this study, we utilize the ADAPT-VQE algorithm enhanced by a powerful optimizer termed sequential optimization with an approximate parabola (SOAP) to calculate molecular energies. These computations are carried out through classical simulations using the TenCirChem software. Our results demonstrate the efficiency and robustness of the SOAP optimizer for ADAPT-VQE. Furthermore, we show that SOAP performs effectively across different ADAPT-VQE ansatz element pools. This work presents a strategy to mitigate the substantial measurement requirements associated with ADAPT-VQE.
Abstract The variational quantum eigensolver (VQE) algorithm combines the ability of quantum computers to efficiently compute expectation values with a classical optimization routine in order to approximate ground state energies of quantum systems. In this paper, we study the application of VQE to the simulation of molecular energies using the unitary coupled cluster (UCC) ansatz. We introduce new strategies to reduce the circuit depth for the implementation of UCC and improve the optimization of the wavefunction based on efficient classical approximations of the cluster amplitudes. Additionally, we propose an analytical method to compute the energy gradient that reduces the sampling cost for gradient estimation by several orders of magnitude compared to numerical gradients. We illustrate our methodology with numerical simulations for a system of four hydrogen atoms that exhibit strong correlation and show that the circuit depth of VQE using a UCC ansatz can be reduced without introducing significant loss of accuracy in the final wavefunctions and energies.
Variational quantum eigensolver (VQE) is demonstrated to be the promising methodology for quantum chemistry based on near-term quantum devices. However, many problems are yet to be investigated for this methodology, such as the influences of optimization algorithm and basis size on the accuracy and efficiency for quantum computing. To address these issues, five molecules (H2, LiH, HF, N2 and F2) are studied in this work based on the VQE method using unitary coupled cluster (UCC) ansatz. The performance of the gradient optimization L-BFGS-B is compared with that of the direct search method COBYLA. The former converges more quickly, but the accuracy of energy surface is a little lower. The basis set shows a vital influence on the accuracy and efficiency. A large basis set generally provides an accurate energy surface, but induces a significant increase in computing time. The 631g basis is generally required from the energy surface of the simplest H2 molecule. For practical applications of VQE, complete active space (CAS) is suggested based on limited quantum resources. With the same number of qubits, more occupied orbitals included in CAS gives a better accuracy for the energy surface and a smaller evaluation number in the VQE optimization. Additionally, the electronic structure, such as filling fraction of orbitals, the bond strength of a molecule and the maximum nuclear charge also influences the performance of optimization, where half occupation of orbitals generally requires a large computation cost.
Orbital optimization within the variational quantum eigensolver (VQE) framework is useful for improving active-space quality and accurately capturing electron correlation with shallow quantum circuits. The orbital-optimized unitary coupled cluster (OO-UCC) method [W. Mizukami et al., Phys. Rev. Res. 2, 033421 (2020)], in its original formulation, employs the orbital gradient and Hessian in a Newton--Laphson procedure. In this study, we propose sequential orbital-optimized unitary coupled cluster doubles (SOO-UCCD), extending the gradient-free sequential minimal optimization approach [K. M. Nakanishi et al., Phys. Rev. Res. 2, 043158 (2020)] to orbital rotation parameters. Based on the frequency structure implied by the algebraic properties of the orbital rotation generators, our method determines each orbital rotation angle from a nine-point energy profile. The energy landscape is evaluated by classically transforming the Hamiltonian integrals and contracting them with the reduced density matrices already measured for the VQE energy evaluation. This allows for orbital optimization without evaluating the orbital gradient or Hessian. By building on the core benefits of the OO-UCC framework, our method provides a gradient-free and hyperparameter-free orbital-optimization procedure. State-vector simulations for LiH in the STO-3G basis show that SOO-UCCD reproduces UCCSD-level accuracy along the bond-stretching curve and exhibits macro-iteration convergence comparable to that of L-BFGS-based orbital optimization.
High Resolution Image Download MS PowerPoint Slide Quantum computers have the potential to efficiently solve the electronic structure problem but are currently limited by noise and shallow circuits. We present an enhanced Variational Quantum Eigensolver (VQE) ansatz based on the Qubit Coupled Cluster (QCC) approach that requires optimization of only n parameters, where n is the number of Pauli string generators, rather than the typical n + 2 m parameters, where m is the number of qubits. We evaluate the ground state energies and molecular dissociation curves of strongly correlated molecules, namely O 3 and Li 4, using active spaces of varying sizes in conjunction with our enhanced QCC ansatz, Unitary Coupled Cluster Single–Double (UCCSD) ansatz, and the classical Coupled Cluster Singles and Doubles (CCSD) method. Compared to UCCSD, our approach significantly reduces the number of parameters while maintaining high accuracy. Numerical simulations demonstrate the effectiveness of our approach, and experiments on superconducting and trapped-ion quantum computers showcase its practicality on real hardware. By eliminating the need for symmetry-restoring gates and reducing the number of parameters, our enhanced QCC ansatz enables accurate quantum chemistry calculations on near-term quantum devices for strongly correlated systems.
We present a novel approach for efficient preparation of electronic ground states, leveraging the optimizer ExcitationSolve [Jäger et al., Comm. Phys. (2025)] and established variational quantum eigensolver-based operator selection methods, such as Energy Sorting (ES). By combining these tools, we demonstrate a computationally efficient protocol that enables the construction of an approximate ground state from a unitary coupled cluster ansatz via a single sweep over the operator pool. Utilizing efficient classical pre-processing to select the majority of relevant operators, this approach reduces the computational complexity associated with traditional variational quantum eigensolver (VQE) optimization methods. We further show that second-order Epstein-Nesbet (EN2) perturbation theory emerges as the first-order Taylor expansion of our protocol in terms of a correlation measure, clarifying why our approach provides a more robust initial guess for the ground state in strongly correlated regimes. We also find that second-order Møller-Plesset perturbation (MP2) theory, which is widely used for unitary coupled cluster (UCC) initialization, performs worse than both EN2 and our protocol. Furthermore, we show that our method can be seamlessly integrated with one-variational-parameter couple exchange operators, thereby further reducing the number of required CNOT operations. Overall, we empirically observe a quadratic convergence speedup beyond state-of-the-art methods, advancing the preparation of high-fidelity electronic ground states - one of the cornerstones of meaningful electronic structure calculations in the noisy intermediate-scale quantum computing (NISQ) era, and a prerequisite for fault-tolerant quantum computing (FTQC) algorithms such as quantum phase estimation.