Arbitrary parallel entangling gates with independent calibration on a trapped ion quantum computer

TL;DR

This paper introduces a new type of parallel entangling gates in a trapped-ion quantum computer, enabling faster multi-qubit operations with maintained fidelity, crucial for scalable quantum computing.

Contribution

It demonstrates a novel parallel entangling gate method that reduces execution time and maintains fidelity across various graph patterns in trapped-ion systems.

Findings

Parallel gates achieve linear speed-up for disjoint qubit pairs.

Gate fidelities are comparable to single-pair gates across different graph patterns.

Reduced execution time demonstrated in three quantum algorithms.

Abstract

Parallel processing of information plays a critical role in accelerating computation. This includes quantum computers, where parallel processing of quantum information will play a critical role in practical quantum advantage. Here, we demonstrate a new type of parallel entangling gates in a trapped-ion quantum computer, that simultaneously provides efficient gate-pulse synthesis and calibration, as well as graph-pattern-agnostic implementation. We demonstrate the resulting reduced execution time in three well-known algorithms, exhibiting disjoint gates, a star graph and a ring graph respectively. For disjoint qubit pairs the execution time of our parallel gates is comparable to that of a single-pair entangling gate resulting in an approximately linear speed up. For all graph patterns our parallel gate fidelities are comparable to the fidelity of a single-pair entangling gate. These advantages motivate architectures featuring multiple medium length ion chains in future quantum computing devices.