Fetching the paper…
Reading the bibliography…
The recent proliferation of NISQ devices has made it imperative to understand their computational power.
Cryptographic primitives based on hard learning problems
Avrim Blum, Merrick Furst, Michael Kearns, and Richard J Lipton · 1993
Earlier work this paper cites.
Algorithms for quantum computation: discrete logarithms and factoring
Peter W. Shor · 1994
Earlier work this paper cites.
Universal quantum simulators
Seth Lloyd · 1996
Earlier work this paper cites.
A fast quantum mechanical algorithm for database search
Lov K. Grover · 1996
Earlier work this paper cites.
Limitations of noisy reversible computation
Dorit Aharonov, Michael Ben-Or, Russell Impagliazzo, and Noam Nisan · 1996
Earlier work this paper cites.
Fault-tolerant quantum computation with constant error
Dorit Aharonov and Michael Ben-Or · 1997
Earlier work this paper cites.
On the power of quantum computation
Daniel R. Simon · 1997
Earlier work this paper cites.
Quantum complexity theory
Ethan Bernstein and Umesh Vazirani · 1997
Earlier work this paper cites.
Fault-tolerant quantum computation
John Preskill · 1998
Earlier work this paper cites.
Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer
Peter W. Shor · 1999
Earlier work this paper cites.
Noise in grover’s quantum search algorithm
B. Pablo-Norman and M. Ruiz-Altaba · 1999
Earlier work this paper cites.
Grover’s quantum searching algorithm is optimal
Christof Zalka · 1999
Earlier work this paper cites.
Universal fault-tolerant quantum computation on decoherence-free subspaces
Dave Bacon, Julia Kempe, Daniel A. Lidar, and K. Birgitta Whaley · 2000
Earlier work this paper cites.
Dominant gate imperfection in grover’s quantum search algorithm
Gui Lu Long, Yan Song Li, Wei Lin Zhang, and Chang Cun Tu · 2000
Earlier work this paper cites.
Effects of a random noisy oracle on search algorithm complexity
Neil Shenvi, Kenneth R. Brown, and K. Birgitta Whaley · 2003
Earlier work this paper cites.
Effect of unitary noise on Grover’s quantum search algorithm
Daniel Shapira, Shay Mozes, and Ofer Biham · 2003
Earlier work this paper cites.
Noise-tolerant learning, the parity problem, and the statistical query model
Avrim Blum, Adam Kalai, and Hal Wasserman · 2003
Earlier work this paper cites.
Fault-tolerant quantum computation with high threshold in two dimensions
Robert Raussendorf and Jim Harrington · 2007
Earlier work this paper cites.
Effective fault-tolerant quantum computation with slow measurements
David P. DiVincenzo and Panos Aliferis · 2007
Earlier work this paper cites.
Search via quantum walk
Frédéric Magniez, Ashwin Nayak, Jérémie Roland, and Miklos Santha · 2007
Earlier work this paper cites.
Superconducting quantum bits
John Clarke and Frank K. Wilhelm · 2008
Earlier work this paper cites.
Impossibility of a quantum speed-up with a faulty oracle
Oded Regev and Liron Schiff · 2008
Earlier work this paper cites.
Quantum algorithm for linear systems of equations
Aram W. Harrow, Avinatan Hassidim, and Seth Lloyd · 2009
Earlier work this paper cites.
Quantum computing with defects
J.R. Weber, W.F. Koehl, J.B. Varley, Anderson Janotti, B.B. Buckley, C.G. Van de Walle, and David D. Awschalom · 2010
Earlier work this paper cites.
Grover’s algorithm with errors
Andris Ambainis, Artūrs Bačkurs, Nikolajs Nahimovs, and Alexander Rivosh · 2012
Earlier work this paper cites.
The nitrogen-vacancy colour centre in diamond
Marcus W Doherty, Neil B. Manson, Paul Delaney, Fedor Jelezko, Jörg Wrachtrup, and Lloyd C.L. Hollenberg · 2013
Earlier work this paper cites.
Michael Ben-Or, Daniel Gottesman, and Avinatan Hassidim · 2013
Earlier work this paper cites.
Quantum simulation
Iulia M. Georgescu, Sahel Ashhab, and Franco Nori · 2014
Earlier work this paper cites.
A variational eigenvalue solver on a photonic quantum processor
Alberto Peruzzo, Jarrod McClean, Peter Shadbolt, Man-Hong Yung, Xiao-Qi Zhou, Peter J. Love, Alán Aspuru-Guzik, and Jeremy L. O’brien · 2014
Earlier work this paper cites.
A quantum approximate optimization algorithm
Edward Farhi, Jeffrey Goldstone, and Sam Gutmann · 2014
Earlier work this paper cites.
Quantum learning robust against noise
Andrew W. Cross, Graeme Smith, and John A. Smolin · 2015
Earlier work this paper cites.
Forrelation: A problem that optimally separates quantum from classical computing
Scott Aaronson and Andris Ambainis · 2015
Earlier work this paper cites.
Scalable quantum simulation of molecular energies
Peter J.J. O’Malley, Ryan Babbush, Ian D. Kivlichan, Jonathan Romero, Jarrod R. McClean, Rami Barends, Julian Kelly, Pedram Roushan, Andrew Tranter, Nan Ding, et al · 2016
Cited alongside, same era.
Simulated quantum annealing can be exponentially faster than classical simulated annealing
Elizabeth Crosson and Aram W. Harrow · 2016
Cited alongside, same era.
Quantum supremacy through the quantum approximate optimization algorithm
Edward Farhi and Aram W. Harrow · 2016
Cited alongside, same era.
Demonstration of a small programmable quantum computer with atomic qubits
Shantanu Debnath, Norbert M. Linke, Caroline Figgatt, Kevin A. Landsman, Kevin Wright, and Christopher Monroe · 2016
Cited alongside, same era.
The theory of variational hybrid quantum-classical algorithms
Jarrod R. McClean, Jonathan Romero, Ryan Babbush, and Alán Aspuru-Guzik · 2016
Cited alongside, same era.
Computations with greater quantum depth are strictly more powerful (relative to an oracle)
Matthew Coudron and Sanketh Menda · 2020
Later among the works it cites.
Noise resilience of variational quantum compiling
Kunal Sharma, Sumeet Khatri, Marco Cerezo, and Patrick J. Coles · 2020
Later among the works it cites.
Classical optimizers for noisy intermediate-scale quantum devices
Wim Lavrijsen, Ana Tudor, Juliane Müller, Costin Iancu, and Wibe De Jong · 2020
Later among the works it cites.
Hybrid quantum-classical algorithms and quantum error mitigation
Suguru Endo, Zhenyu Cai, Simon C. Benjamin, and Xiao Yuan · 2021
Later among the works it cites.
Power of data in quantum machine learning
Hsin-Yuan Huang, Michael Broughton, Masoud Mohseni, Ryan Babbush, Sergio Boixo, Hartmut Neven, and Jarrod R. McClean · 2021
Later among the works it cites.
Information-theoretic bounds on quantum advantage in machine learning
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Quantum speed-ups for solving semidefinite programs
Fernando G.S.L. Brandao and Krysta M. Svore · 2017
Cited alongside, same era.
Quantum sdp solvers: Large speed-ups, optimality, and applications to quantum learning
Fernando GSL Brandão, Amir Kalev, Tongyang Li, Cedric Yen-Yu Lin, Krysta M Svore, and Xiaodi Wu · 2017
Cited alongside, same era.
Observation of a many-body dynamical phase transition with a 53-qubit quantum simulator
Jiehang Zhang, Guido Pagano, Paul W. Hess, Antonis Kyprianidis, Patrick Becker, Harvey Kaplan, Alexey V. Gorshkov, Z.-X. Gong, and Christopher Monroe · 2017
Cited alongside, same era.
Observation of discrete time-crystalline order in a disordered dipolar many-body system
Soonwon Choi, Joonhee Choi, Renate Landig, Georg Kucsko, Hengyun Zhou, Junichi Isoya, Fedor Jelezko, Shinobu Onoda, Hitoshi Sumiya, Vedika Khemani, et al · 2017
Cited alongside, same era.
Hardware-efficient variational quantum eigensolver for small molecules and quantum magnets
Abhinav Kandala, Antonio Mezzacapo, Kristan Temme, Maika Takita, Markus Brink, Jerry M. Chow, and Jay M. Gambetta · 2017
Cited alongside, same era.
Low-depth quantum simulation of materials
Ryan Babbush, Nathan Wiebe, Jarrod McClean, James McClain, Hartmut Neven, and Garnet Kin-Lic Chan · 2018
Cited alongside, same era.
Quantum computing in the NISQ era and beyond
John Preskill · 2018
Cited alongside, same era.
Hsin-Yuan Huang, Richard Kueng, and John Preskill · 2021
Later among the works it cites.
Variational algorithms for linear algebra
Xiaosi Xu, Jinzhao Sun, Suguru Endo, Ying Li, Simon C. Benjamin, and Xiao Yuan · 2021
Later among the works it cites.
Exponential separations between learning with and without quantum memory
Sitan Chen, Jordan Cotler, Hsin-Yuan Huang, and Jerry Li · 2021
Later among the works it cites.
A hierarchy for replica quantum advantage
Sitan Chen, Jordan Cotler, Hsin-Yuan Huang, and Jerry Li · 2021
Later among the works it cites.
Improved quantum data analysis
Costin Bădescu and Ryan O’Donnell · 2021
Later among the works it cites.
Limitations of optimization algorithms on noisy quantum devices
Daniel Stilck França and Raul Garcia-Patron · 2021
Later among the works it cites.
Evaluating the noise resilience of variational quantum algorithms
Enrico Fontana, Nathan Fitzpatrick, David Muñoz Ramo, Ross Duncan, and Ivan Rungger · 2021
Later among the works it cites.
Noise-induced barren plateaus in variational quantum algorithms
Samson Wang, Enrico Fontana, Marco Cerezo, Kunal Sharma, Akira Sone, Lukasz Cincio, and Patrick J Coles · 2021
Later among the works it cites.
Fast universal quantum gate above the fault-tolerance threshold in silicon
Akito Noiri, Kenta Takeda, Takashi Nakajima, Takashi Kobayashi, Amir Sammak, Giordano Scappucci, and Seigo Tarucha · 2022
Closest in time.
Quantum logic with spin qubits crossing the surface code threshold
Xiao Xue, Maximilian Russ, Nodar Samkharadze, Brennan Undseth, Amir Sammak, Giordano Scappucci, and Lieven M. K. Vandersypen · 2022
Closest in time.
Precision tomography of a three-qubit donor quantum processor in silicon
Mateusz T. Madzik, Serwan Asaad, Akram Youssry, Benjamin Joecker, Kenneth M. Rudinger, Erik Nielsen, Kevin C. Young, Timothy J. Proctor, Andrew D. Baczewski, Arne Laucht, Vivien Schmitt, Fay E. Hudson, Kohei M. Itoh, Alexander M. Jakob, Brett C. Johnson, David N. Jamieson, Andrew S. Dzurak, Christopher Ferrie, Robin Blume-Kohout, and Andrea Morello · 2022
Closest in time.
Noisy intermediate-scale quantum algorithms
Kishor Bharti, Alba Cervera-Lierta, Thi Ha Kyaw, Tobias Haug, Sumner Alperin-Lea, Abhinav Anand, Matthias Degroote, Hermanni Heimonen, Jakob S. Kottmann, Tim Menke, Wai-Keong Mok, Sukin Sim, Leong-Chuan Kwek, and Alán Aspuru-Guzik · 2022
Closest in time.
Unbiasing fermionic quantum monte carlo with a quantum computer
William J. Huggins, Bryan A. O’Gorman, Nicholas C. Rubin, David R. Reichman, Ryan Babbush, and Joonho Lee · 2022
Closest in time.
Generalization in quantum machine learning from few training data
Matthias C Caro, Hsin-Yuan Huang, Kunal Sharma, Andrew Sornborger, Lukasz Cincio, and Patrick J. Coles · 2022
Closest in time.
Challenges and opportunities in quantum machine learning
M. Cerezo, Guillaume Verdon, Hsin-Yuan Huang, Lukasz Cincio, and Patrick J. Coles · 2022
Closest in time.
Joao Basso, David Gamarnik, Song Mei, and Leo Zhou · 2022
Closest in time.
Quantum algorithmic measurement
Dorit Aharonov, Jordan Cotler, and Xiao-Liang Qi · 2022
Closest in time.
Foundations for learning from noisy quantum experiments
Hsin-Yuan Huang, Steven T. Flammia, and John Preskill · 2022
Closest in time.
Quantum advantage in learning from experiments
Hsin-Yuan Huang, Michael Broughton, Jordan Cotler, Sitan Chen, Jerry Li, Masoud Mohseni, Hartmut Neven, Ryan Babbush, Richard Kueng, John Preskill, et al · 2022
Closest in time.
Learning quantum systems via out-of-time-order correlators
Thomas Schuster, Murphy Niu, Jordan Cotler, Thomas O’Brien, Jarrod R. McClean, and Masoud Mohseni · 2022
Closest in time.
Information-theoretic hardness of out-of-time-order correlators
Jordan Cotler, Thomas Schuster, and Masoud Mohseni · 2022
Closest in time.
Tight bounds for quantum state certification with incoherent measurements
Sitan Chen, Brice Huang, Jerry Li, and Allen Liu · 2022
Closest in time.
Hybrid quantum-classical search algorithms
Ansis Rosmanis · 2022
Closest in time.
Noise and the frontier of quantum supremacy
Adam Bouland, Bill Fefferman, Zeph Landau, and Yunchao Liu · 2022
Closest in time.
Verifiable quantum advantage without structure
Takashi Yamakawa and Mark Zhandry · 2022
Closest in time.
Exponential advantage on noisy quantum computers
Ismail Yunus Akhalwaya, Shashanka Ubaru, Kenneth L Clarkson, Mark S Squillante, Vishnu Jejjala, Yang-Hui He, Kugendran Naidoo, Vasileios Kalantzis, and Lior Horesh · 2022
Closest in time.