Fetching the paper…
Reading the bibliography…
In an important recent development, Anshu, Breuckmann, and Nirkhe [ABN22] resolved positively the so-called No Low-Energy Trivial State (NLTS) conjecture by Freedman and Hastings.
Random Regular Graphs
Svante Janson, Tomasz Łuczak, and Andrzej Rucinski · 2000
Earlier work this paper cites.
Replica bounds for optimization problems and diluted spin systems
Silvio Franz and Michele Leone · 2003
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.
Algorithmic barriers from phase transitions
Dimitris Achlioptas and Amin Coja-Oghlan · 2008
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.
Efficient algorithm for a quantum analogue of 2-SAT
Sergey Bravyi · 2011
Earlier work this paper cites.
On independent sets in random graphs
Amin Coja-Oghlan and Charilaos Efthymiou · 2011
Earlier work this paper cites.
Guest column: the quantum PCP conjecture
Dorit Aharonov, Itai Arad, and Thomas Vidick · 2013
Earlier work this paper cites.
Quantum systems on non-k-hyperfinite complexes: a generalization of classical statistical mechanics on expander graphs
Michael H. Freedman and Matthew B. Hastings · 2014
Earlier work this paper cites.
Extremal cuts of sparse random graphs
Amir Dembo, Andrea Montanari, and Subhabrata Sen · 2017
Cited alongside, same era.
Local Hamiltonians whose ground states are hard to approximate
Lior Eldar and Aram W. Harrow · 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.
Obstacles to variational quantum optimization from symmetry protection
Sergey Bravyi, Alexander Kliesch, Robert Koenig, and Eugene Tang · 2020
Cited alongside, same era.
A construction of combinatorial NLTS
Anurag Anshu and Nikolas P. Breuckmann · 2022
Later among the works it cites.
Circuit lower bounds for low-energy states of quantum code Hamiltonians
Anurag Anshu and Chinmay Nirkhe · 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.
Quantum Tanner codes
Anthony Leverrier and Gilles Zemor · 2022
Later among the works it cites.
Limits of short-time evolution of local Hamiltonians
Ali Hamed Moosavian, Seyed Sajad Kahani, and Salman Beigi · 2022
Later among the works it cites.
NLTS Hamiltonians from good quantum codes
Anurag Anshu, Nikolas P. Breuckmann, and Chinmay Nirkhe · 2023
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Robust quantum entanglement at (nearly) room temperature
Lior Eldar · 2021
Cited alongside, same era.
The overlap gap property: A topological barrier to optimizing over random structures
David Gamarnik · 2021
Cited alongside, same era.
David Gamarnik, Aukosh Jagannath, and Eren C. Kızıldağ · 2023
Closest in time.
Bounds on the ground state energy of quantum p p -spin Hamiltonians, 2024
Eric R. Anschuetz, David Gamarnik, and Bobak T. Kiani · 2024
Closest in time.