Frustrated Ising Model on D-wave Quantum Annealing Machine

  title={Frustrated Ising Model on D-wave Quantum Annealing Machine},
  author={Ha Ryung Park and Hunpyo Lee},
  journal={Journal of the Physical Society of Japan},
  • H. ParkHunpyo Lee
  • Published 11 October 2021
  • Physics
  • Journal of the Physical Society of Japan
We study the frustrated Ising model on the two-dimensional L × L square lattice with ferromagnetic (FM) nearest-neighbor and antiferromagnetic diagonal-neighbor interactions using the D-wave quantum annealing machine (D-QAM) with 5000+ qubits composed on structure of the Pegasus graph. As the former Monte Carlo and mean field results, we find the FM to stripe order phase transition, through observations of the magnetization M , energy, magnetic susceptibility and structure factor. We also analyze… 
1 Citations

Figures from this paper

Determination of Chain Strength induced by Embedding in D-Wave Quantum Annealer

The D-wave quantum annealer requires embedding with ferromagnetic (FM) chains connected by several qubits, because it cannot capture exact long-range coupling between qubits, and retains the specific



Phase transitions in the frustrated Ising model on the square lattice

We consider the thermal phase transition from a paramagnetic to stripe-antiferromagnetic phase in the frustrated two-dimensional square-lattice Ising model with competing interactions J1 0 (second

Quantum annealing in the transverse Ising model

We introduce quantum fluctuations into the simulated annealing process of optimization problems, aiming at faster convergence to the optimal state. Quantum fluctuations cause transitions between

Simulating the Shastry-Sutherland Ising Model Using Quantum Annealing

Frustration represents an essential feature in the behavior of magnetic materials when constraints on the microscopic Hamiltonian cannot be satisfied simultaneously. This gives rise to exotic phases

Ashkin-teller criticality and pseudo-first-order behavior in a frustrated Ising model on the square lattice.

We study the challenging thermal phase transition to stripe order in the frustrated square-lattice Ising model with couplings J(1) < 0 (nearest-neighbor, ferromagnetic) and J(2) > 0 (second-neighbor,

Observation of topological phenomena in a programmable lattice of 1,800 qubits

A large-scale programmable quantum simulation is described, using a D-Wave quantum processor to simulate a two-dimensional magnetic lattice in the vicinity of a topological phase transition.

Theory of Quantum Annealing of an Ising Spin Glass

By comparing classical and quantum Monte Carlo annealing protocols on the two-dimensional random Ising model (a prototype spin glass), this work confirms the superiority of quantumAnnealing relative to classical annealed and proposes a theory of quantum annealer based on a cascade of Landau-Zener tunneling events.

Quantum annealing with manufactured spins

This programmable artificial spin network bridges the gap between the theoretical study of ideal isolated spin networks and the experimental investigation of bulk magnetic samples, and may provide a practical physical means to implement a quantum algorithm, possibly allowing more-effective approaches to solving certain classes of hard combinatorial optimization problems.

Scaling advantage over path-integral Monte Carlo in quantum simulation of geometrically frustrated magnets

Experimental observations of equilibration in PIMC simulations of geometrically frustrated magnets suggest a dynamical advantage in the quantum simulation compared with spatially local update dynamics of path-integral Monte Carlo, and that near-term quantum devices can be used to accelerate computational tasks of practical relevance.

Crystal statistics. I. A two-dimensional model with an order-disorder transition

The partition function of a two-dimensional "ferromagnetic" with scalar "spins" (Ising model) is computed rigorously for the case of vanishing field. The eigenwert problem involved in the

Hybrid quantum annealing via molecular dynamics

A novel quantum–classical hybrid scheme is proposed to efficiently solve large-scale combinatorial optimization problems. The key concept is to introduce a Hamiltonian dynamics of the classical flux