Fetching the paper…
Reading the bibliography…
The Quantum Approximate Optimization Algorithm (QAOA) is a quantum algorithm designed for Combinatorial Optimization Problem (COP).
The landscape of the planted clique problem: Dense subgraphs and the overlap gap property, 2019
David Gamarnik and Ilias Zadik · 1904
Earlier work this paper cites.
Solvable model of a spin-glass
David Sherrington and Scott Kirkpatrick · 1975
Earlier work this paper cites.
A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
Béla Bollobás · 1980
Earlier work this paper cites.
A Sequence of Approximated Solutions to the S- K K Model for Spin Glasses
G. Parisi · 1980
Earlier work this paper cites.
On the equivalence of two basic models of random graph
Tomasz Luczak · 1990
Earlier work this paper cites.
Probability Theory and Combinatorial Optimization
J.M. Steele · 1997
Earlier work this paper cites.
Reducibility among Combinatorial Problems
Richard M. Karp · 2001
Earlier work this paper cites.
The Quantum Approximate Optimization Algorithm Needs to See the Whole Graph: A Typical Case
Edward Farhi, David Gamarnik, and Sam Gutmann · 2004
Earlier work this paper cites.
Clustering of solutions in the random satisfiability problem
M. Mézard, T. Mora, and R. Zecchina · 2005
Earlier work this paper cites.
The Parisi formula
Michel Talagrand · 2006
Earlier work this paper cites.
Algorithmic thresholds in mean field spin glasses, 2020
Ahmed El Alaoui and Andrea Montanari · 2009
Earlier work this paper cites.
Tight thresholds for cuckoo hashing via xorsat
Martin Dietzfelbinger, Andreas Goerdt, Michael Mitzenmacher, Andrea Montanari, Rasmus Pagh, and Michael Rink · 2010
Earlier work this paper cites.
On the solution-space geometry of random constraint satisfaction problems
Dimitris Achlioptas, Amin Coja-Oghlan, and Federico Ricci-Tersenghi · 2011
Earlier work this paper cites.
On regular hypergraphs of high girth
David Ellis and Nathan Linial · 2013
Cited alongside, same era.
A quantum approximate optimization algorithm, 2014
Edward Farhi, Jeffrey Goldstone, and Sam Gutmann · 2014
Cited alongside, same era.
The Parisi formula for mixed p p -spin models
Dmitry Panchenko · 2014
Cited alongside, same era.
Introduction to Random Graphs
Alan Frieze and Michał Karoński · 2015
Cited alongside, same era.
On the strength of connectedness of a random hypergraph
Daniel J. Poole · 2015
Cited alongside, same era.
Embedding the erdős–rényi hypergraph into the random regular hypergraph and hamiltonicity
Andrzej Dudek, Alan Frieze, Andrzej Ruciński, and Matas Šileikis · 2016
Cited alongside, same era.
The overlap gap property: A topological barrier to optimizing over random structures
David Gamarnik · 2021
Later among the works it cites.
Fixed-angle conjectures for the quantum approximate optimization algorithm on regular maxcut graphs
Jonathan Wurtz and Danylo Lykov · 2021
Later among the works it cites.
The quantum approximate optimization algorithm at high depth for maxcut on large-girth regular graphs and the Sherrington-Kirkpatrick model
Joao Basso, Edward Farhi, Kunal Marwaha, Benjamin Villalonga, and Leo Zhou · 2022
Later among the works it cites.
Performance and limitations of the QAOA at constant levels on large sparse hypergraphs and spin glass models
Joao Basso, David Gamarnik, Song Mei, and Leo Zhou · 2022
Later among the works it cites.
Limitations of Local Quantum Algorithms on Random MAX-k-XOR and Beyond
Chi-Ning Chou, Peter J. Love, Juspreet Singh Sandhu, and Jonathan Shi · 2022
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Finding a large submatrix of a Gaussian random matrix
David Gamarnik and Quan li · 2016
Cited alongside, same era.
Extremal cuts of sparse random graphs
Amir Dembo, Andrea Montanari, and Subhabrata Sen · 2017
Cited alongside, same era.
Limits of local algorithms over sparse random graphs
David Gamarnik and Madhu Sudan · 2017
Cited alongside, same era.
Optimization on sparse random hypergraphs and spin glasses
Subhabrata Sen · 2018
Cited alongside, same era.
Suboptimality of local algorithms for a class of max-cut problems
Wei-Kuo Chen, David Gamarnik, Dmitry Panchenko, and Mustazee Rahman · 2019
Cited alongside, same era.
Quantum approximate optimization algorithm: Performance, mechanism, and implementation on near-term devices
Leo Zhou, Sheng-Tao Wang, Soonwon Choi, Hannes Pichler, and Mikhail D. Lukin · 2020
Cited alongside, same era.
The Quantum Approximate Optimization Algorithm and the Sherrington-Kirkpatrick Model at Infinite Size
Edward Farhi, Jeffrey Goldstone, Sam Gutmann, and Leo Zhou · 2022
Later among the works it cites.
Disordered systems insights on computational hardness
David Gamarnik, Cristopher Moore, and Lenka Zdeborová · 2022
Later among the works it cites.
Concentration bounds for quantum states and limitations on the QAOA from polynomial approximations
Anurag Anshu and Tony Metger · 2023
Later among the works it cites.
Local algorithms and the failure of log-depth quantum advantage on sparse random csps, 2023
Antares Chen, Neng Huang, and Kunal Marwaha · 2023
Later among the works it cites.
Algorithmic threshold for multi-species spherical spin glasses, 2023
Brice Huang and Mark Sellke · 2023
Later among the works it cites.
The overlap gap property limits limit swapping, 2024
Mark Goh · 2024
Closest in time.
Elisabeth Wybo and Martin Leib · 2024
Closest in time.