Efficient quantum programming using EASE gates on a trapped-ion quantum computer

TL;DR

This paper demonstrates how EASE gates on trapped-ion quantum computers enable efficient implementation of complex quantum circuits, significantly reducing gate counts for key operations, with implications for quantum chemistry and algorithms.

Contribution

It introduces methods to implement large-scale quantum circuits efficiently using EASE gates, highlighting their versatility and parallelism in trapped-ion systems.

Findings

$n$-qubit Clifford circuits can be implemented with $6\, ext{log}(n)$ EASE gates

$n$-qubit multiply-controlled NOT gates require $3n/2$ EASE gates

$n$-qubit permutations can be done with six EASE gates

Abstract

Parallel operations in conventional computing have proven to be an essential tool for efficient and practical computation, and the story is not different for quantum computing. Indeed, there exists a large body of works that study advantages of parallel implementations of quantum gates for efficient quantum circuit implementations. Here, we focus on the recently invented efficient, arbitrary, simultaneously entangling (EASE) gates, available on a trapped-ion quantum computer. Leveraging its flexibility in selecting arbitrary pairs of qubits to be coupled with any degrees of entanglement, all in parallel, we show an $n$-qubit Clifford circuit can be implemented using $6\log(n)$ EASE gates, an $n$-qubit multiply-controlled NOT gate can be implemented using $3n/2$ EASE gates, and an $n$-qubit permutation can be implemented using six EASE gates. We discuss their implications to near-term quantum chemistry simulations and the state of the art pattern matching algorithm. Given Clifford + multiply-controlled NOT gates form a universal gate set for quantum computing, our results imply efficient quantum computation by EASE gates, in general.