Scalable and Robust Randomized Benchmarking of Quantum Processes

Easwar Magesan, J. M. Gambetta, and Joseph Emerson
Phys. Rev. Lett. 106, 180504 – Published 6 May 2011

Abstract

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.

  • Figure
  • Received 19 September 2010

DOI:https://doi.org/10.1103/PhysRevLett.106.180504

© 2011 American Physical Society

Authors & Affiliations

Easwar Magesan, J. M. Gambetta, and Joseph Emerson

  • Institute for Quantum Computing and Department of Applied Mathematics, University of Waterloo, Waterloo, Ontario N2L 3G1, Canada

Article Text (Subscription Required)

Click to Expand

References (Subscription Required)

Click to Expand
Issue

Vol. 106, Iss. 18 — 6 May 2011

Reuse & Permissions
Access Options
Author publication services for translation and copyediting assistance advertisement

Authorization Required


×
×

Images

×

Sign up to receive regular email alerts from Physical Review Letters

Log In

Cancel
×

Search


Article Lookup

Paste a citation or DOI

Enter a citation
×