Arbitrary parallel entangling gates with independent calibration on a trapped ion quantum computer
This work provides a practical method to accelerate quantum computation on trapped-ion platforms by enabling efficient parallel gate operations, which is a key step toward practical quantum advantage.
The authors demonstrate a new type of parallel entangling gates on a trapped-ion quantum computer that reduces execution time for algorithms with disjoint, star, and ring graph patterns, achieving approximately linear speedup for disjoint qubit pairs while maintaining fidelities comparable to single-pair gates.
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.