Direct randomized benchmarking for multi-qubit devices
Timothy J. Proctor, Arnaud Carignan-Dugas, Kenneth Rudinger, Erik, Nielsen, Robin Blume-Kohout, Kevin Young

TL;DR
This paper introduces a direct randomized benchmarking protocol for multi-qubit quantum devices that avoids complex compilation, enabling efficient and scalable error rate estimation on larger systems than traditional Clifford RB.
Contribution
The authors propose a new direct RB protocol that reduces compilation complexity and extends scalable benchmarking to more qubits, demonstrated on up to 5 qubits and simulated beyond 10.
Findings
Successfully benchmarked 2-5 qubits experimentally on IBMQX5.
The protocol estimates error rates from exponential decay similar to Clifford RB.
Simulations suggest scalability to 10+ qubits with more informative error metrics.
Abstract
Benchmarking methods that can be adapted to multi-qubit systems are essential for assessing the overall or "holistic" performance of nascent quantum processors. The current industry standard is Clifford randomized benchmarking (RB), which measures a single error rate that quantifies overall performance. But scaling Clifford RB to many qubits is surprisingly hard. It has only been performed on 1, 2, and 3 qubits as of this writing. This reflects a fundamental inefficiency in Clifford RB: the -qubit Clifford gates at its core have to be compiled into large circuits over the 1- and 2-qubit gates native to a device. As grows, the quality of these Clifford gates quickly degrades, making Clifford RB impractical at relatively low . In this Letter, we propose a direct RB protocol that mostly avoids compiling. Instead, it uses random circuits over the native gates in a device, seeded…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
