A Generic Compilation Strategy for the Unitary Coupled Cluster Ansatz

Abstract

We describe a compilation strategy for Variational Quantum Eigensolver (VQE) algorithms which use the Unitary Coupled Cluster (UCC) ansatz, designed to reduce circuit depth and gate count. This is achieved by partitioning Pauli exponential terms into mutually commuting sets. These sets are then diagonalised using Clifford circuits and synthesised using the phase polynomial formalism. This strategy reduces cx depth by 75.4% on average, and by up to 89.9%, compared to naive synthesis for a variety of molecules, qubit encodings and basis sets.

26 pages. v2: Additional references added. v3 minor edits

References in corpus (31)

• Quantum Computing in the NISQ era and beyond
• Hardware-efficient Variational Quantum Eigensolver for Small Molecules and Quantum Magnets
• The theory of variational hybrid quantum-classical algorithms
• A Quantum Approximate Optimization Algorithm
• Improved Simulation of Stabilizer Circuits
• From the Quantum Approximate Optimization Algorithm to a Quantum Alternating Operator Ansatz
• Towards Practical Quantum Variational Algorithms
• A meet-in-the-middle algorithm for fast synthesis of depth-optimal quantum circuits
• Benchmarking an 11-qubit quantum computer
• Generalized Unitary Coupled Cluster Wavefunctions for Quantum Computation
• Simulating chemistry using quantum computers
• Resource-Aware Quantum Programming with General Recursion and Quantum Control
• Polynomial-time T-depth Optimization of Clifford+T circuits via Matroid Partitioning
• Measurement Optimization in the Variational Quantum Eigensolver Using a Minimum Clique Cover
• Magic State Distillation: Not as Costly as You Think
• Efficient quantum measurement of Pauli operators in the presence of finite sampling error
• Low rank representations for quantum simulation of electronic structure
• Is the Trotterized UCCSD Ansatz chemically well-defined?
• Reducing T-count with the ZX-calculus
• Measurement reduction in variational quantum algorithms
• Lowering qubit requirements for quantum simulations of fermionic systems
• Timing and resource-aware mapping of quantum circuits to superconducting processors
• staq -- A full-stack quantum processing toolkit
• On the qubit routing problem
• Ground-state energy estimation of the water molecule on a trapped ion quantum computer
• Optimising Clifford Circuits with Quantomatic
• Optimization of Clifford Circuits
• Pauli Partitioning with Respect to Gate Sets
• Term Grouping and Travelling Salesperson for Digital Quantum Simulation
• Well-conditioned multiproduct Hamiltonian simulation
• Qubit coupled cluster singles and doubles variational quantum eigensolver ansatz for electronic structure calculations

Cited by in corpus (8)

• There and back again: A circuit extraction tale
• Simulating quantum circuits with ZX-calculus reduced stabiliser decompositions
• Chemically Aware Unitary Coupled Cluster with ab initio Calculations on System Model H1: A Refrigerant Chemicals Application
• Relating Measurement Patterns to Circuits via Pauli Flow
• 2QAN: A quantum compiler for 2-local qubit Hamiltonian simulation algorithms
• AKLT-states as ZX-diagrams: diagrammatic reasoning for quantum states
• Fermihedral: On the Optimal Compilation for Fermion-to-Qubit Encoding
• Software-Hardware Co-Optimization for Computational Chemistry on Superconducting Quantum Processors