Fetching the paper…
Reading the bibliography…
Noisy intermediate-scale quantum computing devices are an exciting platform for the exploration of the power of near-term quantum applications.
American National Standards Institute and Information Technology Industry Council, American National Standard for Information Technology: programming language — Common LISP , American National Standards Institute, 1430 Broadway, New York, NY 10018, USA (1996), approved December 8, 1994
1994
Earlier work this paper cites.
Adriano Barenco, Charles H. Bennett, Richard Cleve, David P. DiVincenzo, Norman Margolus, Peter Shor, Tycho Sleator, John A. Smolin, and Harald Weinfurter, “Elementary gates for quantum computation,” Phys. Rev. A 52
1995
Earlier work this paper cites.
Emanuel Knill, Raymond Laflamme, and Wojciech H. Zurek, “Resilient quantum computation,” Science 279
1998
Earlier work this paper cites.
Y. LeCun, L. Bottou, Y. Bengio, and P. Haffner, “Gradient-based learning applied to document recognition,” Proceedings of the IEEE 86
1998
Earlier work this paper cites.
Bernhar Schölkopf and Alexanderd Smola, Learning with kernels : support vector machines, regularization, optimization, and beyond (MIT Press, Cambridge, Mass, 2002)
2002
Earlier work this paper cites.
Panos Aliferis, Daniel Gottesman, and John Preskill, “Quantum accuracy threshold for concatenated distance-3 codes,” Quantum Info. Comput. 6
2006
Earlier work this paper cites.
Dorit Aharonov and Michael Ben-Or, “Fault-tolerant quantum computation with constant error rate,” SIAM J. Comput. 38
2008
Earlier work this paper cites.
A. Rahimi and B. Recht, “Uniform approximation of functions with random bases,” in 2008 46th Annual Allerton Conference on Communication, Control, and Computing (2008) pp. 555–561
2008
Earlier work this paper cites.
Ali Rahimi and Benjamin Recht, “Random features for large-scale kernel machines,” in Advances in Neural Information Processing Systems 20 , edited by J. C. Platt, D. Koller, Y. Singer, and S. T. Roweis (Curran Associates, Inc., 2008) pp. 1177–1184
2008
Earlier work this paper cites.
Thomas Hofmann, Bernhard Schölkopf, and Alexander J. Smola, “Kernel methods in machine learning,” Ann. Statist. 36
2008
Earlier work this paper cites.
Aram W. Harrow, Avinatan Hassidim, and Seth Lloyd, “Quantum algorithm for linear systems of equations,” Phys. Rev. Lett. 103
2009
Earlier work this paper cites.
Ali Rahimi and Benjamin Recht, “Weighted sums of random kitchen sinks: Replacing minimization with randomization in learning,” in Advances in Neural Information Processing Systems 21 , edited by D. Koller, D. Schuurmans, Y. Bengio, and L. Bottou (Curran Associates, Inc., 2009) pp. 1313–1320
2009
Earlier work this paper cites.
Maarten Van Den Nest, “Classical simulation of quantum computation, the gottesman-knill theorem, and slightly beyond,” Quantum Info. Comput. 10
2010
Earlier work this paper cites.
Scott Aaronson and Alex Arkhipov, “The computational complexity of linear optics,” in Proceedings of the Forty-third Annual ACM Symposium on Theory of Computing , STOC ’11 (ACM, New York, NY, USA, 2011) pp. 333–342
2011
Earlier work this paper cites.
Michael A. Nielsen and Isaac L. Chuang, Quantum Computation and Quantum Information (Cambridge University Press, 2011)
2011
Earlier work this paper cites.
Patrick Rebentrost, Masoud Mohseni, and Seth Lloyd, “Quantum support vector machine for big data classification,” Phys. Rev. Lett. 113
2014
Cited alongside, same era.
Seth Lloyd, Masoud Mohseni, and Patrick Rebentrost, “Quantum principal component analysis,” Nature Physics 10
2014
Cited alongside, same era.
Alberto Peruzzo, Jarrod McClean, Peter Shadbolt, Man-Hong Yung, Xiao-Qi Zhou, Peter J. Love, Alán Aspuru-Guzik, and Jeremy L. O’Brien, “A variational eigenvalue solver on a photonic quantum processor,” Nature Communications 5
2014
Cited alongside, same era.
2014
Cited alongside, same era.
Andrew W. Cross, Graeme Smith, and John A. Smolin, “Quantum learning robust against noise,” Phys. Rev. A 92
Zhi-Cheng Yang, Armin Rahmani, Alireza Shabani, Hartmut Neven, and Claudio Chamon, “Optimizing variational quantum algorithms using pontryagin’s minimum principle,” Phys. Rev. X 7
2017
Later among the works it cites.
2017
Later among the works it cites.
Michael J. Bremner, Ashley Montanaro, and Dan J. Shepherd, “Achieving quantum supremacy with sparse and noisy commuting quantum computations,” Quantum 1
2017
Later among the works it cites.
Rigetti Computing, “Forest,” https://www.rigetti.com/forest (2017)
2017
Later among the works it cites.
John Preskill, “Quantum computing in the NISQ era and beyond,” (2018), arXiv:1801.00862
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2015
Cited alongside, same era.
Iordanis Kerenidis and Anupam Prakash, “Quantum recommendation systems,” (2016), arXiv:1603.08675
2016
Cited alongside, same era.
Ian Goodfellow, Yoshua Bengio, and Aaron Courville, Deep Learning (MIT Press, 2016) http://www.deeplearningbook.org
2016
Cited alongside, same era.
2016
Cited alongside, same era.
Michael J. Bremner, Ashley Montanaro, and Dan J. Shepherd, “Average-case complexity versus approximate simulation of commuting quantum computations,” Phys. Rev. Lett. 117
2016
Cited alongside, same era.
Rigetti Computing, “pyQuil,” https://github.com/rigetticomputing/pyquil (2016)
2016
Cited alongside, same era.
2016
Cited alongside, same era.
F. G. S. L. Brandão and K. M. Svore, “Quantum speed-ups for solving semidefinite programs,” in 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS) (2017) pp. 415–426
2017
Cited alongside, same era.
2018
Closest in time.
2018
Closest in time.
2018
Closest in time.
2018
Closest in time.
“Reflections on random kitchen sinks,” http://www.argmin.net/2017/12/05/kitchen-sinks/ , accessed: 2018-06-01
2018
Closest in time.
S. A. Caldwell, N. Didier, C. A. Ryan, E. A. Sete, A. Hudson, P. Karalekas, R. Manenti, M. P. da Silva, R. Sinclair, E. Acala, N. Alidoust, J. Angeles, A. Bestwick, M. Block, B. Bloom, A. Bradley, C. Bui, L. Capelluto, R. Chilcott, J. Cordova, G. Crossman, M. Curtis, S. Deshpande, T. El Bouayadi, D. Girshovich, S. Hong, K. Kuang, M. Lenihan, T. Manning, A. Marchenkov, J. Marshall, R. Maydra, Y. Mohan, W. O’Brien, C. Osborn, J. Otterbach, A. Papageorge, J.-P. Paquette, M. Pelstring, A. Polloreno, G. Prawiroatmodjo, V. Rawat, M. Reagor, R. Renzas, N. Rubin, D. Russell, M. Rust, D. Scarabelli, M. Scheer, M. Selvanayagam, R. Smith, A. Staley, M. Suska, N. Tezak, D. C. Thompson, T.-W. To, M. Vahidpour, N. Vodrahalli, T. Whyland, K. Yadav, W. Zeng, and C. Rigetti, “Parametrically activated entangling gates using transmon qubits,” Phys. Rev. Applied 10
2018
Closest in time.
Matthew Reagor, Christopher B. Osborn, Nikolas Tezak, Alexa Staley, Guenevere Prawiroatmodjo, Michael Scheer, Nasser Alidoust, Eyob A. Sete, Nicolas Didier, Marcus P. da Silva, Ezer Acala, Joel Angeles, Andrew Bestwick, Maxwell Block, Benjamin Bloom, Adam Bradley, Catvu Bui, Shane Caldwell, Lauren Capelluto, Rick Chilcott, Jeff Cordova, Genya Crossman, Michael Curtis, Saniya Deshpande, Tristan El Bouayadi, Daniel Girshovich, Sabrina Hong, Alex Hudson, Peter Karalekas, Kat Kuang, Michael Lenihan, Riccardo Manenti, Thomas Manning, Jayss Marshall, Yuvraj Mohan, William O’Brien, Johannes Otterbach, Alexander Papageorge, Jean-Philip Paquette, Michael Pelstring, Anthony Polloreno, Vijay Rawat, Colm A. Ryan, Russ Renzas, Nick Rubin, Damon Russel, Michael Rust, Diego Scarabelli, Michael Selvanayagam, Rodney Sinclair, Robert Smith, Mark Suska, Ting-Wai To, Mehrnoosh Vahidpour, Nagesh Vodrahalli, Tyler Whyland, Kamal Yadav, William Zeng, and Chad T. Rigetti, “Demonstration of universal parametric entangling gates on a multi-qubit lattice,” Science Advances 4
2018
Closest in time.
Nicolas Didier, Eyob A. Sete, Marcus P. da Silva, and Chad Rigetti, “Analytical modeling of parametrically modulated transmon qubits,” Phys. Rev. A 97
2018
Closest in time.
2018
Closest in time.
2019
Closest in time.