Subspace Randomized Benchmarking Prediction Protocol for the Average Gate Fidelity of Multi-Qubit Devices

Quantum computers promise an exponential speed-up over their classical counterparts for certain tasks relevant to various fields including science, technology, and finance. To unlock this potential, the technology must be scaled up and the errors at play must be reduced. As developments in scalable quantum computation devices advance, the demand for scalable benchmarking techniques that are able to reliably assess the fidelity – the complement of the error rate – of a device has increased significantly. Randomized benchmarking offers a single, concise number that reflects the average fidelity of multi-qubit operations performed on a quantum device. While this method is robust against state preparation and measurement errors, it still suffers from scalability issues. In this thesis, we present a protocol that efficiently predicts the multi-qubit fidelity obtained from randomized benchmarking by only benchmarking single- and two-qubit subspaces, greatly increasing the scalability. The protocol uses simultaneous randomized benchmarking with the aim of catching cross-talk effects while at the same time reducing the number of required benchmarking sequences. We have run numerical simulations of the protocol under two noise models, one depolarizing and one dephasing, to verify its performance. The results of these noisy simulations are promising and suggest that our protocol could offer a valuable tool on the road to developing large-scale quantum computers.