Exploring Quantum Annealing Architectures: A Spin Glass Perspective

Abstract

We study the spin-glass transition in several Ising models of relevance for quantum annealers. We extract the spin-glass critical temperature by extrapolating the pseudo-critical properties obtained with Replica-Exchange Monte-Carlo for finite-size systems. We find a spin-glass phase for some random lattices (random-regular and small-world graphs) in good agreement with previous results. However, our results for the quasi-two-dimensional graphs implemented in the D-Wave annealers (Chimera, Zephyr, and Pegasus) indicate only a zero-temperature spin-glass state, as their pseudo-critical temperature drifts towards smaller values. This implies that the asymptotic runtime to find the low-energy configuration of those graphs is likely to be polynomial in system size, nevertheless, this scaling may only be reached for very large system sizes -- much larger than existing annealers -- as we observe an abrupt increase in the computational cost of the simulations around the pseudo-critical temperatures. Thus, two-dimensional systems with local crossings can display enough complexity to make unfeasible the search with classical methods of low-energy configurations.

13 pages

References in corpus (15)

• Critical phenomena in complex networks
• Logical quantum processor based on reconfigurable atom arrays
• Quantum Optimization of Maximum Independent Set using Rydberg Atom Arrays
• Quantum critical dynamics in a 5000-qubit programmable spin glass
• Coherent quantum annealing in a programmable 2000-qubit Ising chain
• Critical parameters from generalised multifractal analysis at the Anderson transition
• Quantum versus classical annealing: insights from scaling theory and results for spin glasses on 3-regular graphs
• Quantum annealing with ultracold atoms in a multimode optical resonator
• Solving optimization problems with Rydberg analog quantum computers: Realistic requirements for quantum advantage using noisy simulation and classical benchmarks
• Scaling up the Anderson transition in random-regular graphs
• Temperature Chaos in Two-Dimensional Ising Spin Glasses with Binary Couplings: a Further Case for Universality
• Exploring Quantum Annealing Architectures: A Spin Glass Perspective
• Critical properties of the four-state Commutative Random Permutation Glassy Potts model in three and four dimensions
• Monte Carlo algorithms are very effective in finding the largest independent set in sparse random graphs
• Stoquasticity in circuit QED

Cited by in corpus (4)

• Exploring Quantum Annealing Architectures: A Spin Glass Perspective
• Initial State Encoding via Reverse Quantum Annealing and h-gain Features
• Hyperoptimized approximate contraction of tensor networks for rugged-energy-landscape spin glasses on periodic square and cubic lattices
• Increasing the Hardness of Posiform Planting Using Random QUBOs for Programmable Quantum Annealer Benchmarking