# Best-case performance of quantum annealers on native spin-glass benchmarks: How chaos can affect success probabilities

@article{Zhu2015BestcasePO, title={Best-case performance of quantum annealers on native spin-glass benchmarks: How chaos can affect success probabilities}, author={Zheng Zhu and Andrew J. Ochoa and Stefan Schnabel and Firas Hamze and Helmut G. Katzgraber}, journal={Physical Review A}, year={2015}, volume={93}, pages={012317} }

Recent tests performed on the D-Wave Two quantum annealer have revealed no clear evidence of speedup over conventional silicon-based technologies. Here we present results from classical parallel-tempering Monte Carlo simulations combined with isoenergetic cluster moves of the archetypal benchmark problem---an Ising spin glass---on the native chip topology. Using realistic uncorrelated noise models for the D-Wave Two quantum annealer, we study the best-case resilience, i.e., the probability that…

## 64 Citations

Inhomogeneous driving in quantum annealers can result in orders-of-magnitude improvements in performance

- PhysicsQuantum Science and Technology
- 2020

Quantum annealers are special-purpose quantum computers that primarily target solving Ising optimization problems. Theoretical work has predicted that the probability of a quantum annealer ending in…

Seeking Quantum Speedup Through Spin Glasses: The Good, the Bad, and the Ugly

- Computer Science
- 2015

This work proposes to complement head-to-head scaling studies that compare quantum annealing machines to state-of-the-art classical codes with an approach that compares the performance of different algorithms and/or computing architectures on different classes of computationally hard tunable spin-glass instances.

Exponentially Biased Ground-State Sampling of Quantum Annealing Machines with Transverse-Field Driving Hamiltonians.

- PhysicsPhysical review letters
- 2017

While naive transverse-field quantum annealing on the D-Wave 2X device can find the ground-state energy of the problems, it is not well suited in identifying all degenerate ground- state configurations associated with a particular instance and some states are exponentially suppressed.

Analog errors in quantum annealing: doom and hope

- Physicsnpj Quantum Information
- 2019

It is shown that J-chaos causes a catastrophic failure of quantum annealing, in that the scaling of the time-to-solution metric becomes worse than that of a deterministic (exhaustive) classical solver, and this doomsday scenario can be mitigated using a simple error suppression and correction scheme known as QAC.

Uncertain fate of fair sampling in quantum annealing

- PhysicsPhysical Review A
- 2019

Recently, it was demonstrated both theoretically and experimentally on the D-Wave quantum annealer that transverse-field quantum annealing does not find all ground states with equal probability. In…

Zero-temperature quantum annealing bottlenecks in the spin-glass phase

- PhysicsNature communications
- 2016

Here it is shown how for large problems the complexity becomes dominated by O(log N) bottlenecks inside the spin-glass phase, where the gap scales as a stretched exponential.

Readiness of Quantum Optimization Machines for Industrial Applications

- Computer SciencePhysical Review Applied
- 2019

Although the results show that transverse-field quantum annealing is outperformed by state-of-the-art classical optimization algorithms, these benchmark instances are hard and small in the size of the input, therefore representing the first industrial application ideally suited for testing near-term Quantum annealers and other quantum algorithmic strategies for optimization problems.

Computational Bottlenecks of Quantum Annealing

- Physics
- 2015

A promising approach to solving hard binary optimisation problems is quantum adiabatic annealing (QA) in a transverse magnetic field. An instantaneous ground state --- initially a symmetric…

Simulated-quantum-annealing comparison between all-to-all connectivity schemes

- Physics
- 2016

Quantum annealing aims to exploit quantum mechanics to speed up the search for the solution to optimization problems. Most problems exhibit complete connectivity between the logical spin variables…

Fair sampling of ground-state configurations of binary optimization problems.

- PhysicsPhysical review. E
- 2019

An approach to sample ground-state (or low-energy) configurations for binary optimization problems and a simple heuristic to approximate the number of solutions of a degenerate problem is introduced.

## References

SHOWING 1-10 OF 78 REFERENCES

Glassy Chimeras could be blind to quantum speedup: Designing better benchmarks for quantum annealing machines

- Physics
- 2014

The results show that a careful design of the hardware architecture and benchmark problems is key when building quantum annealing machines, and proposes alternative benchmarks by embedding potentially harder problems on the Chimera topology.

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

- Computer Science
- 2015

This work introduces a method to construct a set of frustrated Ising-model optimization problems with tunable hardness, and studies the performance of a D-Wave Two device with up to 503 qubits on these problems and compares it to a suite of classical algorithms.

Seeking Quantum Speedup Through Spin Glasses: The Good, the Bad, and the Ugly

- Computer Science
- 2015

This work proposes to complement head-to-head scaling studies that compare quantum annealing machines to state-of-the-art classical codes with an approach that compares the performance of different algorithms and/or computing architectures on different classes of computationally hard tunable spin-glass instances.

Thermally assisted quantum annealing of a 16-qubit problem.

- PhysicsNature communications
- 2013

It is experimentally demonstrated that, even with annealing times eight orders of magnitude longer than the predicted single-qubit decoherence time, the probabilities of performing a successful computation are similar to those expected for a fully coherent system.

Quantum Optimization of Fully-Connected Spin Glasses

- Physics
- 2014

The Sherrington-Kirkpatrick model with random $\pm1$ couplings is programmed on the D-Wave Two annealer featuring 509 qubits interacting on a Chimera-type graph. The performance of the optimizer…

Error-corrected quantum annealing with hundreds of qubits.

- PhysicsNature communications
- 2014

A substantial improvement over the performance of the processors in the absence of error correction is demonstrated, paving the way towards large-scale noise-protected adiabatic quantum optimization devices, although a threshold theorem such as has been established in the circuit model of quantum computing remains elusive.

Reexamining classical and quantum models for the D-Wave One processor

- Physics
- 2015

We revisit the evidence for quantum annealing in the D-Wave One device (DW1) based on the study of random Ising instances. Using the probability distributions of finding the ground states of such…

CORRIGENDUM: Optimization using quantum mechanics: quantum annealing through adiabatic evolution

- Physics
- 2006

We review here some recent work in the field of quantum annealing, alias adiabatic quantum computation. The idea of quantum annealing is to perform optimization by a quantum adiabatic evolution which…

Experimental signature of programmable quantum annealing.

- PhysicsNature communications
- 2013

This experiment uses groups of eight superconducting flux qubits with programmable spin-spin couplings, embedded on a commercially available chip with >100 functional qubits, and suggests that programmable quantum devices, scalable with currentsuperconducting technology, implement quantum annealing with a surprising robustness against noise and imperfections.

Quantum annealing with manufactured spins

- PhysicsNature
- 2011

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.