Efficient arbitrary simultaneously entangling gates on a trapped-ion quantum computer
Nikodem Grzesiak, R. Blümel, Kenneth Wright, Kristin M. Beck, Neal C. Pisenti, Ming Li, V. Chaplin, Jason Amini, Shantanu Debnath, Jwo-Sy Chen, Yunseong Nam
Abstract
Efficiently entangling pairs of qubits is essential to fully harness the power of quantum computing. Here, we devise an exact protocol that simultaneously entangles arbitrary pairs of qubits on a trapped-ion quantum computer. The protocol requires classical computational resources polynomial in the system size, and very little overhead in the quantum control compared to a single-pair case. We demonstrate an exponential improvement in both classical and quantum resources over the current state of the art. We implement the protocol on a software-defined trapped-ion quantum computer, where we reconfigure the quantum computer architecture on demand. Our protocol may also be extended to a wide variety of other quantum computing platforms.