Fetching the paper…
Reading the bibliography…
We propose a very large family of benchmarks for probing the performance of quantum computers.
Algorithms for quantum computation: Discrete logarithms and factoring
Peter W Shor · 1994
Earlier work this paper cites.
Seth Lloyd · 1996
Earlier work this paper cites.
Quantum mechanics helps in searching for a needle in a haystack
Lov K Grover · 1997
Earlier work this paper cites.
Quantum algorithms revisited
Richard Cleve, Artur Ekert, Chiara Macchiavello, and Michele Mosca · 1998
Earlier work this paper cites.
Fast parallel circuits for the quantum Fourier transform
Richard Cleve and John Watrous · 2000
Earlier work this paper cites.
The LINPACK benchmark: past, present and future
Jack J Dongarra, Piotr Luszczek, and Antoine Petitet · 2003
Earlier work this paper cites.
Scalable noise estimation with random unitary operators
Joseph Emerson, Robert Alicki, and Karol Życzkowski · 2005
Earlier work this paper cites.
Symmetrized characterization of noisy quantum processes
Joseph Emerson, Marcus Silva, Osama Moussa, Colm Ryan, Martin Laforest, Jonathan Baugh, David G Cory, and Raymond Laflamme · 2007
Earlier work this paper cites.
Randomized benchmarking of quantum gates
Emanuel Knill, Dietrich Leibfried, et al · 2008
Earlier work this paper cites.
Fast scramblers
Yasuhiro Sekino and Leonard Susskind · 2008
Earlier work this paper cites.
Scalable and robust randomized benchmarking of quantum processes
Easwar Magesan, Jay M Gambetta, and Joseph Emerson · 2011
Earlier work this paper cites.
Characterizing quantum gates via randomized benchmarking
Easwar Magesan, Jay M Gambetta, and Joseph Emerson · 2012
Earlier work this paper cites.
Characterization of addressability by simultaneous randomized benchmarking
Jay M Gambetta, Antonio D Córcoles, et al · 2012
Earlier work this paper cites.
When quantum tomography goes wrong: drift of quantum sources and other errors
Steven J van Enk and Robin Blume-Kohout · 2013
Earlier work this paper cites.
Superconducting quantum circuits at the surface code threshold for fault tolerance
Rami Barends, Julian Kelly, et al · 2014
Earlier work this paper cites.
A variational eigenvalue solver on a photonic quantum processor
Alberto Peruzzo, Jarrod McClean, et al · 2014
Cited alongside, same era.
State preservation by repetitive error detection in a superconducting quantum circuit
Julian Kelly, Rami Barends, et al · 2015
Cited alongside, same era.
Introduction to quantum gate set tomography
Daniel Greenbaum · 2015
Cited alongside, same era.
Robust calibration of a universal single-qubit gate set via robust phase estimation
Shelby Kimmel, Guang Hao Low, and Theodore J Yoder · 2015
Cited alongside, same era.
Performing quantum computing experiments in the cloud
Simon J Devitt · 2016
Cited alongside, same era.
Demonstration of a small programmable quantum computer with atomic qubits
A blueprint for demonstrating quantum supremacy with superconducting qubits
Charles Neill, Pedran Roushan, et al · 2018
Later among the works it cites.
Validating quantum computers using randomized model circuits
Andrew W Cross, Lev S Bishop, Sarah Sheldon, Paul D Nation, and Jay M Gambetta · 2019
Closest in time.
[Online], 2018
IonQ press release · 2019
Closest in time.
[Online], 2019a
IBM Q “Tokyo” Specifications · 2019
Closest in time.
Quantum supremacy using a programmable superconducting processor
Frank Arute, Kunal Arya, et al · 2019
Closest in time.
[Online], 2019b
IBM news room · 2019
Closest in time.
(private communication, 2019)
Joseph Emerson · 2019
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
S Debnath, N M Linke, C Figgatt, K A Landsman, K Wright, and C Monroe · 2016
Cited alongside, same era.
Local random quantum circuits are approximate Polynomial-Designs
Fernando G S L Brandão, Aram W Harrow, and Michał Horodecki · 2016
Cited alongside, same era.
Optimization of a solid-state electron spin qubit using gate set tomography
Juan P Dehollain, Juha T Muhonen, Robin Blume-Kohout, Kenneth M Rudinger, John King Gamble, Erik Nielsen, Arne Laucht, Stephanie Simmons, Rachpon Kalra, Andrew S Dzurak, and Andrea Morello · 2016
Cited alongside, same era.
Complexity-Theoretic foundations of quantum supremacy experiments
Scott Aaronson and Lijie Chen · 2016
Cited alongside, same era.
Experimental comparison of two quantum computing architectures
Norbert M Linke, Dmitri Maslov, Martin Roetteler, Shantanu Debnath, Caroline Figgatt, Kevin A Landsman, Kenneth Wright, and Christopher Monroe · 2017
Cited alongside, same era.
Demonstration of qubit operations below a rigorous fault tolerance threshold with gate set tomography
Robin Blume-Kohout, John King Gamble, Erik Nielsen, Kenneth Rudinger, Jonathan Mizrahi, Kevin Fortier, and Peter Maunz · 2017
Cited alongside, same era.
Benchmarking into the future
Joseph Emerson · 2017
Cited alongside, same era.
Closest in time.
Is the ‘Quantum Volume’ a fair metric for future, elaborate, high value quantum computations?
Lev Bishop · 2019
Closest in time.
Probing Context-Dependent errors in quantum processors
Kenneth Rudinger, Timothy Proctor, Dylan Langharst, Mohan Sarovar, Kevin Young, and Robin Blume-Kohout · 2019
Closest in time.
Randomized benchmarking under different gate sets
Kristine Boone, Arnaud Carignan-Dugas, Joel J Wallman, and Joseph Emerson · 2019
Closest in time.
Direct randomized benchmarking for multiqubit devices
Timothy J Proctor, Arnaud Carignan-Dugas, Kenneth Rudinger, Erik Nielsen, Robin Blume-Kohout, and Kevin Young · 2019
Closest in time.
On the complexity and verification of quantum random circuit sampling
Adam Bouland, Bill Fefferman, Chinmay Nirkhe, and Umesh Vazirani · 2019
Closest in time.
Time-domain characterization and correction of on-chip distortion of control pulses in a quantum processor
M A Rol, L Ciorciaro, F K Malinowski, B M Tarasinski, R E Sagastizabal, C C Bultink, Y Salathe, N Haandbaek, J Sedivy, and L DiCarlo · 2020
Closest in time.
Idle Tomography
Robin Blume-Kohout et al · 2020
Closest in time.
Characterizing large-scale quantum computers via cycle benchmarking
Alexander Erhard, Joel J Wallman, Lukas Postler, Michael Meth, Roman Stricker, Esteban A Martinez, Philipp Schindler, Thomas Monz, Joseph Emerson, and Rainer Blatt · 2041
Closest in time.