本頁只刊出中文翻譯與中文說明；英文原文請見下方原文連結。
原文連結
論文資訊
- 類型：已發表論文
- 日期：2015-09-01
摘要
There has been considerable progress in the design and construction of 量子 annealing devices. However, a conclusive detection of 量子 speedup over traditional silicon-based machines remains elusive, despite multiple careful studies. In this work we outline strategies to design hard tunable benchmark instances based on insights from the study of spin glasses-the archetypal random benchmark problem for novel algorithms and optimization devices. We propose to complement head-to-head 縮放律 studies that compare 量子 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 計算ly hard tunable spin-glass instances. The advantage of such an approach lies in having to compare only the
※ 此為已發表論文，全文需透過期刊付費取得