REVIEW 1 cited by
One-step replica symmetry breaking in the language of tensor networks
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
We develop an exact mapping between the one-step replica symmetry breaking cavity method and tensor networks. The two schemes come with complementary mathematical and numerical toolboxes that could be leveraged to improve the respective states of the art. As an example, we construct a tensor-network representation of Survey Propagation, one of the best deterministic k-SAT solvers. The resulting algorithm outperforms any existent tensor-network solver by several orders of magnitude. We comment on the generality of these ideas, and we show how to extend them to the context of quantum tensor networks.
Forward citations
Cited by 1 Pith paper
-
Variational matrix product states for combinatorial optimization
Quantum-inspired product/matrix-product-state annealing embedded in iterated local search reports better MaxCut approximations than the ILS, LQA, GCS, and QAOA baselines tested, on graphs up to 50,000 vertices.
Discussion (0). Continue with ORCID to comment.