activity
20072023
most citedObservation of topological phenomena in a programmable lattice of 1,800 qubits

331 citations · 1.5k across the 33 of their papers we have counts for

collaborators
Showing cond-mat.dis-nnShow all

9 papers · 1 filter

cond-mat.dis-nn2019★ 20 cited

Computational hardness of spin-glass problems with tile-planted solutions

Dilina Perera, Firas Hamze, Jack Raymond +2

We investigate the computational hardness of spin-glass instances on a square lattice, generated via a recently introduced tunable and scalable approach for planting solutions. The…

cond-mat.dis-nn2019★ 31 cited

The Wishart planted ensemble: A tunably-rugged pairwise Ising model with a first-order phase transition

Firas Hamze, Jack Raymond, Christopher A. Pattison +2

We propose the Wishart planted ensemble, a class of zero-field Ising models with tunable algorithmic hardness and specifiable (or planted) ground state. The problem class arises fr…

cond-mat.dis-nn2013★ 2 cited

Correcting beliefs in the mean-field and Bethe approximations using linear response

Jack Raymond, Federico Ricci-Tersenghi

Approximating marginals of a graphical model is one of the fundamental problems in the theory of networks. In a recent paper a method was shown to construct a variational free ener…

cond-mat.dis-nn2012★ 4 cited

The network source location problem: ground state energy, entropy and effects of freezing

Haiping Huang, Jack Raymond, K. Y. Michael Wong

Ground state entropy of the network source location problem is evaluated at both the replica symmetric level and one-step replica symmetry breaking level using the entropic cavity…

cond-mat.dis-nn2010★ 23 cited

Noisy Random Boolean Formulae - a Statistical Physics Perspective

Alexander Mozeika, David Saad, Jack Raymond

Typical properties of computing circuits composed of noisy logical gates are studied using the statistical physics methodology. A growth model that gives rise to typical random Boo…

cond-mat.dis-nn2009★ 13 cited

Computing with Noise - Phase Transitions in Boolean Formulas

Alexander Mozeika, David Saad, Jack Raymond

Computing circuits composed of noisy logical gates and their ability to represent arbitrary Boolean functions with a given level of error are investigated within a statistical mech…

cond-mat.dis-nn2009★ 5 cited

Equilibrium properties of disordered spin models with two scale interactions

Jack Raymond, David Saad

Methods for understanding classical disordered spin systems with interactions conforming to some idealized graphical structure are well developed. The equilibrium properties of the…

cond-mat.dis-nn2009★ 3 cited

Typical case behaviour of spin systems in random graph and composite ensembles

Jack Raymond

This thesis includes analysis of disordered spin ensembles corresponding to Exact Cover, a multi-access channel problem, and composite models combining sparse and dense interaction…

cond-mat.dis-nn2008★ 4 cited

Composite CDMA - A statistical mechanics analysis

Jack Raymond, David Saad

Code Division Multiple Access (CDMA) in which the spreading code assignment to users contains a random element has recently become a cornerstone of CDMA research. The random elemen…