PNNL

Abstract

We consider an assignment problem arising in Fermionic-swap based mapping of the one-body and two-body interaction terms in simulating time evolution of a sparse second-quantized electronic structure Hamiltonian on a quantum computer. Relative efficiency of different swap networks depends on the relative costs of performing a swap layer and computing a Hamiltonian interaction term. Under the assumption that the interaction term cost dominates the computation, we develop an iterative algorithm that uses hypergraph optimal linear arrangement (HOLA) and partial distance-2 coloring to exploit arbitrary sparsity in the Hamiltonian for efficient computation using swap networks. Using a set of 122 problems from computational chemistry, we demonstrate performance improvements up to 100% relative to the state-of-the-art approaches for one-body terms and up to 86% utilization for two-body terms relative to a theoretical peak utilization. To the best of our knowledge, this is the first study to exploit arbitrary sparsity in orbital interactions for efficient computation on one-dimensional qubit connectivity layouts. The proposed algorithms form the basis for extension to map general k-body interactions that arise in other domains onto generalized qubit connectivity layouts.