Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
173 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Unraveling Quantum Annealers using Classical Hardness (1502.02494v1)

Published 9 Feb 2015 in quant-ph and cond-mat.dis-nn

Abstract: Recent advances in quantum technology have led to the development and manufacturing of experimental programmable quantum annealing optimizers that contain hundreds of quantum bits. These optimizers, named D-Wave' chips, promise to solve practical optimization problems potentially faster than conventionalclassical' computers. Attempts to quantify the quantum nature of these chips have been met with both excitement and skepticism but have also brought up numerous fundamental questions pertaining to the distinguishability of quantum annealers from their classical thermal counterparts. Here, we propose a general method aimed at answering these, and apply it to experimentally study the D-Wave chip. Inspired by spin-glass theory, we generate optimization problems with a wide spectrum of `classical hardness', which we also define. By investigating the chip's response to classical hardness, we surprisingly find that the chip's performance scales unfavorably as compared to several analogous classical algorithms. We detect, quantify and discuss purely classical effects that possibly mask the quantum behavior of the chip.

Summary

We haven't generated a summary for this paper yet.