Search

Hückel molecular orbital (HMO) theory provides a semi-empirical treatment of the electronic structure in conjugated π-electronic systems. A scalable system-agnostic execution of HMO theory on a quantum computer is reported here based on a variational quantum deflation (VQD) algorithm for excited state quantum simulation. A compact encoding scheme is proposed here that provides an exponential advantage over the direct mapping and allows for quantum simulation of the HMO model for systems with up to 2n conjugated centers with n qubits. The transformation of the Hückel Hamiltonian to qubit space is achieved by two different strategies: an iterative refinement transformation and the Frobenius-inner-product-based transformation. These methods are tested on a series of linear, cyclic, and hetero-nuclear conjugated π-electronic systems. The molecular orbital energy levels and wavefunctions from the quantum simulation are in excellent agreement with the exact classical results. However, the higher excited states of large systems are found to suffer from error accumulation in the VQD simulation. This is mitigated by formulating a variant of VQD that exploits the symmetry of the Hamiltonian. This strategy has been successfully demonstrated for the quantum simulation of C60 fullerene containing 680 Pauli strings encoded on six qubits. The methods developed in this work are easily adaptable to similar problems of different complexity in other fields of research. [ABSTRACT FROM AUTHOR]

Classical optimizers play a crucial role in determining the accuracy and convergence of variational quantum algorithms; leading algorithms use a near-term quantum computer to solve the ground state properties of molecules, simulate dynamics of different quantum systems, and so on. In the literature, many optimizers, each having its own architecture, have been employed expediently for different applications. In this work, we consider a few popular and efficacious optimizers and assess their performance in variational quantum algorithms for applications in quantum chemistry in a realistic noisy setting. We benchmark the optimizers with critical analysis based on quantum simulations of simple molecules, such as hydrogen, lithium hydride, beryllium hydride, water, and hydrogen fluoride. The errors in the ground state energy, dissociation energy, and dipole moment are the parameters used as yardsticks. All the simulations were carried out with an ideal quantum circuit simulator, a noisy quantum circuit simulator, and finally a noisy simulator with noise embedded from the IBM Cairo quantum device to understand the performance of the classical optimizers in ideal and realistic quantum environments. We used the standard unitary coupled cluster ansatz for simulations, and the number of qubits varied from two starting from the hydrogen molecule to ten qubits in hydrogen fluoride. Based on the performance of these optimizers in the ideal quantum circuits, the conjugate gradient, limited-memory Broyden—Fletcher—Goldfarb—Shanno bound, and sequential least squares programming optimizers are found to be the best-performing gradient-based optimizers. While constrained optimization by linear approximation (COBYLA) and Powell's conjugate direction algorithm for unconstrained optimization (POWELL) perform most efficiently among the gradient-free methods, in noisy quantum circuit conditions, simultaneous perturbation stochastic approximation, POWELL, and COBYLA are among the best-performing optimizers. [ABSTRACT FROM AUTHOR]