🤖 AI Summary
This work addresses the challenge of efficiently implementing parallel entangling gates on arbitrary graph topologies in trapped-ion quantum computers by proposing a graph-agnostic parallel entangling gate scheme. Combining an independent calibration mechanism with efficient pulse synthesis techniques, the method enables high-fidelity operations across arbitrary connectivity patterns, achieving fidelities approaching those of single-pair gates. When applied to multi-chain trapped-ion architectures, the approach substantially enhances both calibration efficiency and execution speed. Experimental validation on three representative quantum algorithms demonstrates nearly linear speedup, significantly reducing overall circuit runtimes.
📝 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.