Search NASA⌕ Search

SEARCH · Search NASA

Results for “spin glass Ising model”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 19 records
All sourcesNASA NTRSDOE OSTI
DOE OSTI2024

Scaling whole-chip QAOA for higher-order ising spin glass models on heavy-hex graphs

Abstract We show that the quantum approximate optimization algorithm (QAOA) for higher-order, random coefficient, heavy-hex compatible spin glass Ising models has strong parameter concentration across problem sizes from 16 up to 127 qubits for p = 1 up to p = 5, which allows for computationally efficient parameter transfer of QAOA angles. Matrix product state (MPS) simulation is used to compute noise-free QAOA performance. Hardware-compatible short-depth QAOA circuits are executed on ensembles of 100 higher-order Ising models on noisy IBM quantum superconducting processors with 16, 27, and 127 qubits using QAOA angles learned from a single 16-qubit instance using the JuliQAOA tool. We show that the best quantum processors find lower energy solutions up to p = 2 or p = 3, and find mean energies that are about a factor of two off from the noise-free distribution. We show that p = 1 QAOA energy landscapes remain very similar as the problem size increases using NISQ hardware gridsearches with up to a 414 qubit processor.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2019

Distribution of interevent avalanche times in disordered and frustrated spin systems

Hysteresis loops and the associated avalanche statistics of spin systems, such as the random-field Ising and Edwards-Anderson spin-glass models, have been extensively studied. A particular focus has been on self-organized criticality, manifest in power-law distributions of avalanche sizes. Considerably less work has been done on the statistics of the times between avalanches. This paper considers this issue, generalizing the work of Nampoothiri et al. [Phys. Rev. E 96, 032107 (2017)] in one space dimension to higher space dimensions. In addition to the interevent statistics of all avalanches, we also consider what happens when events are restricted to those exceeding a certain threshold size. Doing so raises the possibility of altering the definition of time to count the number of small events between the large ones, which provides for an analog to the concept of natural time introduced by the geophysics community with the goal of predicting patterns in seismic events. Furthermore, we analyze the distribution of time and natural time intervals both in the case of models that include only nearest-neighbor interactions, as well as models with (sparse) long-range couplings.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2026

Classical combinatorial optimization scaling for random Ising models on 2D heavy-hex graphs

Motivated by near term quantum computing hardware limitations, combinatorial optimization problems that can be addressed by current quantum algorithms and noisy hardware with little or no overhead are used to probe capabilities of quantum algorithms such as the quantum approximate optimization algorithm. In this study, a specific class of near term quantum computing hardware defined combinatorial optimization problems, Ising models on heavy-hex graphs both with and without geometrically local cubic terms, are examined for their classical computational hardness via empirical computation time scaling quantification. Specifically the time-to-solution (TTS) metric using the classical heuristic simulated annealing is measured for finding optimal variable assignments (ground states), as well as the time required for the optimization software Gurobi to find an optimal variable assignment. Because of the sparsity of these Ising models, the classical algorithms are able to find optimal solutions efficiently even for large instances (i.e. 100 000 spin variables). The Ising models both with and without geometrically local cubic terms exhibit average-case linear-time or weakly quadratic scaling when solved exactly using Gurobi, and the Ising models with no cubic terms show evidence of exponential-time TTS scaling when sampled using simulated annealing. These findings point to the necessity of developing and testing more complex, namely more densely connected, optimization problems in order for quantum computing to ever have a practical advantage over classical computing. Our results are another illustration that different classical algorithms can indeed have exponentially different running times, thus making the identification of the best practical classical technique important in any quantum computing vs. classical computing comparison.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2024

Equilibrium Dynamics of Infinite-Range Quantum Spin Glasses in a Field

We determine the low-energy spectrum and Parisi replica-symmetry-breaking function for the spin-glass phase of the quantum Ising model with infinite-range random exchange interactions and transverse and longitudinal ( h ) fields. We show that, for all h , the spin-glass state has full replica symmetry breaking and the local spin spectrum is gapless, with a spectral density that vanishes linearly with frequency. These results are obtained using an action functional—argued to yield exact results at low frequencies—that expands in powers of a spin-glass order parameter, which is bilocal in time, and a matrix in replica space. We also present the exact solution of the infinite-range spherical quantum p -rotor model at nonzero h : here, the spin-glass state has one-step replica symmetry breaking and gaplessness only appears after imposition of an additional marginal stability condition. Possible connections to experiments on random arrays of trapped Rydberg atoms are noted. Published by the American Physical Society 2024

Tikhanovskaya, Maria↗
DOE OSTI2018

Self-organized Segregation on the Grid

We consider an agent-based model with exponentially distributed waiting times in which two types of agents interact locally over a graph, and based on this interaction and on the value of a common intolerance threshold τ, decide whether to change their types. This is equivalent to a zero-temperature ising model with Glauber dynamics, an asynchronous cellular automaton with extended Moore neighborhoods, or a Schelling model of self-organized segregation in an open system, and has applications in the analysis of social and biological networks, and spin glasses systems. Some rigorous results were recently obtained in the theoretical computer science literature, and this work provides several extensions. We enlarge the intolerance interval leading to the expected formation of large segregated regions of agents of a single type from the known size ϵ>0 to size ≈0.134. Namely, we show that for 0.433<τ<1/2 (and by symmetry 1/2<τ<0.567), the expected size of the largest segregated region containing an arbitrary agent is exponential in the size of the neighborhood. We further extend the interval leading to expected large segregated regions to size ≈0.312 considering “almost segregated” regions, namely regions where the ratio of the number of agents of one type and the number of agents of the other type vanishes quickly as the size of the neighborhood grows. In this case, we show that for 0.344<τ≤0.433 (and by symmetry for 0.567≤τ<0.656) the expected size of the largest almost segregated region containing an arbitrary agent is exponential in the size of the neighborhood. This behavior is reminiscent of supercritical percolation, where small clusters of empty sites can be observed within any sufficiently large region of the occupied percolation cluster. The exponential bounds that we provide also imply that complete segregation, where agents of a single type cover the whole grid, does not occur with high probability for p=1/2 and the range of intolerance considered.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
NASA NTRS2017

QSPIN: A High Level Java API for Quantum Computing Experimentation

QSPIN is a high level Java language API for experimentation in QC models used in the calculation of Ising spin glass ground states and related quadratic unconstrained binary optimization (QUBO) problems. The Java API is intended to facilitate research in advanced QC algorithms such as hybrid quantum-classical solvers, automatic selection of constraint and optimization parameters, and techniques for the correction and mitigation of model and solution errors. QSPIN includes high level solver objects tailored to the D-Wave quantum annealing architecture that implement hybrid quantum-classical algorithms [Booth et al.] for solving large problems on small quantum devices, elimination of variables via roof duality, and classical computing optimization methods such as GPU accelerated simulated annealing and tabu search for comparison. A test suite of documented NP-complete applications ranging from graph coloring, covering, and partitioning to integer programming and scheduling are provided to demonstrate current capabilities.

Quantu↗
DOE OSTI2020

Confinement, reduced entanglement, and spin-glass order in a random quantum spin-ice model

In this work, we study an effective spin model derived perturbatively from a random transverse-field Ising model on the pyrochlore lattice. The model consists of spin configurations on the pyrochlore lattice, restricted to the spin-ice subspace, with spins interacting with random Ising exchange couplings as well as ring exchanges along the hexagons of the lattice. This model is studied by exact diagonalization up to N=64 site systems. Furthermore, we calculate spin-glass correlation functions and local entanglement entropy S T between spins in a single tetrahedron and the rest of the system. We find that the model undergoes two phase transitions. At weak randomness the model is in a quantum spin-ice phase where S T =ln 6. Increasing randomness, at low transverse fields, first leads to a frozen phase, with long-range spin-glass order and S T =ln 2 corresponding to the Cat states associated with Ising order. Further increase in randomness leads to a random resonating-hexagon phase with a frozen backbone of spins and a broad distribution of entanglement entropies. The implications of these studies for non-Kramers rare-earth pyrochlores are discussed.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2018

Theoretical Study of Doped and Co-doped Gallium Nitride with (Cr, Ni): an LDA-SIC and Monte Carlo Study

Using a composition of first-principle density functional theory (DFT) calculations and Monte Carlo simulation with the calculation within the self-interaction-correction local-density approximation, the electronic, magnetic, and optical properties of doped and co-doped GaN (Ga{sub 1−x}Cr{sub x}N, Ga{sub 1−x}Ni{sub x}N) and GaN (Ga{sub 1−2x}Cr{sub x}Ni{sub x}N) (x = 0.03 and 0.06), respectively, have been investigated. Our results have proven that the half-metallic ferromagnetic state still persists of co-doped GaN. In comparing the total energies, ab initio calculations certify the magnetic-state stability of the ferromagnetic phase compared with the spin-glass state. The exchange interactions obtained from the ab initio calculations were used as input parameters in a classical Ising model by Monte Carlo simulation to confirm the half-metallic ferromagnetic states with high Neel temperature.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2019

The Impurity Magnetic Susceptibility of Semiconductors in the Case of Direct Exchange Interaction in the Ising Model

The numerical simulation was applied to study the temperature dependence of the impurity magnetic susceptibility. The direct exchange interaction of the impurity magnetic moments randomly distributed in space was considered within the Ising model. When the temperature in a system decreases, the magnetic susceptibility behavior in this system ceases to comply with the Curie law, which is associated with the formation of a spin glass phase. It is shown that the expression of the preexponential factor in the formula for the direct exchange interaction considerably influences the temperature dependence of the magnetic susceptibility only in the case of ferromagnetic exchange.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2022

Direct observation of a dynamical glass transition in a nanomagnetic artificial Hopfield network

Spin glasses, generally defined as disordered systems with randomized competing interactions, are a widely investigated complex system. Theoretical models describing spin glasses are broadly used in other complex systems, such as those describing brain function, error-correcting codes5 or stock-market dynamics. This wide interest in spin glasses provides strong motivation to generate an artificial spin glass within the framework of artificial spin ice systems. Here we present the experimental realization of an artificial spin glass consisting of dipolar coupled single-domain Ising-type nanomagnets arranged onto an interaction network that replicates the aspects of a Hopfield neural network. Using cryogenic X-ray photoemission electron microscopy (XPEEM), we performed temperature-dependent imaging of thermally driven moment fluctuations within these networks and observed characteristic features of a two-dimensional Ising spin glass. Specifically, the temperature dependence of the spin glass correlation function follows a power-law trend predicted from theoretical models on two-dimensional spin glasses. As a result, we observe clear signatures of the hard-to-observe rugged spin glass free energy in the form of sub-aging, out-of-equilibrium autocorrelations and a transition from stable to unstable dynamics.

36 MATERIALS SCIENCE↗
DOE OSTI2021

Ice, glass, and solid phases in artificial spin systems with quenched disorder

We present a numerical study on a disordered artificial spin-ice system, which interpolates between the long-range ordered square ice and the fully degenerate shakti ice. Starting from the square-ice geometry, disorder is implemented by adding vertical/horizontal magnetic islands to the center of some randomly chosen square plaquettes of the array at different densities. When no island is added, we have ordered square ice. When all square plaquettes have been modified, we obtain shakti ice, which is disordered yet in a topological phase corresponding to the Rys F-model. In between, geometrical frustration due to these additional center spins disrupts the long-range Ising order of square ice, giving rise to a spin-glass regime at low temperatures. The artificial spin system proposed in our work provides an experimental platform to study the interplay between quenched disorder and geometrical frustration.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2026

Accelerating multicanonical sampling with irreversibility

Flat-histogram Monte Carlo simulations are well-established, robust methods to perform random walks in a physical observable or parameter space, making them suitable for finding ground states or studying phase transitions in complex systems in statistical physics. However, their efficiency can be limited by the time to attain the desired flat distribution, which is generally unknown prior to the simulations. In particular, they might suffer from slowing down towards the end of a simulation due to the diffusive nature of random walks. In this work we apply irreversibility to the multicanonical Monte Carlo method via the lifting approach to alleviate this behavior. We achieve a 2–4 times speedup in ground-state search for a two-dimensional (2D) Ising model, and up to an order of magnitude of speedup for finding the ground-state energy in an Edwards–Anderson spin glass, compared to traditional multicanonical sampling. In conclusion, the round-trip times between ground states show a narrower distribution and are significantly shorter compared to the reversible counterpart, suggesting that a lower convergence time with a smaller time variance is feasible.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2024

Replica symmetry breaking in spin glasses in the replica-free Keldysh formalism

We show that the algebra of Parisi ultrametric matrices is recovered by the real-time, replica-free, Dyson-Keldysh equations of infinite-range quantum spin glasses in the late time glassy limit. This connects to earlier results on classical and quantum systems showing how ultrametricity emerges from the persistent slow aging dynamics of the glass phase. The stationary spin glass state thereby spontaneously breaks thermal symmetry, or the Kubo-Martin-Schwinger relation of a state in global thermal equilibrium. We describe the Keldysh path integral of the infinite-range Ising model in transverse and longitudinal fields, and in the context of the Landau expansion of the action functional, show how the long-time limit connects to the full replica symmetry breaking obtained in the equilibrium formalism. We also illustrate our formalism by applying it to the spherical quantum p p -spin model, which only exhibits one-step replica symmetry breaking.

Lang, Johannes (ORCID:0000000283533392)↗
DOE OSTI2022

Mean-field model for the Curie-Weiss temperature dependence of coherence length in metallic liquids

The coherence length of the medium-range order (MRO) in metallic liquids is known to display a Curie-Weiss temperature dependence; its inverse is linearly related to temperature, and when extrapolated from temperatures above the glass transition, the coherence length diverges at a negative temperature with a critical exponent of unity. We propose a mean-field pseudospin model that explains this behavior. Specifically, we model the atoms and their local environment as Ising spins with antiferromagnetic exchange interactions. We further superimpose an exchange interaction between dynamical heterogeneities, or clusters of atoms undergoing cooperative motion. The coherence length in the metallic liquid is thus the correlation length between dynamical heterogeneities. Overall, our results reaffirm the idea that the MRO coherence length is a measure of point-to-set correlations, and that local frustrations in the interatomic interactions are prominent in metallic liquids.

36 MATERIALS SCIENCE↗
DOE OSTI2025

Biased degenerate ground-state sampling of small Ising models with converged quantum approximate optimization algorithm

The quantum alternating operator ansatz, a generalization of the quantum approximate optimization algorithm (QAOA), is a quantum algorithm used for approximately solving combinatorial optimization problems. QAOA typically uses the transverse field mixer as the driving Hamiltonian. One of the interesting properties of the transverse field driving Hamiltonian is that it results in nonuniform sampling of degenerate ground states of optimization problems. In this study, we numerically examine the fair sampling properties of the transverse field mixer QAOA, and Grover mixer QAOA (GM-QAOA), which provides theoretical guarantees of fair sampling of degenerate optimal solutions, up to a large enough p such that the mean expectation value converges to an optimal approximation ratio of 1. This comparison is performed with high-quality heuristically computed, but not necessarily optimal, QAOA angles, which give strictly monotonically improving solution quality as p increases. These angles are computed using the Julia based numerical simulation software JuliQAOA. Fair sampling of degenerate ground states is quantified using the Shannon entropy of the ground-state amplitudes distribution. The fair sampling properties are reported on several quantum signature Hamiltonians from previous quantum annealing fair sampling studies. Small random fully connected spin glasses are shown, which exhibit exponential suppression of some degenerate ground states with transverse field mixer QAOA. The transverse field mixer QAOA simulations show that some problem instances clearly saturate the Shannon entropy of 0 with a maximally biased distribution that occurs when the learning converges to an approximation ratio of 1 while other problem instances never deviate from a maximum Shannon entropy (uniform distribution) at any p step. Published by the American Physical Society 2025

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2015

Probing for quantum speedup in spin-glass problems with planted solutions

The availability of quantum annealing devices with hundreds of qubits has made the experimental demonstration of a quantum speedup for optimization problems a coveted, albeit elusive goal. Going beyond earlier studies of random Ising problems, here we introduce a method to construct a set of frustrated Ising-model optimization problems with tunable hardness. We study the performance of a D-Wave Two device (DW2) with up to 503 qubits on these problems and compare it to a suite of classical algorithms, including a highly optimized algorithm designed to compete directly with the DW2. The problems are generated around predetermined ground-state configurations, called planted solutions, which makes them particularly suitable for benchmarking purposes. The problem set exhibits properties familiar from constraint satisfaction (SAT) problems, such as a peak in the typical hardness of the problems, determined by a tunable clause density parameter. We bound the hardness regime where the DW2 device either does not or might exhibit a quantum speedup for our problem set. While we do not find evidence for a speedup for the hardest and most frustrated problems in our problem set, we cannot rule out that a speedup might exist for some of the easier, less frustrated problems. Our empirical findings pertain to the specific D-Wave processor and problem set we studied and leave open the possibility that future processors might exhibit a quantum speedup on the same problem set.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2024

4-Clique network minor embedding for quantum annealers

Quantum annealing is a quantum algorithm for computing solutions to combinatorial optimization problems. This study proposes a method for minor embedding optimization problems onto sparse quantum annealing hardware graphs called 4-clique network minor embedding. This method is in contrast to the standard minor embedding technique of using a path of linearly connected qubits in order to represent a logical variable state. The 4-clique minor embedding is possible on Pegasus graph connectivity, which is the native hardware graph for some of the current D-Wave quantum annealers. The Pegasus hardware graph contains many cliques of size 4, making it possible to form a graph composed entirely of paths of connected 4-cliques on which a problem can be minor-embedded. The 4-clique chains come at the cost of additional qubit usage on the hardware graph, but they allow for stronger coupling within each chain, thereby increasing chain integrity, reducing chain breaks, and allow for greater usage of the available energy scale for programming logical problem coefficients on current quantum annealers. The 4-clique minor embedding technique is compared with the standard linear path minor embedding with experiments on two D-Wave quantum annealing processors with Pegasus hardware graphs. We show proof-of-concept experiments where the 4-clique minor embeddings can use weak chain strengths while successfully carrying out the computation of minimizing random all-to-all spin glass problem instances. Published by the American Physical Society 2024

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2020

The matrix product approximation for the dynamic cavity method

Stochastic dynamics of classical degrees of freedom, defined on vertices of locally tree-like graphs, can be studied in the framework of the dynamic cavity method which is exact for tree graphs. Such models correspond for example to spin-glass systems, Boolean networks, neural networks, and other technical, biological, and social networks. The central objects in the cavity method are edge messages—conditional probabilities of two vertex variable trajectories. In this paper, we discuss a rather pedagogical derivation for the dynamic cavity method, give a detailed account of the novel matrix product edge message (MPEM) algorithm for the solution of the dynamic cavity equation as introduced, and present optimizations and extensions. Matrix product approximations of the edge messages are constructed recursively in an iteration over time. Computation costs and precision can be tuned by controlling the matrix dimensions of the MPEM in truncations. Without truncations, the dynamics is exact. Data for Glauber–Ising dynamics shows a linear growth of computation costs in time. In contrast to Monte Carlo simulations, the approach has a much better error scaling. Hence, it gives for example access to low probability events and decaying observables like temporal correlations. Here, we discuss optimized truncation schemes and an extension that allows to capture models which have a continuum time limit.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗