Abstract
The Unitary Coupled Cluster with Singles and Doubles (UCCSD) ansatz is a widely used kernel in quantum chemistry and variational quantum eigensolver (VQE) algorithms, but its execution on near-term superconducting quantum processors is hindered by high gate costs and limited qubit connectivity. Existing compilation approaches either adopt simultaneous synthesis, which efficiently diagonalizes excitations but ignores connectivity, or individual synthesis, which enforces connectivity-awareness but sacrifices optimization opportunities. In this work, we propose a connectivity-aware compiler framework for UCCSD kernels that combines the efficiency of simultaneous synthesis with the practicality of connectivity constraints. First, we introduce blockwise qubit mapping, which groups program qubits into excitation-specific blocks and maps them to internally connected regions of the hardware graph. Second, we design connectivity-aware synthesis rules that diagonalize excitations directly on the mapped hardware graph, reducing the number of SWAP gates. We implement our framework and evaluate it on molecular and random UCCSD kernels using Google Sycamore’s and IBMQ Manhattan’s connectivity. Compared with state-of-the-art compilers, our approach reduces CNOT count by up to 34% and circuit depth by 49%, while improving VQE accuracy under noise.
Funding Information
  • Quantum Science and Technology-National Science and Technology Major Project (2021ZD0302300)
  • National Natural Science Foundation of China (62272434)

This publication has 25 references indexed in Scilit: