The pitfalls of planar spin-glass benchmarks: Raising the bar for quantum annealers (again)
| Autor: | Helmut G. Katzgraber, Salvatore Mandrà, Creighton K. Thomas |
|---|---|
| Rok vydání: | 2017 |
| Předmět: |
Quantum Physics
Physics and Astronomy (miscellaneous) Matching (graph theory) Computer science Materials Science (miscellaneous) FOS: Physical sciences Disordered Systems and Neural Networks (cond-mat.dis-nn) Condensed Matter - Disordered Systems and Neural Networks Network topology 01 natural sciences Atomic and Molecular Physics and Optics 010305 fluids & plasmas Computer engineering Gadget 0103 physical sciences Benchmark (computing) Electrical and Electronic Engineering 010306 general physics Heuristics Focus (optics) Quantum Physics (quant-ph) Quantum Time complexity |
| DOI: | 10.48550/arxiv.1703.00622 |
| Popis: | In an effort to overcome the limitations of random spin-glass benchmarks for quantum annealers, focus has shifted to carefully-crafted gadget-based problems whose logical structure has typically a planar topology. Recent experiments on these gadget problems using a commercially-available quantum annealer have demonstrated an impressive performance over a selection of commonly-used classical optimization heuristics. Here we show that efficient classical optimization techniques, such as minimum-weight perfect matching, can solve these gadget problems exactly and in polynomial time. We present approaches on how to mitigate this shortcoming of commonly-used benchmark problems based on planar logical topologies. Comment: 5 pages, 2 figures |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|