Fetching the paper…
Reading the bibliography…
Combinatorial optimization - a field of research addressing problems that feature strongly in a wealth of scientific and industrial contexts - has been identified as one of the core potential fields of applicability of quantum computers.
R. L. Rivest, A. Shamir, L. Adleman, A method for obtaining digital signatures and public-key cryptosystems, Comm. ACM
1978
Earlier work this paper cites.
L. G. Valiant, A theory of the learnable, Comm. ACM
1984
Earlier work this paper cites.
P. W. Beame, S. A. Cook, H. J. Hoover, Log depth circuits for division and related problems, SIAM J. Comp
1986
Earlier work this paper cites.
A. Blumer, A. Ehrenfeucht, D. Haussler, M. K. Warmuth, Occam’s Razor, Inf. Proc. Lett
1987
Earlier work this paper cites.
W. Alexi, B. Chor, O. Goldreich, C. P. Schnorr, RSA and Rabin functions: Certain parts are as hard as the whole, SIAM J. Comp
1988
Earlier work this paper cites.
M. J. Kearns, L. G. Valiant, Cryptographic limitations on learning Boolean formulae and finite automata, Machine learning: From theory to applications
1993
Earlier work this paper cites.
P. W. Shor, Proc. 35th Ann. Symp. Found. Comp. Sc
1994
Earlier work this paper cites.
M. J. Kearns, U. Vazirani, An introduction to computational learning theory
1994
Earlier work this paper cites.
W. J. Cook, W. H. Cunningham, W. R. Pulleyblank, A. Schrijver, Combinatorial optimization
1997
Earlier work this paper cites.
L. A. Wolsey, G. L. Nemhauser, Integer and combinatorial optimization
1999
Earlier work this paper cites.
J. Hromkovič, Algorithmics for hard problems: Introduction to combinatorial optimization, randomization, approximation, and heuristics
2004
Earlier work this paper cites.
O. Goldreich, Foundations of cryptography, Volume 2
2004
Earlier work this paper cites.
2006
Cited alongside, same era.
D. L. Applegate, et al
2009
Cited alongside, same era.
D. P. Williamson, D. B. Shmoys, The design of approximation algorithms
2011
Cited alongside, same era.
J. E. Hopcroft, R. Motwani, J. D. Ullman, Introduction to automata theory, languages, and computation
2013
Cited alongside, same era.
2014
Cited alongside, same era.
A. Montanaro, Quantum algorithms: an overview, npj Quant. Inf
M. Cerezo, et al
2021
Later among the works it cites.
R. Sweke, J.-P. Seifert, D. Hangleiter, J. Eisert, On the quantum versus classical learnability of discrete distributions, Quantum
2021
Later among the works it cites.
Y. Liu, S. Arunachalam, K. Temme, A rigorous and robust quantum speed-up in supervised machine learning, Nature Phys
2021
Later among the works it cites.
2022
Closest in time.
2022
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2016
Cited alongside, same era.
J. R. McClean, J. Romero, R. Babbush, A. Aspuru-Guzik, The theory of variational hybrid quantum-classical algorithms, New J. Phys
2016
Cited alongside, same era.
J. Preskill, Quantum computing in the NISQ era and beyond, Quantum
2018
Cited alongside, same era.
F. Arute, et al
2019
Cited alongside, same era.
L. Zhou, S.-T. Wang, S. Choi, H. Pichler, M. Lukin, Quantum approximate optimization algorithm: Performance, mechanism, and implementation on near-term devices, Phys. Rev. X
2020
Cited alongside, same era.
D. Stilck Franca, R. García-Patrón, Limitations of optimization algorithms on noisy quantum devices, Nature Phys
2020
Cited alongside, same era.
Z. Tabi, et al
2020
Cited alongside, same era.
2022
Closest in time.
R. Takagi, S. Endo, S. Minagawa, M. Gu, Fundamental limits of quantum error mitigation, npj Quant. Inf
2022
Closest in time.
2022
Closest in time.
2022
Closest in time.
2022
Closest in time.
2022
Closest in time.