Fully Scalable Randomized Benchmarking Without Motion Reversal
Sep 10, 2023
17 pages
Published in:
- PRX Quantum 5 (2024) 3, 030334
- Published: Aug 1, 2024
e-Print:
- 2309.05147 [quant-ph]
DOI:
- 10.1103/PRXQuantum.5.030334 (publication)
View in:
Citations per year
Abstract: (APS)
We introduce binary randomized benchmarking (BiRB), a protocol that streamlines traditional RB by using circuits consisting almost entirely of independent identically distributed (IID) layers of gates. BiRB reliably and efficiently extracts the average error rate of a Clifford gate set by sending tensor-product eigenstates of random Pauli operators through random circuits with IID layers. Unlike existing RB methods, BiRB does not use motion reversal circuits—i.e., circuits that implement the identity (or a Pauli) operator—which simplifies both the method and the theory proving its reliability. Furthermore, this simplicity enables scaling BiRB to many more qubits than the most widely used RB methods.Note:
- 9 pages + appendices, 5 figures, v2: Close to published version, fixed typos in theory section
References(59)
Figures(6)
- [1]
- [2]
- [3]
- [4]
- [5]
- [6]
- [7]
- [8]
- [9]
- [10]
- [11]
- [12]
- [13]
- [14]
- [15]
- [16]
- [17]
- [18]
- [19]
- [20]
- [21]
- [22]
- [23]
- [24]
- [25]