Fetching the paper…
Reading the bibliography…
Quantum processors are now able to run quantum circuits that are infeasible to simulate classically, creating a need for benchmarks that assess a quantum processor's rate of errors when running these circuits.
Lorenza Viola, Emanuel Knill, and Seth Lloyd, “Dynamical decoupling of open quantum systems,” Phys. Rev. Lett. 82
1999
Earlier work this paper cites.
2003
Earlier work this paper cites.
Joseph Emerson, Robert Alicki, and Karol Życzkowski, “Scalable noise estimation with random unitary operators,” J. Opt. B Quantum Semiclass. Opt. 7
2005
Earlier work this paper cites.
Joseph Emerson, Marcus Silva, Osama Moussa, Colm Ryan, Martin Laforest, Jonathan Baugh, David G Cory, and Raymond Laflamme, “Symmetrized characterization of noisy quantum processes,” Science 317
2007
Earlier work this paper cites.
Easwar Magesan, Jay M Gambetta, and Joseph Emerson, “Scalable and robust randomized benchmarking of quantum processes,” Phys. Rev. Lett. 106
2011
Earlier work this paper cites.
Steven T. Flammia and Yi-Kai Liu, “Direct fidelity estimation from few pauli measurements,” Phys. Rev. Lett. 106
2011
Earlier work this paper cites.
2011
Earlier work this paper cites.
Easwar Magesan, Jay M Gambetta, and Joseph Emerson, “Characterizing quantum gates via randomized benchmarking,” Phys. Rev. A 85
2012
Earlier work this paper cites.
Andrew W Cross, Easwar Magesan, Lev S Bishop, John A Smolin, and Jay M Gambetta, “Scalable randomised benchmarking of non-clifford gates,” NPJ Quantum Inf. 2
2016
Earlier work this paper cites.
2016
Earlier work this paper cites.
Joel J Wallman and Joseph Emerson, “Noise tailoring for scalable quantum computation via randomized compiling,” Phys. Rev. A 94
2016
Cited alongside, same era.
Sergio Boixo, Sergei V Isakov, Vadim N Smelyanskiy, Ryan Babbush, Nan Ding, Zhang Jiang, Michael J Bremner, John M Martinis, and Hartmut Neven, “Characterizing quantum supremacy in near-term devices,” Nat. Phys. 14
2018
Cited alongside, same era.
Nikolaj Moll, Panagiotis Barkoutsos, Lev S Bishop, Jerry M Chow, Andrew Cross, Daniel J Egger, Stefan Filipp, Andreas Fuhrer, Jay M Gambetta, Marc Ganzhorn, Abhinav Kandala, Antonio Mezzacapo, Peter Müller, Walter Riess, Gian Salis, John Smolin, Ivano Tavernelli, and Kristan Temme, “Quantum optimization using variational algorithms on near-term quantum devices,” Quantum Science and Technology 3
2018
Cited alongside, same era.
Timothy J Proctor, Arnaud Carignan-Dugas, Kenneth Rudinger, Erik Nielsen, Robin Blume-Kohout, and Kevin Young, “Direct randomized benchmarking for multiqubit devices,” Phys. Rev. Lett. 123
Daniel Mills, Seyon Sivarajah, Travis L. Scholten, and Ross Duncan, “Application-Motivated, Holistic Benchmarking of a Full Quantum Computing Stack,” Quantum 5
2021
Later among the works it cites.
Elijah Pelofske, Andreas Bartschi, and Stephan Eidenbenz, “Quantum volume in practice: What users can expect from NISQ devices,” IEEE Transactions on Quantum Engineering 3
2022
Later among the works it cites.
Charles H. Baldwin, Karl Mayer, Natalie C. Brown, Ciarán Ryan-Anderson, and David Hayes, “Re-examining the quantum volume test: Ideal distributions, compiler optimizations, confidence intervals, and scalable resource estimations,” Quantum 6
2022
Later among the works it cites.
2022
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2019
Cited alongside, same era.
Jonas Helsen, Xiao Xue, Lieven M. K. Vandersypen, and Stephanie Wehner, “A new class of efficient randomized benchmarking protocols,” npj Quantum Information 5
2019
Cited alongside, same era.
Frank Arute, Kunal Arya, Ryan Babbush, Dave Bacon, Joseph C Bardin, Rami Barends, Rupak Biswas, Sergio Boixo, Fernando GSL Brandao, David A Buell, et al. , “Quantum supremacy using a programmable superconducting processor,” Nature 574
2019
Cited alongside, same era.
Andrew W Cross, Lev S Bishop, Sarah Sheldon, Paul D Nation, and Jay M Gambetta, “Validating quantum computers using randomized model circuits,” Phys. Rev. A 100
2019
Cited alongside, same era.
Robin Blume-Kohout and Kevin C Young, “A volumetric framework for quantum computer benchmarks,” Quantum 4
2020
Cited alongside, same era.
Jahan Claes, Eleanor Rieffel, and Zhihui Wang, “Character randomized benchmarking for non-multiplicity-free groups with applications to subspace, leakage, and matchgate randomized benchmarking,” PRX Quantum 2
2021
Cited alongside, same era.
2021
Cited alongside, same era.
Timothy Proctor, Stefan Seritan, Kenneth Rudinger, Erik Nielsen, Robin Blume-Kohout, and Kevin Young, “Scalable randomized benchmarking of quantum computers using mirror circuits,” Phys. Rev. Lett. 129
Cited in the paper.
Jonas Helsen, Sepehr Nezami, Matthew Reagor, and Michael Walter, “Matchgate benchmarking: Scalable benchmarking of a continuous family of many-qubit gates,” Quantum 6
Cited in the paper.
We note that many compilations optimizations have been developed to improve processor performance and studied in the context of QV ( Cross et al. 2019 ; Baldwin et al. 2022 ). We do use heavily optimized classical pre-processing here, and therefore our results are not expected to reflect the optimal full-stack processor performance
2022
Later among the works it cites.
Jordan Hines, Marie Lu, Ravi K. Naik, Akel Hashim, Jean-Loup Ville, Brad Mitchell, John Mark Kriekebaum, David I. Santiago, Stefan Seritan, Erik Nielsen, Robin Blume-Kohout, Kevin Young, Irfan Siddiqi, Birgitta Whaley, and Timothy Proctor, “Demonstrating scalable randomized benchmarking of universal gate sets,” Phys. Rev. X 13
2023
Closest in time.
2023
Closest in time.
2023
Closest in time.
2023
Closest in time.
Thomas Lubinski, Sonika Johri, Paul Varosy, Jeremiah Coleman, Luning Zhao, Jason Necaise, Charles H. Baldwin, Karl Mayer, and Timothy Proctor, “Application-oriented performance benchmarks for quantum computing,” IEEE Transactions on Quantum Engineering 4
2023
Closest in time.