Related papers: Error threshold in optimal coding, numerical crite…
In this paper, we study the critical behavior of percolation on a configuration model with degree distribution satisfying an infinite second-moment condition, which includes power-law degrees with exponent $\tau \in (2,3)$. It is well known…
Number partitioning is a classical problem from combinatorial optimisation. In physical terms it corresponds to a long range anti-ferromagnetic Ising spin glass. It has been rigorously proven that the low lying energies of number…
We study spin glasses on random lattices with finite connectivity. In the infinite connectivity limit they reduce to the Sherrington Kirkpatrick model. In this paper we investigate the expansion around the high connectivity limit. Within…
One of the main problems in random network coding is to compute good lower and upper bounds on the achievable cardinality of the so-called subspace codes in the projective space $\mathcal{P}_q(n)$ for a given minimum distance. The…
Over the past 30 years numerous algorithms have been designed for symmetry breaking problems in the LOCAL model, such as maximal matching, MIS, vertex coloring, and edge-coloring. For most problems the best randomized algorithm is at least…
Repetition code forms a fundamental basis for quantum error correction experiments. To date, it stands as the sole code that has achieved large distances and extremely low error rates. Its applications span the spectrum of evaluating…
We present a general technique to compute how the energy of a configuration varies as a function of its overlap with the ground state in the case of optimization problems. Our approach is based on a generalization of the cavity method to a…
We study a variant of the Sherrington-Kirkpatrick (S-K) spin glass model with external field, where the random symmetric couplings matrix does not consist of i.i.d. entries but is instead orthogonally invariant in law. For sufficiently high…
Recently, [DOI:10.1007/s10955-023-03135-1] considered spin glass models with additional conventional order parameters characterizing single-replica properties. These parameters are distinct from the standard order parameter, the overlap,…
We propose that chaotic Glass networks (a class of piecewise-linear Ordinary Differential Equations) are good candidates for the design of true random number generators. A Glass network design has the advantage of involving only standard…
Fault tolerance is a prerequisite for scalable quantum computing. Architectures based on 2D topological codes are effective for near-term implementations of fault tolerance. To obtain high performance with these architectures, we require a…
Given discrete degrees of freedom (spins) on a graph interacting via an energy function, what can be said about the energy local minima and associated inherent structures? Using the lid algorithm in the context of a spin glass energy…
The free energy landscape of the Sherrington-Kirkpatrik (SK) Ising spin glass is simple in the framework of the Thouless-Anderson-Palmer (TAP) equations as each solution (which are minima of the free energy) has associated with it a nearby…
A wide array of random graph models have been postulated to understand properties of observed networks. Typically these models have a parameter $t$ and a critical time $t_c$ when a giant component emerges. It is conjectured that for a large…
Color codes are a class of topological quantum codes with a high error threshold and large set of transversal encoded gates, and are thus suitable for fault tolerant quantum computation in two-dimensional architectures. Recently,…
In recent years, quantum kernel methods have shown promising applications on near-term quantum devices. However, selecting an appropriate encoding circuit for a given dataset requires costly evaluation of multiple candidates, formulated as…
Quantum error correction (QEC) is indispensable for realizing fault-tolerant quantum computation, yet its effectiveness hinges critically on the classical decoding algorithm that interprets noisy syndrome measurements. Among all possible…
We present an elementary approach to the order of fluctuations for the free energy in the Sherrington-Kirkpatrick mean field spin glass model at and near the critical temperature. It is proved that at the critical temperature the variance…
This paper develops approximate message passing algorithms to optimize multi-species spherical spin glasses. We first show how to efficiently achieve the algorithmic threshold energy identified in our companion work, thus confirming that…
We study the problem of testing and recovering $k$-clique Ferromagnetic mean shift in the planted Sherrington-Kirkpatrick model (i.e., a type of spin glass model) with $n$ spins. The planted SK model -- a stylized mixture of an uncountable…