Fetching the paper…
Reading the bibliography…
A combinatorial optimization problem becomes very difficult in situations where the energy landscape is rugged, and the global minimum locates in a narrow region of the configuration space.
C. K. Majumdar and D. K. Ghosh, On next-nearest-neighbor interaction in linear chain. i, Journal of Mathematical Physics 10
1969
Earlier work this paper cites.
R. E. Ladner, On the structure of polynomial time reducibility, J. ACM 22
1975
Earlier work this paper cites.
M. Garey and D. Johnson, Computers and Intractability: A Guide to the Theory of NP-completeness , Mathematical Sciences Series (W. H. Freeman, 1979)
1979
Earlier work this paper cites.
B. M. E. Moret, Planar nae3sat is in p, SIGACT News 19
1988
Earlier work this paper cites.
M. R. Garey and D. S. Johnson, Computers and Intractability; A Guide to the Theory of NP-Completeness (W. H. Freeman & Co., USA, 1990)
1990
Earlier work this paper cites.
D. Bertsimas and J. Tsitsiklis, Simulated Annealing, Statistical Science 8
1993
Earlier work this paper cites.
T. Kadowaki and H. Nishimori, Quantum annealing in the transverse ising model, Phys. Rev. E 58
1998
Earlier work this paper cites.
P. W. Shor, Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer, SIAM Review 41
1999
Earlier work this paper cites.
D. Jungnickel, The greedy algorithm, in Graphs, Networks and Algorithms (Springer Berlin Heidelberg, Berlin, Heidelberg, 1999) pp. 129–153
1999
Earlier work this paper cites.
S. Aaronson, Guest column: Np-complete problems and physical reality, SIGACT News 36
2005
Earlier work this paper cites.
I. Dinur, O. Regev, and C. Smyth, The hardness of 3-uniform hypergraph coloring, Combinatorica 25
2005
Earlier work this paper cites.
D. Aharonov, W. van Dam, J. Kempe, Z. Landau, S. Lloyd, and O. Regev, Adiabatic quantum computation is equivalent to standard quantum computation, SIAM Journal on Computing 37
2007
Earlier work this paper cites.
A. Das and B. K. Chakrabarti, Colloquium: Quantum annealing and analog quantum computation, Rev. Mod. Phys. 80
2008
Earlier work this paper cites.
Michael Nielsen, Neural Networks and Deep Learning (Free Online Book, 2013)
2013
Earlier work this paper cites.
2014
Cited alongside, same era.
N. Srivastava, G. Hinton, A. Krizhevsky, I. Sutskever, and R. Salakhutdinov, Dropout: A simple way to prevent neural networks from overfitting, J. Mach. Learn. Res. 15
2014
Cited alongside, same era.
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, Nature Communications 5
2014
Cited alongside, same era.
A. W. Harrow and A. Montanaro, Quantum computational supremacy, Nature 549
2017
Cited alongside, same era.
A. Kandala, A. Mezzacapo, K. Temme, M. Takita, M. Brink, J. M. Chow, and J. M. Gambetta, Hardware-efficient variational quantum eigensolver for small molecules and quantum magnets, Nature 549
M. Willsch, D. Willsch, F. Jin, H. De Raedt, and K. Michielsen, Benchmarking the quantum approximate optimization algorithm, Quantum Information Processing 19
2020
Later among the works it cites.
V. Akshay, H. Philathong, M. E. S. Morales, and J. D. Biamonte, Reachability deficits in quantum approximate optimization, Phys. Rev. Lett. 124
2020
Later among the works it cites.
G. Pagano, A. Bapat, P. Becker, K. S. Collins, A. De, P. W. Hess, H. B. Kaplan, A. Kyprianidis, W. L. Tan, C. Baldwin, L. T. Brady, A. Deshpande, F. Liu, S. Jordan, A. V. Gorshkov, and C. Monroe, Quantum approximate optimization of the long-range ising model with a trapped-ion quantum simulator, Proceedings of the National Academy of Sciences 117
2020
Later among the works it cites.
M. Streif and M. Leib, Training the quantum approximate optimization algorithm without access to a quantum processing unit, Quantum Science and Technology 5
2020
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2017
Cited alongside, same era.
P. Jain and P. Kar, Non-convex optimization for machine learning, Foundations and Trends in Machine Learning 10
2017
Cited alongside, same era.
S. Bravyi, D. Gosset, and R. Konig, Quantum advantage with shallow circuits, Science 362
2018
Cited alongside, same era.
Z. Wang, S. Hadfield, Z. Jiang, and E. G. Rieffel, Quantum approximate optimization algorithm for maxcut: A fermionic view, Phys. Rev. A 97
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, Nature Communications 9
2018
Cited alongside, same era.
W. W. Ho and T. H. Hsieh, Efficient variational simulation of non-trivial quantum states, SciPost Phys. 6
2019
Cited alongside, same era.
H.-S. Zhong, H. Wang, Y.-H. Deng, M.-C. Chen, L.-C. Peng, Y.-H. Luo, J. Qin, D. Wu, X. Ding, Y. Hu, P. Hu, X.-Y. Yang, W.-J. Zhang, H. Li, Y. Li, X. Jiang, L. Gan, G. Yang, L. You, Z. Wang, L. Li, N.-L. Liu, C.-Y. Lu, and J.-W. Pan, Quantum computational advantage using photons, Science 370
2020
Cited alongside, same era.
L. Zhou, S.-T. Wang, S. Choi, H. Pichler, and M. D. Lukin, Quantum approximate optimization algorithm: Performance, mechanism, and implementation on near-term devices, Phys. Rev. X 10
2020
Cited alongside, same era.
S. H. Sack and M. Serbyn, Quantum annealing initialization of the quantum approximate optimization algorithm, Quantum 5
2021
Later among the works it cites.
M. Medvidovic and G. Carleo, Classical variational simulation of the quantum approximate optimization algorithm, npj Quantum Information 7
2021
Later among the works it cites.
L. Bittel and M. Kliesch, Training variational quantum algorithms is np-hard, Phys. Rev. Lett. 127
2021
Later among the works it cites.
G. Matos, S. Johri, and Z. Papic, Quantifying the efficiency of state preparation via quantum variational eigensolvers, PRX Quantum 2
2021
Later among the works it cites.
2021
Later among the works it cites.
M. Cerezo, A. Sone, T. Volkoff, L. Cincio, and P. J. Coles, Cost function dependent barren plateaus in shallow parametrized quantum circuits, Nature Communications 12
2021
Later among the works it cites.
S. Wang, E. Fontana, M. Cerezo, K. Sharma, A. Sone, L. Cincio, and P. J. Coles, Noise-induced barren plateaus in variational quantum algorithms, Nature Communications 12
2021
Later among the works it cites.
J. Villalba-Diez, A. Gonzalez-Marcos, and J. B. Ordieres-Mere, Improvement of quantum approximate optimization algorithm for max–cut problems, Sensors 22
2022
Closest in time.
D. Amaro, C. Modica, M. Rosenkranz, M. Fiorentini, M. Benedetti, and M. Lubasch, Filtering variational quantum algorithms for combinatorial optimization, Quantum Science and Technology 7
2022
Closest in time.