📝 SummarXiv

Abstract

Variational Quantum Algorithms (VQAs) are iterative algorithms suited to implementation on current-era quantum devices. VQAs employ classical optimization to minimize cost functions evaluated on quantum circuits. However, the extent to which VQAs manage noise is often insufficient for quantum chemistry applications. One method of improving VQAs is through accurate ansatz initialization. The CAFQA (Clifford Ansatz For Quantum Accuracy) protocol runs a discrete search through a classically simulatable subset of the entire state space to find a desirable initialization. Prior work has evaluated CAFQA applied to the Variational Quantum Eigensolver (VQE), a VQA that computes grounds states of a Hamiltonian. Motivated by CAFQA's success, we propose Excited-CAFQA initialization for Variational Quantum Deflation (VQD), a quantum algorithm that extends VQE by allowing the computation of excited states. VQD recursively computes excited states, by constraining the kth state to be orthogonal to the previous k-1 computed energy states via a penalty term appended to the standard VQE cost function. Just as with VQE, the VQD cost function can be efficiently computed classically for the states considered in the discrete CAFQA search, allowing for the discrete CAFQA optimizer to find good initial parameters for each energy level computation. Preliminary evaluation shows that Excited-CAFQA achieves 90 to 99+% accuracy across a variety of bond lengths and excited states for H2 and HeH+ molecular systems.