Pith. sign in

REVIEW 2 cited by

Random Matrices and complexity of Spin Glasses

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

arxiv 1003.1129 v2 pith:QPRSWBUG submitted 2010-03-04 math.PR math-phmath.MP

classification math.PRmath-phmath.MP
keywords complexitymodelsrandomresultsabsoluteallowsapproacharous
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

We give an asymptotic evaluation of the complexity of spherical p-spin spin-glass models via random matrix theory. This study enables us to obtain detailed information about the bottom of the energy landscape, including the absolute minimum (the ground state), the other local minima, and describe an interesting layered structure of the low critical values for the Hamiltonians of these models. We also show that our approach allows us to compute the related TAP-complexity and extend the results known in the physics literature. As an independent tool, we prove a LDP for the k-th largest eigenvalue of the GOE, extending the results of Ben Arous, Dembo and Guionnett (2001).

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Quantum estimates for classical polynomial optimization

    math-ph 2026-07 conditional novelty 5.0 of 10

    A quantum-variational matrix method is proposed for bounding homogeneous polynomials, with converging numerical tensor-eigenvalue estimates and a new conjectured inequality for Biasi's resonant Hamiltonians.

  2. A Novel Solver for QUBO Problems: Performance Analysis and Comparative Study with State-of-the-Art Algorithms

    quant-ph 2025-06 reject novelty 3.0 of 10

    QIS3 is claimed to outperform eight existing solvers on three QUBO benchmark classes, but the paper omits implementation details, hyperparameters, and validation of optimality.

Pith tools