Scalable randomized benchmarking of non-Clifford gates

Efficient generation of random nonsingular matrices

D. Randall · 1993

Earlier work this paper cites.

Efficient generation of random nonsingular matrices

D. Randall · 1993

Earlier work this paper cites.

Stabilizer codes and quantum error correction

D. Gottesman · 1997

Earlier work this paper cites.

Quantum computation and quantum information

M. Nielsen and I. Chuang · 2000

Earlier work this paper cites.

Scalable noise estimation with random unitary operators

J. Emerson, R. Alicki, and K. Zyczkowski · 2005

Earlier work this paper cites.

Universal quantum computation with ideal Clifford gates and noisy ancillas

S. Bravyi and A. Kitaev · 2005

Earlier work this paper cites.

Fault-tolerant quantum computation with high threshold in two dimensions

R. Raussendorf and J. Harrington · 2007

Earlier work this paper cites.

Topological computation without braiding

H. Bombin and M. Martin-Delgado · 2007

Earlier work this paper cites.

Randomized benchmarking of quantum gates

E. Knill, D. Leibfried, R. Reichle, J. Britton, R. Blakestad, J. Jost, C. Langer, R. Ozeri, S. Seidelin, and D. Wineland · 2008

Earlier work this paper cites.

An introduction to quantum error correction and fault-tolerant quantum computation

Original

D. Gottesman · 2009

Cited alongside, same era.

Exact and approximate unitary 2-designs and their application to fidelity estimation

C. Dankert, R. Cleve, J. Emerson, and E. Livine · 2009

Cited alongside, same era.

Robust randomized benchmarking of quantum processes

E. Magesan, J. Gambetta, and J. Emerson · 2011

Cited alongside, same era.

Efficient measurement of quantum gate error by interleaved randomized benchmarking

E. Magesan, J. Gambetta, B. Johnson, C. Ryan, J. Chow, S. Merkel, M. Silva, G. Keefe, M. Rothwell, T. Ohki, M. Ketchen, and M. Steffen · 2012

Cited alongside, same era.

Randomized benchmarking of multiqubit gates

J. Gaebler, A. Meier, T. Tan, R. Bowler, Y. Lin, D. Hanneke, J. Jost, J. Home, E. Knill, D. Leibfried, and D. Wineland · 2012

Cited alongside, same era.

Rolling quantum dice with a superconducting qubit

R. Barends, J. Kelly, A. Veitia, A. Megrant, A. G. Fowler, B. Campbell, Y. Chen, Z. Chen, B. Chiaro, A. Dunsworth, I.-C. Hoi, E. Jeffrey, C. Neill, P. O’Malley, J. Mutus, C. Quintana, P. Roushan, D. Sank, J. Wenner, T. C. White, A. N. Korotkov, A. N. Cleland, and John M. Martinis · 2014

Later among the works it cites.

Repeat-until-success: Non-deterministic decomposition of single-qubit unitaries

A. Paetznick and K. Svore · 2014

Later among the works it cites.

Classical simulation complexity of extended Clifford circuits

R. Jozsa and M. Van den Nest · 2014

Later among the works it cites.

Characterization of leakage errors via randomized benchmarking

J. Wallman, M. Barnhill, and J. Emerson · 2015

Closest in time.

A complete randomized benchmarking protocol accounting for leakage errors

Original

T. Chasseur and F. Wilhelm · 2015

Closest in time.