Fetching the paper…
Reading the bibliography…
Saddle points constitute a crucial challenge for first-order gradient descent algorithms.
G. Pólya, “Über eine Aufgabe der Wahrscheinlichkeitsrechnung betreffend die Irrfahrt im Straßennetz,”
1921
Earlier work this paper cites.
E. W. Montroll, “Random walks in multidimensional spaces, especially on periodic lattices,”
1956
Earlier work this paper cites.
R. Benzi, A. Sutera, and A. Vulpiani, “The mechanism of stochastic resonance,”
1981
Earlier work this paper cites.
D. Deutsch, “Quantum theory, the Church-Turing principle and the universal quantum computer,”
1985
Earlier work this paper cites.
R. P. Feynman, “Quantum mechanical computers,”
1986
Earlier work this paper cites.
Alan J. Bray and David S. Dean, “Statistics of Critical Points of Gaussian Fields on Large-Dimensional Spaces,”
2007
Earlier work this paper cites.
A. Peruzzo, J. McClean, P. Shadbolt, M.-H. Yung, X.-Q. Zhou, P. J. Love, A. Aspuru-Guzik, and J. L. O’Brien, “A variational eigenvalue solver on a photonic quantum processor,”
2014
Earlier work this paper cites.
E. Farhi, J. Goldstone, and S. Gutmann, “A quantum approximate optimization algorithm,”
2014
Earlier work this paper cites.
J. R McClean, J. Romero, R. Babbush, and A. Aspuru-Guzik, “The theory of variational hybrid quantum-classical algorithms,”
2016
Earlier work this paper cites.
2016
Earlier work this paper cites.
A. Kandala, A. Mezzcapo, K. Temme, M. Takita, M. Brink, J. W. Chow, and J. M. Gambetta, “Hardware-efficient variational quantum eigensolver for small molecules and quantum magnets,”
2017
Earlier work this paper cites.
P. Jain and P. Kar, “Non-convex optimization for machine learning,”
2017
Earlier work this paper cites.
2017
Earlier work this paper cites.
S. Boixo, S. V. Isakov, V. N. Smelyanskiy, R. Babbush, N. Ding, Z. Jiang, M. J. Bremner, J. M. Martinis, and H. Neven, “Characterizing quantum supremacy in near-term devices,”
2018
Earlier work this paper cites.
J. Preskill, “Quantum computing in the NISQ era and beyond,”
2018
Cited alongside, same era.
2018
Cited alongside, same era.
J. R. McClean, S. Boixo, V. N. Smelyanskiy, R. Babbush, and H. Neven, “Barren plateaus in quantum neural network training landscapes,”
2018
Cited alongside, same era.
F. Arute et al. , “Quantum supremacy using a programmable superconducting processor,”
2019
Cited alongside, same era.
2019
S. Wang, E. Fontana, M. Cerezo, K. Sharma, A. Sone, L. Cincio, and P. J. Coles, “Noise-induced barren plateaus in variational quantum algorithms,”
2021
Later among the works it cites.
Enrico Fontana, Nathan Fitzpatrick, David Munoz Ramo, Ross Duncan, and Ivan Rungger, “Evaluating the noise resilience of variational quantum algorithms,”
2021
Later among the works it cites.
Tobias Haug, Kishor Bharti, and M.S. Kim, “Capacity and quantum geometry of parametrized quantum circuits,”
2021
Later among the works it cites.
2021
Later among the works it cites.
K. Bharti, A. Cervera-Lierta, T. H. Kyaw, T. Haug, S. Alperin-Lea, A. Anand, M. Degroote, H. Heimonen, J. S. Kottmann, T. Menke, et al. , “Noisy intermediate-scale quantum (NISQ) algorithms,”
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
L. Zhou, S.-T. Wang, S. Choi, H. Pichler, and M. Lukin, “Quantum approximate optimization algorithm: Performance, mechanism, and implementation on near-term devices,”
2020
Cited alongside, same era.
R. Sweke, F. Wilde, J. Meyer, M. Schuld, P. K. Fährmann, B. Meynard-Piganeau, and J. Eisert, “Stochastic gradient descent for hybrid quantum-classical optimization,”
2020
Cited alongside, same era.
T. L. Patti, K. Najafi, X. Gao, and S. F. Yelin, “Entanglement devised barren plateau mitigation,”
2020
Cited alongside, same era.
L. Gentini, A. Cuccoli, S. Pirandola, P. Verrucchi, and L. Banchi, “Noise-resilient variational hybrid quantum-classical optimization,”
2020
Cited alongside, same era.
P. Jurcevic, A. Javadi-Abhari, L. S. Bishop, I. Lauer, D. F. Bogorin, M. Brink, L. Capelluto, O. Günlük, T. Itoko, N. Kanazawa, A. Kandala, G. A. Keefe, K. Krsulich, W. Landers, E. P. Lewandowski, D. T. McClure, G. Nannicini, A. Narasgond, H. M. Nayfeh, E. Pritchett, M. B. Rothwell, S. Srinivasan, N. Sundaresan, C. Wang, K. X. Wei, C. J. Wood, J.-B. Yau, E. J. Zhang, O. E. Dial, J. M. Chow, and J. M. Gambetta, “Demonstration of quantum volume 64 on a superconducting quantum computing system,”
2021
Cited alongside, same era.
M. Cerezo, A. Arrasmith, R. Babbush, S. C. Benjamin, S. Endo, K. Fujii, J. R. McClean, K. Mitarai, X. Yuan, L. Cincio, and P. J. Coles, “Variational quantum algorithms,”
2021
Cited alongside, same era.
L. Bittel and M. Kliesch, “Training variational quantum algorithms is NP-hard,”
2021
Cited alongside, same era.
2022
Closest in time.
J. Tilly, H. Chen, S. Cao, D. Picozzi, K. Setia, Y. Li, E. Grant, L. Wossnig, I. Rungger, G. H. Booth, and J. Tennyson, “The variational quantum eigensolver: a review of methods and best practices,”
2022
Closest in time.
S. Duffield, M. Benedetti, and M. Rosenkranz, “Bayesian learning of parameterised quantum circuits,”
2022
Closest in time.
2022
Closest in time.
2022
Closest in time.
D. Hangleiter and J. Eisert, “Computational advantage of quantum random sampling,”
2023
Closest in time.
S. Duffield, M. Benedetti, and M. Rosenkranz, “Bayesian learning of parameterised quantum circuits,”
2023
Closest in time.
D. Lykov, J. Wurtz, C. Poole, M. Saffman, T. Noel, and Y. Alexeev, “Sampling frequency thresholds for the quantum advantage of the quantum approximate optimization algorithm,”
2023
Closest in time.
J. Liu, K. Najafi, K. Sharma, F. Tacchino, L. Jiang, and A. Mezzacapo, “An analytic theory for the dynamics of wide quantum neural networks,”
2023
Closest in time.