Fetching the paper…
Reading the bibliography…
Randomized benchmarking is a technique for estimating the average fidelity of a set of quantum gates.
Probability inequalities for sums of bounded random variables
Hoeffding, W · 1963
Earlier work this paper cites.
Statistical analysis of finite mixture distributions (Wiley, 1985)
Titterington, D. M., Smith, A. F. & Makov, U. E · 1985
Earlier work this paper cites.
Prescription for experimental determination of the dynamics of a quantum black box
Chuang, I. L. & Nielsen, M. A · 1997
Earlier work this paper cites.
The many proofs and applications of perron’s theorem
MacCluer, C. R · 2000
Earlier work this paper cites.
An analysis of completely-positive trace-preserving maps on m2
Ruskai, M. B., Szarek, S. & Werner, E · 2002
Earlier work this paper cites.
A simple formula for the average gate fidelity of a quantum dynamical operation
Nielsen, M. A · 2002
Earlier work this paper cites.
Representation Theory: A First Course
Fulton, W. & Harris, J · 2004
Earlier work this paper cites.
Notes on super-operator norms induced by schatten norms
Watrous, J · 2004
Earlier work this paper cites.
Scalable noise estimation with random unitary operators
Emerson, J., Alicki, R. & Życzkowski, K · 2005
Earlier work this paper cites.
C. r, e. j, livine e. exact and approximate unitary 2-designs: Constructions and applications
Dankert, C · 2006
Earlier work this paper cites.
Randomized benchmarking of quantum gates
Knill, E. et al · 2008
Earlier work this paper cites.
Randomized benchmarking and process tomography for gate errors in a solid-state qubit
Chow, J. M. et al · 2009
Earlier work this paper cites.
Symmetry, Representations, and Invariants
Goodman, R. & Wallach, N. R · 2009
Earlier work this paper cites.
Exact and approximate unitary 2-designs and their application to fidelity estimation
Dankert, C., Cleve, R., Emerson, J. & Livine, E · 2009
Earlier work this paper cites.
Quantum Computation and Quantum Information: 10th Anniversary Edition (Cambridge University Press, New York, NY, USA, 2011), 10th edn
Nielsen, M. A. & Chuang, I. L · 2011
Earlier work this paper cites.
Direct Fidelity Estimation from Few Pauli Measurements
Flammia, S. T. & Liu, Y.-K · 2011
Earlier work this paper cites.
Characterizing quantum gates via randomized benchmarking
Magesan, E., Gambetta, J. M. & Emerson, J · 2012
Earlier work this paper cites.
Randomized Benchmarking of Multiqubit Gates
Gaebler, J. P. et al · 2012
Earlier work this paper cites.
Characterizing quantum gates via randomized benchmarking
Magesan, E., Gambetta, J. M. & Emerson, J · 2012
Cited alongside, same era.
Characterization of addressability by simultaneous randomized benchmarking
Gambetta, J. M. et al · 2012
Cited alongside, same era.
Efficient measurement of quantum gate error by interleaved randomized benchmarking
Magesan, E. et al · 2012
Cited alongside, same era.
Quantum channels operations: Guided tour
Wolf, M · 2012
Cited alongside, same era.
Process verification of two-qubit quantum gates by randomized benchmarking
Córcoles, A. D. et al · 2013
Cited alongside, same era.
Accelerated Randomized Benchmarking
Granade, C., Ferrie, C. & Cory, D. G · 2014
Cited alongside, same era.
Estimating the fidelity of t gates using standard interleaved randomized benchmarking
Harper, R. & Flammia, S. T · 2017
Later among the works it cites.
Multi-qubit randomized benchmarking using few samples
Helsen, J., Wallman, J. J., Flammia, S. T. & Wehner, S · 2017
Later among the works it cites.
Randomized benchmarking with gate-dependent noise
Wallman, J. J · 2018
Closest in time.
Randomized benchmarking as convolution: Fourier analysis of gate dependent errors
Merkel, S. T., Pritchett, E. J. & Fong, B. H · 2018
Closest in time.
Randomized benchmarking with restricted gate sets
Brown, W. G. & Eastin, B · 2018
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Investigating the limits of randomized benchmarking protocols
Epstein, J. M., Cross, A. W., Magesan, E. & Gambetta, J. M · 2014
Cited alongside, same era.
Superconducting quantum circuits at the surface code threshold for fault tolerance
Barends, R. et al · 2014
Cited alongside, same era.
Robust two-qubit gates for donors in silicon controlled by hyperfine interactions
Kalra, R., Laucht, A., Hill, C. D. & Morello, A · 2014
Cited alongside, same era.
Randomized benchmarking with confidence
Wallman, J. J. & Flammia, S. T · 2014
Cited alongside, same era.
Modern quantum mechanics , vol. 261 (Pearson, 2014)
Sakurai, J. J., Napolitano, J. et al · 2014
Cited alongside, same era.
Qubit metrology of ultralow phase noise using randomized benchmarking
O’Malley, P. et al · 2015
Cited alongside, same era.
Hashagen, A., Flammia, S., Gross, D. & Wallman, J · 2018
Closest in time.
Approximate randomized benchmarking for finite groups
França, D. S. & Hashagen, A.-L · 2018
Closest in time.
Benchmarking gate fidelities in a si/sige two-qubit device
Xue, X. et al · 2018
Closest in time.
A programmable two-qubit quantum processor in silicon
Watson, T. et al · 2018
Closest in time.
Resonantly driven cnot gate for electron spins
Zajac, D. M. et al · 2018
Closest in time.
Fidelity benchmarks for two-qubit gates in silicon
Huang, W. et al · 2018
Closest in time.
A crossbar network for silicon quantum dot qubits
Li, R. et al · 2018
Closest in time.
Bayesian inference for randomized benchmarking protocols
Hincks, I., Wallman, J. J., Ferrie, C., Granade, C. & Cory, D. G · 2018
Closest in time.
Determining the capacity of any quantum computer to perform a quantum computation
Wallman, J. J. & Emerson, J · 2018
Closest in time.
Representations of the multi-qubit clifford group
Helsen, J., Wallman, J. J. & Wehner, S · 2018
Closest in time.
Fault-tolerant logical gates in the ibm quantum experience
Harper, R. & Flammia, S. T · 2019
Closest in time.
Characterizing large-scale quantum computers via cycle benchmarking
Erhard, A. et al · 2019
Closest in time.
Demonstration of two-qubit algorithms with a superconducting quantum processor
DiCarlo, L. et al · 2030
Closest in time.