7.4QUANT-PHApr 28
Arbitrary parallel entangling gates with independent calibration on a trapped ion quantum computerMatthew Diaz, Masoud Mohammadi-Arzanagh, Yingyue Zhu et al.
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.
1.2QUANT-PHApr 17, 2025
Featuremetric benchmarking: Quantum computer benchmarks based on circuit featuresTimothy Proctor, Anh Tran, Xingxin Liu et al.
Benchmarks that concisely summarize the performance of many-qubit quantum computers are essential for measuring progress towards the goal of useful quantum computation. In this work, we present a benchmarking framework that is based on quantifying how a quantum computer's performance on quantum circuits varies as a function of features of those circuits, such as circuit depth, width, two-qubit gate density, problem input size, or algorithmic depth. Our featuremetric benchmarking framework generalizes volumetric benchmarking -- a widely-used methodology that quantifies performance versus circuit width and depth -- and we show that it enables richer and more faithful models of quantum computer performance. We demonstrate featuremetric benchmarking with example benchmarks run on IBM Q and IonQ systems of up to 27 qubits, and we show how to produce performance summaries from the data using Gaussian process regression. Our data analysis methods are also of interest in the special case of volumetric benchmarking, as they enable the creation of intuitive two-dimensional capability regions using data from few circuits.