Fetching the paper…
Reading the bibliography…
Google's recent quantum supremacy experiment heralded a transition point where quantum computing performed a computational task, random circuit sampling, that is beyond the practical reach of modern supercomputers.
1909
Earlier work this paper cites.
1910
Earlier work this paper cites.
1910
Earlier work this paper cites.
R.P. Feynman, “Simulating Physics with Computers,” International Journal of Theoretical Physics 21
1982
Earlier work this paper cites.
Seth Lloyd, “Universal quantum simulators,” Science 273
1996
Earlier work this paper cites.
P. Shor, “Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer,” SIAM Journal on Computing 26
1997
Earlier work this paper cites.
Daniel A. Lidar and Haobin Wang, “Calculating the thermal rate constant with exponential speedup on a quantum computer,” Physical Review E 59
1999
Earlier work this paper cites.
2002
Earlier work this paper cites.
Daniel A Lidar, “On the quantum computational complexity of the Ising spin glass partition function and of knot invariants,” New Journal of Physics 6
2004
Earlier work this paper cites.
2005
Earlier work this paper cites.
Alán Aspuru-Guzik, Anthony D. Dutoi, Peter J. Love, and Martin Head-Gordon, “Simulated quantum computation of molecular energies,” Science 309
2005
Earlier work this paper cites.
Robert Raussendorf and Jim Harrington, “Fault-tolerant quantum computation with high threshold in two dimensions,” Physical Review Letters 98
2007
Earlier work this paper cites.
Igor L Markov and Yaoyun Shi, “Simulating quantum computation by contracting tensor networks,” SIAM Journal on Computing 38
2008
Earlier work this paper cites.
Aram W. Harrow, Avinatan Hassidim, and Seth Lloyd, “Quantum algorithm for linear systems of equations,” Physical Review Letters 103
2009
Earlier work this paper cites.
Leonardo DiCarlo, Jerry M Chow, Jay M Gambetta, Lev S Bishop, Blake R Johnson, DI Schuster, J Majer, Alexandre Blais, Luigi Frunzio, SM Girvin, et al. , “Demonstration of two-qubit algorithms with a superconducting quantum processor,” Nature 460
2009
Earlier work this paper cites.
Joseph Geraci and Daniel A Lidar, “Classical Ising model test for quantum circuits,” New J. of Phys. 12
2010
Earlier work this paper cites.
John Preskill, “Quantum computing and the entanglement frontier,” arXiv:1203.5813 (2012)
2012
Earlier work this paper cites.
Jerry M Chow, Jay M Gambetta, AD Córcoles, Seth T Merkel, John A Smolin, Chad Rigetti, S Poletto, George A Keefe, Mary B Rothwell, JR Rozen, et al. , “Universal quantum gate set approaching fault-tolerant thresholds with superconducting qubits,” Physical review letters 109
2012
Earlier work this paper cites.
Austin G. Fowler, Matteo Mariantoni, John M. Martinis, and Andrew N. Cleland, “Surface codes: Towards practical large-scale quantum computation,” Phys. Rev. A 86
2012
Cited alongside, same era.
D.A. Lidar and T.A. Brun, eds., Quantum Error Correction (Cambridge University Press, Cambridge, UK, 2013)
2013
Cited alongside, same era.
Yu Chen, C Neill, P Roushan, N Leung, M Fang, R Barends, J Kelly, B Campbell, Z Chen, B Chiaro, et al. , “Qubit architecture with high coherence and fast tunable coupling,” Physical review letters 113
2014
Cited alongside, same era.
Rami Barends, Julian Kelly, Anthony Megrant, Andrzej Veitia, Daniel Sank, Evan Jeffrey, Ted C White, Josh Mutus, Austin G Fowler, Brooks Campbell, et al. , “Superconducting quantum circuits at the surface code threshold for fault tolerance,” Nature 508
2014
Cited alongside, same era.
C. Neill, P. Roushan, K. Kechedzhi, S. Boixo, S. V. Isakov, V. Smelyanskiy, A. Megrant, B. Chiaro, A. Dunsworth, K. Arya, R. Barends, B. Burkett, Y. Chen, Z. Chen, A. Fowler, B. Foxen, M. Giustina, R. Graff, E. Jeffrey, T. Huang, J. Kelly, P. Klimov, E. Lucero, J. Mutus, M. Neeley, C. Quintana, D. Sank, A. Vainsencher, J. Wenner, T. C. White, H. Neven, and J. M. Martinis, “A blueprint for demonstrating quantum supremacy with superconducting qubits,” Science 360
2018
Later among the works it cites.
Adam Bouland, Bill Fefferman, Chinmay Nirkhe, and Umesh Vazirani, “On the complexity and verification of quantum random circuit sampling,” Nature Physics (2018), 10.1038/s41567-018-0318-2
2018
Later among the works it cites.
John Preskill, “Quantum Computing in the NISQ era and beyond,” Quantum 2
2018
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Troels F. Rønnow, Zhihui Wang, Joshua Job, Sergio Boixo, Sergei V. Isakov, David Wecker, John M. Martinis, Daniel A. Lidar, and Matthias Troyer, “Defining and detecting quantum speedup,” Science 345
2014
Cited alongside, same era.
Dave Wecker, Matthew B. Hastings, Nathan Wiebe, Bryan K. Clark, Chetan Nayak, and Matthias Troyer, “Solving strongly correlated electron models on a quantum computer,” Physical Review A 92
2015
Cited alongside, same era.
Sarah Sheldon, Easwar Magesan, Jerry M Chow, and Jay M Gambetta, “Procedure for systematically tuning up cross-talk in the cross-resonance gate,” Physical Review A 93
2016
Cited alongside, same era.
Vasil S. Denchev, Sergio Boixo, Sergei V. Isakov, Nan Ding, Ryan Babbush, Vadim Smelyanskiy, John Martinis, and Hartmut Neven, “What is the computational value of finite-range tunneling?” Phys. Rev. X 6
2016
Cited alongside, same era.
Scott Aaronson and Lijie Chen, “Complexity-Theoretic Foundations of Quantum Supremacy Experiments,” in 32nd Computational Complexity Conference (CCC 2017) , Leibniz International Proceedings in Informatics (LIPIcs), Vol. 79, edited by Ryan O’Donnell (Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany, 2017) pp. 22:1–22:67
2017
Cited alongside, same era.
Aram W. Harrow and Ashley Montanaro, “Quantum computational supremacy,” Nature 549
2017
Cited alongside, same era.
2017
Cited alongside, same era.
Markus Reiher, Nathan Wiebe, Krysta M. Svore, Dave Wecker, and Matthias Troyer, “Elucidating reaction mechanisms on quantum computers,” Proceedings of the National Academy of Sciences , 201619152 (2017)
2017
Cited alongside, same era.
2018
Later among the works it cites.
Dominic W. Berry, Mária Kieferová, Artur Scherer, Yuval R. Sanders, Guang Hao Low, Nathan Wiebe, Craig Gidney, and Ryan Babbush, “Improved techniques for preparing eigenstates of fermionic hamiltonians,” npj Quantum Information 4
2018
Later among the works it cites.
Zhang Jiang, Kevin J. Sung, Kostyantyn Kechedzhi, Vadim N. Smelyanskiy, and Sergio Boixo, “Quantum algorithms to simulate many-body physics of correlated fermions,” Physical Review Applied 9
2018
Later among the works it cites.
Dominik Hangleiter, Juan Bermejo-Vega, Martin Schwarz, and Jens Eisert, “Anticoncentration theorems for schemes showing a quantum speedup,” Quantum 2
2018
Later among the works it cites.
2018
Later among the works it cites.
Tameem Albash and Daniel A. Lidar, “Demonstration of a scaling advantage for a quantum annealer over simulated annealing,” Physical Review X 8
2018
Later among the works it cites.
Salvatore Mandrà and Helmut G Katzgraber, “A deceptive step towards quantum speedup detection,” Quantum Sci. Technol. 3
2018
Later among the works it cites.
2019
Later among the works it cites.
H. De Raedt, F. Jin, D. Willsch, M. Willsch, N. Yoshioka, N. Ito, S. Yuan, and K. Michielsen, “Massively parallel quantum computer simulator, eleven years later,” Comput. Phys. Commun. 237
2019
Later among the works it cites.
Benjamin Villalonga, Sergio Boixo, Bron Nelson, Christopher Henze, Eleanor Rieffel, Rupak Biswas, and Salvatore Mandrà, “A flexible high-performance simulator for verifying and benchmarking quantum circuits implemented on real hardware,” npj Quantum Information 5
2019
Later among the works it cites.
2019
Later among the works it cites.
2019
Later among the works it cites.
Benjamin Villalonga, Dmitry Lyakh, Sergio Boixo, Hartmut Neven, Travis S Humble, Rupak Biswas, Eleanor Rieffel, Alan Ho, and Salvatore Mandra, “Establishing the quantum supremacy frontier with a 281 pflop/s simulation,” Quantum Science and Technology (2020)
2020
Closest in time.
2020
Closest in time.