Efficient symmetry-preserving state preparation circuits for the variational quantum eigensolver algorithm

• Published in: npj quantum information 2020-01, Vol.6 (1), Article 10
• Main Authors: Gard, Bryan T., Zhu, Linghua, Barron, George S., Mayhall, Nicholas J., Economou, Sophia E., Barnes, Edwin
• Format: Article
• Language: English
• Subjects: 639/766/483/2802; 639/766/483/481; 639/766/483/640; Algorithms; Circuits; Classical and Quantum Gravitation; CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSICS; Physics; Physics and Astronomy; Quantum Computing; Quantum Field Theories; Quantum Information Technology; Quantum Physics; Relativity Theory; Spintronics; String Theory
• ISSN: 2056-6387; 2056-6387
• DOI: 10.1038/s41534-019-0240-1

The variational quantum eigensolver is one of the most promising approaches for performing chemistry simulations using noisy intermediate-scale quantum (NISQ) processors. The efficiency of this algorithm depends crucially on the ability to prepare multi-qubit trial states on the quantum processor that either include, or at least closely approximate, the actual energy eigenstates of the problem being simulated while avoiding states that have little overlap with them. Symmetries play a central role in determining the best trial states. Here, we present efficient state preparation circuits that respect particle number, total spin, spin projection, and time-reversal symmetries. These circuits contain the minimal number of variational parameters needed to fully span the appropriate symmetry subspace dictated by the chemistry problem while avoiding all irrelevant sectors of Hilbert space. We show how to construct these circuits for arbitrary numbers of orbitals, electrons, and spin quantum numbers, and we provide explicit decompositions and gate counts in terms of standard gate sets in each case. We test our circuits in quantum simulations of the H 2 and L i H molecules and find that they outperform standard state preparation methods in terms of both accuracy and circuit depth.