Fig. 1 | npj Quantum Information

Fig. 1

From: A new class of efficient randomized benchmarking protocols

Fig. 1

The character randomized benchmarking protocol. Note the inclusion of the gate \(\hat G\) and the average over the character function \(\chi _{\hat \phi }\), which form the key ideas behind character randomized benchmarking. Note also that this extra gate \(\hat G\) is compiled into the sequence of gates (G1, …, Gm) and thus does not result in extra noise

Back to article page