The pitfalls of planar spin-glass benchmarks: raising the bar for quantum annealers (again)

Abstract

In an effort to overcome the limitations of random spin-glass benchmarks for\nquantum annealers, focus has shifted to carefully-crafted gadget-based problems\nwhose logical structure has typically a planar topology. Recent experiments on\nthese gadget problems using a commercially-available quantum annealer have\ndemonstrated an impressive performance over a selection of commonly-used\nclassical optimization heuristics. Here we show that efficient classical\noptimization techniques, such as minimum-weight perfect matching, can solve\nthese gadget problems exactly and in polynomial time. We present approaches on\nhow to mitigate this shortcoming of commonly-used benchmark problems based on\nplanar logical topologies.\n

Affiliated Institutions

• Stinger Ghaffarian Technologies (United States) US
• Texas A&M University US
• Ames Research Center US
• QLT (Canada) CA
• Santa Fe Institute US
• 1QBit
• Google (United States) US

Related Publications