Skip to main content
Search

# Ising Model

3 related articles

Subscribe to updates
  1. arXiv

    Quantum extreme learning skips the likelihood: on a transverse-field Ising chain, 15 training points bring maximum absolute error to 0.013

    Quantum sensing usually infers an unknown parameter with Bayesian inference or maximum likelihood estimation, but both estimators require constructing a likelihood function, which needs full knowledge of the probe dynamics and is often impractical. A quantum extreme learning framework instead places the unknown parameter in the reservoir Hamiltonian, lets a fixed initial state encode it through parameter-dependent evolution, and trains a linear readout on local observable expectation values, avoiding explicit likelihood construction. Estimating the transverse field of a transverse-field Ising chain, 15 training points give a maximum absolute error of 0.013 over 200 test values, and combining measurements at two times into a larger feature vector improves accuracy further.

  2. arXiv

    Path integral diffusion picks a mirror half first, then settles glassy classes in one compound decision

    When path integral diffusion (PID) generates a finite Ising spin glass from a point source, each trajectory first chooses one of the two mirror halves of the zero-field measure, then decides among glassy classes inside that half. Theory shows every isotropic PID is Gaussian stochastic localization seen on a different clock, so the protocol sets when decisions happen and what they cost, not what is decided; on exactly enumerable Bethe and SK glasses, nested glassy levels are often settled in one or two distinct events, and these classes appear near the glass transition, keep their identity on cooling, and are absent in a ferromagnet on the same graphs.

  3. arXiv

    Putting an Ising model inside a hidden Markov chain: pseudolikelihood sidesteps the partition function, and U.S. county gun-death weeks split into four states

    The hidden Markov Ising model makes an Ising model, a binary graphical model from statistical physics, the emission distribution of a hidden Markov chain, so that a binary network's dependence structure is modeled directly as its state changes over time. Because the Ising normalizing constant grows exponentially with the number of nodes, fitting uses pseudolikelihood inside Baum-Welch reestimation, with results on the algorithm's validity, model identifiability and large-network consistency. Exogenous covariates extend it to a hidden Markov autologistic model, applied to a five-year sequence of weekly gun-death events across 3109 continental U.S. counties from 2021 to 2025, where it identifies state changes in gun violence activity.

You’re all caught up