Fetching the paper…
Reading the bibliography…
A quantum computer has now solved a specialized problem believed to be intractable for supercomputers, suggesting that quantum processors may soon outperform supercomputers on scientifically important problems.
1907
Earlier work this paper cites.
W Kohn and JM Luttinger, “Quantum theory of electrical transport phenomena,” Physical Review 108
1957
Earlier work this paper cites.
Yoav Benjamini and Yosef Hochberg, “Controlling the false discovery rate: a practical and powerful approach to multiple testing,” J. Roy. Statist. Soc. Ser. B , 289–300 (1995)
1995
Earlier work this paper cites.
Michael A Nielsen, “A simple formula for the average gate fidelity of a quantum dynamical operation,” Phys. Lett. A 303
2002
Earlier work this paper cites.
Scott Aaronson and Daniel Gottesman, “Improved simulation of stabilizer circuits,” Phys. Rev. A 70
2004
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.
Emanuel Knill, “Quantum computing with realistically noisy devices,” Nature 434
2005
Earlier work this paper cites.
Erich L Lehmann and Joseph P Romano, Testing statistical hypotheses (Springer Science & Business Media, 2006)
2006
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.
David Gross, Koenraad Audenaert, and Jens Eisert, “Evenly distributed unitaries: on the structure of unitary designs,” J. Math. Phys. 48
2007
Earlier work this paper cites.
Emanuel Knill, D Leibfried, R Reichle, J Britton, RB Blakestad, JD Jost, C Langer, R Ozeri, S Seidelin, and DJ Wineland, “Randomized benchmarking of quantum gates,” Phys. Rev. A 77
2008
Earlier work this paper cites.
Gavin E Crooks, “Quantum operation time reversal,” Phys. Rev. A 77
2008
Earlier work this paper cites.
Christoph Dankert, Richard Cleve, Joseph Emerson, and Etera Livine, “Exact and approximate unitary 2-designs and their application to fidelity estimation,” Phys. Rev. A 80
2009
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.
Jay M Gambetta, AD Córcoles, Seth T Merkel, Blake R Johnson, John A Smolin, Jerry M Chow, Colm A Ryan, Chad Rigetti, S Poletto, Thomas A Ohki, et al. , “Characterization of addressability by simultaneous randomized benchmarking,” Phys. Rev. Lett. 109
2012
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.
Richard Kueng, David M Long, Andrew C Doherty, and Steven T Flammia, “Comparing experiments to the fault-tolerance threshold,” Phys. Rev. Lett. 117
2016
Cited alongside, same era.
Joel J Wallman and Joseph Emerson, “Noise tailoring for scalable quantum computation via randomized compiling,” Phys. Rev. A 94
2016
Cited alongside, same era.
Norbert M Linke, Dmitri Maslov, Martin Roetteler, Shantanu Debnath, Caroline Figgatt, Kevin A Landsman, Kenneth Wright, and Christopher Monroe, “Experimental comparison of two quantum computing architectures,” Proc. Natl. Acad. Sci. U.S.A. 114
2017
Cited alongside, same era.
Aram W Harrow and Ashley Montanaro, “Quantum computational supremacy,” Nature 549
2017
Cited alongside, same era.
Robin Blume-Kohout, John King Gamble, Erik Nielsen, Kenneth Rudinger, Jonathan Mizrahi, Kevin Fortier, and Peter Maunz, “Demonstration of qubit operations below a rigorous fault tolerance threshold with gate set tomography,” Nat. Commun. 8
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
Later among the works it cites.
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
Later among the works it cites.
K Wright, KM Beck, S Debnath, JM Amini, Y Nam, N Grzesiak, J-S Chen, NC Pisenti, M Chmielewski, C Collins, et al. , “Benchmarking an 11-qubit quantum computer,” Nat. Commun. 10
2019
Later among the works it cites.
2019
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2017
Cited alongside, same era.
The structure in algorithm circuits can be reduced using a variety of randomization techniques Wallman and Emerson 2016 ; Campbell 2017 , but it is not possible to remove all structure in algorithm circuits
2017
Cited alongside, same era.
Earl Campbell, “Shorter gate sequences for quantum computing by mixing unitaries,” Phys. Rev. A 95
2017
Cited alongside, same era.
Timothy Proctor, Kenneth Rudinger, Kevin Young, Mohan Sarovar, and Robin Blume-Kohout, “What randomized benchmarking actually measures,” Phys. Rev. Lett. 119
2017
Cited alongside, same era.
John Preskill, “Quantum computing in the NISQ era and beyond,” Quantum 2
2018
Cited alongside, same era.
C Neill, P Roushan, K Kechedzhi, S Boixo, SV Isakov, V Smelyanskiy, A Megrant, B Chiaro, A Dunsworth, K Arya, et al. , “A blueprint for demonstrating quantum supremacy with superconducting qubits,” Science 360
2018
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.
S Mavadia, CL Edmunds, C Hempel, H Ball, F Roy, TM Stace, and MJ Biercuk, “Experimental quantum verification in the presence of temporally correlated noise,” NPJ Quantum Inf. 4
2018
Cited alongside, same era.
2019
Later among the works it cites.
Eric Huang, Andrew C Doherty, and Steven Flammia, “Performance of quantum error correction with coherent errors,” Phys. Rev. A 99
2019
Later among the works it cites.
Daniel C Murphy and Kenneth R Brown, “Controlling error orientation to improve quantum algorithm success rates,” Phys. Rev. A 99
2019
Later among the works it cites.
IBM Q team, “IBM Q Experience,” https://quantum-computing.ibm.com, Last Accessed: 2019-09
2019
Later among the works it cites.
Rigetti Computing, “Quantum cloud services,” (2019), https://www.rigetti.com/qcs, Last Accessed: 09-17
2019
Later among the works it cites.
2019
Later among the works it cites.
2019
Later among the works it cites.
Kenneth Rudinger, Timothy Proctor, Dylan Langharst, Mohan Sarovar, Kevin Young, and Robin Blume-Kohout, “Probing context-dependent errors in quantum processors,” Phys. Rev. X 9
2019
Later among the works it cites.
2019
Later among the works it cites.
2019
Later among the works it cites.
Adam Holmes, Sonika Johri, Gian Giacomo Guerreschi, James S Clarke, and Anne Y Matsuura, “Impact of qubit connectivity on quantum algorithm performance,” Quantum Science and Technology 5
2020
Closest in time.