2010/09/19 by Easwar Magesan, J. M. Gambetta, Jay Gambetta +1 · 3 citations
Computer Science · Physics and Astronomy · #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum Mechanics and Applications #quant-ph
paper · pdf · doi:10.1103/physrevlett.106.180504
published as Phys. Rev. Lett. 106, 180504 (2011) · 4+ pages, 1 figure, and 1 table
arxiv created 2010/09/19 · openalex publication_date 2011/05/06 · arxiv updated 2011/06/14 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/30
In this Letter we propose a fully scalable randomized benchmarking protocol for quantum information processors. We prove that the protocol provides an efficient and reliable estimate of the average error-rate for a set operations (gates) under a very general noise model that allows for both time and gate-dependent errors. In particular we obtain a sequence of fitting models for the observable fidelity decay as a function of a (convergent) perturbative expansion of the gate errors about the mean error. We illustrate the protocol through numerical examples.