



01622nas a2200145   4500008004100000245008500041210006900126260001400195520114800209100002201357700002101379700002101400700001801421856003701439       2021                        eng d00aEfficient quantum programming using EASE gates on a trapped-ion quantum computer0 aEfficient quantum programming using EASE gates on a trappedion q  c7/15/20213 a<p>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 a n-qubit Clifford circuit can be implemented using 6log(n) EASE gates, a n-qubit multiply-controlled NOT gate can be implemented using 3n/2 EASE gates, and a 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.</p>1 aGrzesiak, Nikodem1 aMaksymov, Andrii1 aNiroula, Pradeep1 aNam, Yunseong  uhttps://arxiv.org/abs/2107.07591