Entropic barriers as a reason for hardness in both classical and quantum algorithms
We study both classical and quantum algorithms to solve a hard optimization problem,
namely 3-XORSAT on 3-regular random graphs. By introducing a new quasi-greedy …
namely 3-XORSAT on 3-regular random graphs. By introducing a new quasi-greedy …
Backdoor to the Hidden Ground State: Planted Vertex Cover Example
XY Fan, HJ Zhou - arxiv preprint arxiv:2305.06610, 2023 - arxiv.org
We introduce a planted vertex cover problem on regular random graphs and study it by the
cavity method. The equilibrium ordering phase transition of this binary-spin two-body …
cavity method. The equilibrium ordering phase transition of this binary-spin two-body …