Fully Scalable Randomized Benchmarking Without Motion Reversal

Jordan Hines

doi:10.1103/PRXQuantum.5.030334

Fully Scalable Randomized Benchmarking Without Motion Reversal

2024-08-15

1

OA

AI

DOI：10.1103/PRXQuantum.5.030334

Original

Original request for help

Save

Abstract

En 中文

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.

Keywords:

QUANTUM SUPREMACY

CIRCUITS

Fully Scalable Randomized Benchmarking Without Motion Reversal

Abstract

Journal

Organization