Litcius/Paper detail

Fully Scalable Randomized Benchmarking Without Motion Reversal

Jordan Hines, Daniel Hothem, Robin Blume-Kohout, Birgitta Whaley, Timothy Proctor

2024PRX Quantum11 citationsDOIOpen Access PDF

Abstract

We introduce , 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. Published by the American Physical Society 2024

Topics & Concepts

Electronic circuitQubitComputer scienceScalabilityPauli exclusion principleOperator (biology)Set (abstract data type)MathematicsTopology (electrical circuits)Theoretical computer scienceQuantum mechanicsPhysicsCombinatoricsDatabaseTranscription factorProgramming languageQuantumChemistryBiochemistryRepressorGeneQuantum Computing Algorithms and ArchitectureMagnetic properties of thin filmsStochastic Gradient Optimization Techniques
Fully Scalable Randomized Benchmarking Without Motion Reversal | Litcius