Matching works

8 works

quant-ph — Quantum Physics

Certified lower bounds on the optimal-decoding threshold of the surface code

Contributed by Tejasvi Singh Tomar

Under independent bit flips, rigorous lower bounds on the threshold of the surface code from earlier work stay below 0.040.04, while numerical estimates place the optimal threshold near 0.1090.109. By counting labelled failure paths with exact transfer-matrix certificates, we prove without sampling that every minimum-weight decoder has threshold at least 0.04650.0465 on the planar and rotated codes. We then give statistical certificates that, with confidence 1−10−91-10^{-9} each, the optimal threshold of the planar code is at least 0.1030.103 under bit flips and at least 0.020.02 under phenomenological noise. Each statistical certificate bounds the failure probability of an auxiliary decoder that divides the code into blocks and corrects each block using a window around it; optimal decoding does at least as well, so the bound also holds for optimal decoding. A deterministic lemma shows that the auxiliary decoder fails only if bad blocks, in which the window corrections leave a defect or a long residual path, form a sparse hierarchy that joins the two rough boundaries. This gives an explicit bound once every block is bad with probability below a limit, about 4×10−44\times10^{-4} under bit flips, and a pre-registered Monte Carlo experiment bounds these probabilities. The confidence rests on a binomial model of the counts of bad blocks and on two tested properties of each decoding program. All these results are proved in the proof assistant Lean 4, the statistical ones with the binomial model and the two properties as hypotheses.

Author comments: Published on Zenodo: https://doi.org/10.5281/zenodo.24048739

A mix of human-written and AI-generated textHuman understanding: all parts
Nov 12, 202642 pages
PDFView work

math.PR — Probability

THE CRITICAL CAPACITY OF THE HOPFIELD MODEL

Contributed by Yuwen Zhou

Abstract. We prove that the critical capacity of the Hopfield model at zero temperature lies in [0.138198129, 0.13820106]. The best rigorous lower bound was 0.113, and our lower end exceeds the published one-step and two-step replica symmetry breaking values. The capacity is the supremum of the loads at which the free energy at fixed overlap with one pattern has a well. At every positive temperature, we give a variational formula for this free energy and show that binary patterns and Gaussian rows have the same wells, which characterizes the capacity. The proof builds on the Hamilton–Jacobi solution of the model by Ali, Boursier, Chen, Ho, Issa and Mourrat, and on a

Primarily AI-generated textHuman understanding: some partsHopfield modelinterval arithmeticparisi formulaspin glassesstorage capacity
Nov 05, 202657 pages
PDFView work

math.PR — Probability

Lower and Upper Bounds for Glauber Dynamics from Typical States of the Low-Temperature Sherrington–Kirkpatrick Model

Contributed by P. M. Aronow, Patrick Lopatto

We study the heat-bath (Glauber) dynamics of the Sherrington–Kirkpatrick model at zero external field and fixed inverse temperature β>1\beta>1. We sample the disorder JJ and an initial configuration X0X_0 from its Gibbs measure. Let TJ(X0)T^J(X_0) be the time at which the transition law, conditional on JJ and the realized X0X_0, first comes within total-variation distance 1/41/4 of equilibrium. In continuous time, with rate one per site, we prove that, for every fixed ω∈(0,1/4)\omega\in(0,1/4), with probability tending to one, \[ A_\beta n^{7/30}<\log T^J(X_0)\le n^{1-\omega}, \] where Aβ>0A_\beta>0 depends only on β\beta. Corresponding bounds hold for the discrete-time chain. These results strengthen OpenAI’s typical-start lower and upper bounds while following their proof architectures. The lower-bound argument introduces a three-replica comparison with a cubic pressure deficit and uses Aronow and Lopatto’s quantitative mean-bias estimate. The upper-bound argument combines a pathwise information–energy cancellation, concentration estimates on a growing mesh, and optimized exponents. We also complete Lean formalizations of two known results: OpenAI’s fluctuation-scale theorem, giving variance n1/3+o(1)n^{1/3+o(1)} for the log partition function, and its mean-bias consequence of order at least n−5/6−εn^{-5/6-\varepsilon} for every fixed ε>0\varepsilon>0. The formal development proves the positive-Laplace-window input needed for the fluctuation theorem. Five specified result groups are formalized, including the continuous-time dynamics upper bound.

Primarily AI-generated textHuman understanding: some parts
Oct 20, 2026346 pages
PDFView work

math.PR — Probability

Mobility Edge for Sparse Complex Gaussian Matrices

Contributed by Patrick Lopatto

We consider the sparse Hermitian random matrix supported on the Erdős–Rényi graph G(n,p/n)G(n,p/n), whose nonzero entries are independent complex Gaussian variables of variance 1/p1/p, together with its local limit, a weighted Poisson–Galton–Watson tree. We prove that for every fixed and sufficiently large pp, the limiting operator on the tree conditioned on survival has exactly one positive mobility edge Ec(p)E_c(p): almost surely, its spectrum is purely absolutely continuous on (−Ec(p),0)∪(0,Ec(p))(-E_c(p),0)\cup(0,E_c(p)) and pure point outside [−Ec(p),Ec(p)][-E_c(p),E_c(p)]. Moreover, Ec(p)/pE_c(p)/\sqrt p converges to π/2\sqrt\pi/2 as pp tends to infinity. Thus the mobility edge lies far in the tail of the spectrum, rather than near the edge 22 of the limiting semicircle law, as had been predicted in the physics literature.

Primarily AI-generated textHuman understanding: some parts
Oct 12, 2026387 pages
PDFView work

math.PR — Probability

An N−7/10N^{-7/10} Bound for the Finite-Size Bias of the Sherrington-Kirkpatrick Free Energy

Contributed by P. M. Aronow, Patrick Lopatto

For every fixed inverse temperature β>1\beta>1, we prove that the expected free energy per spin of the zero-field Gaussian Sherrington-Kirkpatrick model differs from its Parisi limit by at most CβN−7/10C_\beta N^{-7/10}. This improves the exponent 2/32/3 of our earlier work (arXiv:2609.09103). We also compare the bound with the finite-size correction of order N−3/4N^{-3/4} predicted by Franz, Parisi, and Ricci-Tersenghi, and with the strict improvement over 2/32/3 that would follow from the ideas in OpenAI's recently released manuscripts.

Primarily AI-generated textHuman understanding: some parts
Oct 12, 2026206 pages
PDFView work

math.PR — Probability

The Parisi Formula for the Edwards–Anderson Model in the High-Dimensional Limit

Contributed by P. M. Aronow, Patrick Lopatto

We study the Edwards–Anderson spin glass on the torus (Z/LZ)d(\mathbb{Z}/L\mathbb{Z})^d, with independent Gaussian couplings of variance 1/(2d)1/(2d) between nearest neighbors. We prove that, as d→∞d\to\infty, its free energy converges to that of the Sherrington–Kirkpatrick model, given by the Parisi formula, at every temperature and in every uniform external field, uniformly in the side length LL. The same holds on the hypercube {0,1}d\{0,1\}^d, and the ground-state energies converge to the Sherrington–Kirkpatrick ground-state energy.

Primarily AI-generated textHuman understanding: some partsparisi formulaspin glass
Oct 08, 2026139 pages
PDFView work

math.PR — Probability

Parisi formula for Ising and Spherical Perceptrons

Contributed by Daniel Fu, Youngtak Sohn

We prove a Parisi formula for Ising and spherical perceptrons with Gaussian disorder and i.i.d. random potentials having a common Lipschitz bound and integrable values at zero. We assume M/N→α∈(0,∞)M/N\to\alpha\in(0,\infty), where MM is the number of Gaussian vectors and NN is the number of spins. The proof combines cavity in MM and NN with the Aizenman–Sims–Starr scheme for the lower bound and Guerra’s interpolation for the upper bound. As consequences, we answer several problems posed by Talagrand (2011) and establish a quenched large deviation principle for the empirical distribution of the Gaussian projections, resolving a conjecture of Bolthausen and Kistler (2010). We also resolve the sharp-threshold conjecture of Aubin, Perkins, and Zdeborová (2019) for the uu-function binary perceptron at every positive width, and establish the predicted variational formulas for the entropy and capacity of the negative spherical perceptron. Finally, the zero-temperature limit yields the scalar projection-pursuit formulas conjectured by Montanari and Zhou (2025, 2026), in both the supervised and unlabelled settings.

Primarily AI-generated textHuman understanding: some parts
Oct 08, 202670 pages
PDFView work

math.PR — Probability

The Negative Spherical Perceptron: Capacity, Isostatic Jamming, and Full Replica Symmetry Breaking

Contributed by P. M. Aronow, Patrick Lopatto

We study the negative spherical perceptron, a mean-field model of jamming with a nonconvex solution space. We establish the Parisi formula for its free energy and identify the capacity for every constraint density α>2\alpha>2. We also show that the jamming point is isostatic: optimal configurations have exactly NN contacts. For α\alpha slightly above two, we show that replica symmetry is lost at the de Almeida–Thouless margin through a continuous transition to full replica symmetry breaking. Further, we show that Gardner's formula overestimates the capacity by order (α−2)3(\alpha-2)^3.

Primarily AI-generated textHuman understanding: some partsperceptronspin glass
Oct 02, 2026357 pages
PDFView work

Advanced search

Text
Human understanding
Linked formalizations