Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “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 271 records · Page 15
All sourcesNASA NTRSDOE OSTI
DOE OSTI2022

Simulations of frustrated Ising Hamiltonians using quantum approximate optimization

Novel magnetic materials are important for future technological advances. Theoretical and numerical calculations of ground-state properties are essential in understanding these materials, however, computational complexity limits conventional methods for studying these states. Here we investigate an alternative approach to preparing materials ground states using the quantum approximate optimization algorithm (QAOA) on near-term quantum computers. We study classical Ising spin models on unit cells of square, Shastry-Sutherland and triangular lattices, with varying field amplitudes and couplings in the material Hamiltonian. We find relationships between the theoretical QAOA success probability and the structure of the ground state, indicating that only a modest number of measurements (≲100) are needed to find the ground state of our nine-spin Hamiltonians, even for parameters leading to frustrated magnetism. We further demonstrate the approach in calculations on a trapped-ion quantum computer and succeed in recovering each ground state of the Shastry-Sutherland unit cell with probabilities close to ideal theoretical values. The results demonstrate the viability of QAOA for materials ground state preparation in the frustrated Ising limit, giving important first steps towards larger sizes and more complex Hamiltonians where quantum computational advantage may prove essential in developing a systematic understanding of novel materials.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

A nonlinear journey from structural phase transitions to quantum annealing

Motivated by an exact mapping between equilibrium properties of a one-dimensional chain of quantum Ising spins in a transverse field (the transverse field Ising (TFI) model) and a two-dimensional classical array of particles in double-well potentials (the “$\phi$ 4 model”) with weak inter-chain coupling, we explore connections between the driven variants of the two systems. Here, we argue that coupling between the fundamental topological solitary waves in the form of kinks between neighboring chains in the classical $\phi$ 4 system is the analog of the competing effect of the transverse field on spin flips in the quantum TFI model. As an example application, we mimic simplified measurement protocols in a closed quantum model system by studying the classical $\phi$ 4 model subjected to periodic perturbations. This reveals memory/loss of memory and coherence/decoherence regimes, whose quantum analogs are essential in annealing phenomena. In particular, we examine regimes where the topological excitations control the thermal equilibration following perturbations. This paves the way for further explorations of the analogy between lower-dimensional linear quantum and higher-dimensional classical nonlinear systems.

74 ATOMIC AND MOLECULAR PHYSICS↗
DOE OSTI2024

Classical analog of quantum models in synthetic dimensions

We introduce a classical analog of quantum matter in ultracold molecule-synthetic or Rydberg atom-synthetic dimensions, by extending the Potts model to include interactions J 1 between atoms adjacent in both real and synthetic space and studying its finite-temperature properties. For intermediate values of J 1 , the resulting phases and phase diagrams are similar to those of the clock and Villain models, in which three phases emerge. There exists a sheet phase analogous to that found in quantum synthetic dimension models between the high-temperature disordered phase and the low-temperature ferromagnetic phase. Furthermore, we also employ machine learning to uncover nontrivial features of the phase diagram using the learning by confusion approach, which is able to discern several successive phase transitions.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
NASA NTRS1989

Droplet model for autocorrelation functions in an Ising ferromagnet

The autocorrelation function of Ising spins in an ordered phase is studied via a droplet model. Only noninteracting spherical droplets are considered. The Langevin equation which describes fluctuations in the radius of a single droplet is studied in detail. A general description of the transformation to a Fokker-Planck equations and the ways in which a spectral analysis of that equation can be used to compute the autocorrelation function is given. It is shown that the eigenvalues of the Fokker-Planck operator form (1) a continuous spectrum of relaxation rates starting from zero for d = 2, (2) a continuous spectrum with a finite gap for d = 3, and (3) a discrete spectrum for d greater than 4, where d is the spatial dimensionality. Detailed solutions for various cases are presented.

Tang, Chao↗
DOE OSTI2025

Rare events and Griffiths phases in topological quantum error correction

The performance of quantum error correcting (QEC) codes is often studied under the assumption of spatiotemporally uniform error rates. On the other hand, experimental implementations almost always produce heterogeneous error rates, in either space or time, as a result of effects such as imperfect fabrication and/or cosmic rays. It is therefore important to understand if and how their presence can affect the performance of QEC in qualitative ways. Here, in this work, we study the effects of nonuniform error rates in the representative examples of the 1D repetition code and the 2D toric code, focusing on when they have extended spatiotemporal correlations; these may arise, for instance, from rare events (such as cosmic rays) that temporarily elevate error rates over the entire code patch. These effects can be described in the corresponding statistical mechanics models for decoding, where long-range correlations in the error rates lead to extended rare regions of weaker coupling. For the 1D repetition code where the rare regions are linear, we find two distinct decodable phases: a conventional ordered phase in which logical failure rates decay exponentially with the code distance, and a rare-region dominated Griffiths phase in which failure rates are parametrically larger and decay as a stretched exponential. In particular, the latter phase is present when the error rates in the rare regions are above the bulk threshold. For the 2D toric code where the rare regions are planar, we find no decodable Griffiths phase: rare events which boost error rates above the bulk threshold lead to an asymptotic loss of threshold and failure to decode. Unpacking the failure mechanism implies that techniques for suppressing extended sequences of repeated rare events (which, without intervention, will be statistically present with high probability) will be crucial for QEC with the toric code.

classical statistical mechanics↗
DOE OSTI2021

Localization dynamics in a centrally coupled system

In systems in which interactions couple a central degree of freedom and a bath, one would expect signatures of the bath's phase to be reflected in the dynamics of the central degree of freedom. This has been recently explored in connection with many-body localized baths coupled with a central qubit or a single-cavity mode - systems with growing experimental relevance in various platforms. Such models also have an interesting connection with Floquet many-body localization via quantizing the external drive, although this has been relatively unexplored. Here we adapt the multilayer multiconfigurational time-dependent Hartree (ML-MCTDH) method, a well-known tree tensor network algorithm, to numerically simulate the dynamics of a central degree of freedom, represented by a d-level system (qudit), coupled to a disordered interacting one-dimensional spin bath. ML-MCTDH allows us to reach ≈10 2 lattice sites, a far larger system size than what is feasible with exact diagonalization or kernel polynomial methods. From the intermediate time dynamics, we find a well-defined thermodynamic limit for the qudit dynamics upon appropriate rescaling of the system-bath coupling. The spin system shows similar scaling collapse in the Edward-Anderson spin-glass order parameter or entanglement entropy at relatively short times. At longer timescales, we see slow growth of the entanglement, which may arise from dephasing mechanisms in the localized system or long-range interactions mediated by the central degree of freedom. Similar signs of localization are shown to appear as well with unscaled system-bath coupling.

1-dimensional spin chains↗
DOE OSTI2021

Particle track classification using quantum associative memory

Pattern recognition algorithms are commonly employed to simplify the challenging and necessary step of track reconstruction in sub-atomic physics experiments. Aiding in the discrimination of relevant interactions, pattern recognition seeks to accelerate track reconstruction by isolating signals of interest. In high collision rate experiments, such algorithms can be particularly crucial for determining whether to retain or discard information from a given interaction even before the data is transferred to tape. As data rates, detector resolution, noise, and inefficiencies increase, pattern recognition becomes more computationally challenging, motivating the development of higher efficiency algorithms and techniques. Quantum associative memory is an approach that seeks to exploits quantum mechanical phenomena to gain advantage in learning capacity, or the number of patterns that can be stored and accurately recalled. Here, we study quantum associative memory based on quantum annealing and apply it to the particle track classification. We focus on discrimination models based on Ising formulations of quantum associative memory model (QAMM) recall and quantum content-addressable memory (QCAM) recall. We characterize classification performance of these approaches as a function detector resolution, pattern library size, and detector inefficiencies, using the D-Wave 2000Q processor as a testbed. Discrimination criteria is set using both solution-state energy and classification labels embedded in solution states. We find that energy-based QAMM classification performs well in regimes of small pattern density and low detector inefficiency. In contrast, state-based QCAM achieves reasonably high accuracy recall for large pattern density and the greatest recall accuracy robustness to a variety of detector noise sources.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗
DOE OSTI2022

Using Hyperoptimized Tensor Networks and First-Principles Electronic Structure to Simulate the Experimental Properties of the Giant {Mn 84 } Torus

The single-molecule magnet {Mn 84 } is a challenge to theory because of its high nuclearity. Here, we directly compute two experimentally accessible observables, the field-dependent magnetization up to 75 T and the temperature-dependent heat capacity, using parameter-free theory. In particular, we use first-principles calculations to derive short- and long-range exchange interactions and compute the exact partition function of the resulting classical Potts and Ising spin models for all 84 Mn S = 2 spins to obtain observables. The latter computation is made possible by using hyperoptimized tensor network contractions, a technique developed to simulate quantum supremacy circuits. We also synthesize the magnet and measure its heat capacity and magnetization, observing qualitative agreement between theory and experiment and identifying an unusual bump in the heat capacity and a plateau in the magnetization. Our work also identifies some limitations of current theoretical modeling in large magnets, such as sensitivity to small, long-range exchange couplings.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2024

Large-scale simulations of Floquet physics on near-term quantum computers

Abstract Periodically driven quantum systems exhibit a diverse set of phenomena but are more challenging to simulate than their equilibrium counterparts. Here, we introduce the Quantum High-Frequency Floquet Simulation (QHiFFS) algorithm as a method to simulate fast-driven quantum systems on quantum hardware. Central to QHiFFS is the concept of a kick operator which transforms the system into a basis where the dynamics is governed by a time-independent effective Hamiltonian. This allows prior methods for time-independent simulation to be lifted to simulate Floquet systems. We use the periodically driven biaxial next-nearest neighbor Ising (BNNNI) model, a natural test bed for quantum frustrated magnetism and criticality, as a case study to illustrate our algorithm. We implemented a 20-qubit simulation of the driven two-dimensional BNNNI model on Quantinuum’s trapped ion quantum computer. Our error analysis shows that QHiFFS exhibits not only a cubic advantage in driving frequency ω but also a linear advantage in simulation time t compared to Trotterization.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2024

Quantum subspace expansion in the presence of hardware noise

Finding ground state energies on current quantum processing units (QPUs) using algorithms such as the variational quantum eigensolver (VQE) continues to pose challenges. Hardware noise severely affects both the expressivity and trainability of parameterized quantum circuits, limiting them to shallow depths in practice. Here, we demonstrate that both issues can be addressed by synergistically integrating VQE with a quantum subspace expansion, allowing for an optimal balance between quantum and classical computing capabilities and costs. We perform a systematic benchmark analysis of the iterative quantum-assisted eigensolver in the presence of hardware noise. We determine ground state energies of 1D and 2D mixed-field Ising spin models on noisy simulators and the IBM QPUs ibmq_quito (5 qubits) and ibmq_guadalupe (16 qubits). To maximize accuracy, we propose a suitable criterion to select the subspace basis vectors according to the trace of the noisy overlap matrix. Finally, we show how to systematically approach the exact solution by performing controlled quantum error mitigation based on probabilistic error reduction on the noisy backend fake_guadalupe.

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 OSTI2023

Short-range magnetic correlations in quasicrystalline i -Tb-Cd

Here, we report on elastic and inelastic neutron scattering from single-grain isotopically enriched samples to elucidate the local magnetic correlations between Tb 3+ moments in quasicrystalline i -Tb-Cd. The inelastic neutron scattering measurements of the crystalline electric field excitations demonstrated that the Tb 3+ moments are directed primarily along the local fivefold axes of the Tsai-type cluster as was found for the TbCd 6 approximant phase. Based on the inelastic measurements, we consider a simple Ising-type model for the moment configurations on a single Tb 3+ icosahedron and enumerate the lowest energy moment configurations. We then calculate the diffuse scattering from these configurations and compare with the experimental magnetic diffuse scattering measurements to identify the most likely single cluster moment configurations and find reasonable agreement between the broad features observed in our scattering simulations. We further use a heuristic glass model as well as large-scale Monte-Carlo simulations of a multicluster model to consider the role of higher-order (longer-range) intercluster correlations for magnetic frustration and the magnetic scattering.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2021

Direct Observation of Collective Electronuclear Modes about a Quantum Critical Point

We directly measure the low energy excitation modes of the quantum Ising magnet LiHoF 4 using microwave spectroscopy. Instead of a single electronic mode, we find a set of collective electronuclear modes, in which the spin-1/2 Ising electronic spins hybridize with the bath of spin-7/2 Ho nuclear spins. The lowest-lying electronuclear mode softens at the approach to the quantum critical point, even in the presence of disorder. This softening is rapidly quenched by a longitudinal magnetic field. Similar electronuclear structures should exist in other spin-based quantum Ising systems.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗