.png){kind=icon}
.png){kind=icon}
Return
Analog errors in Ising machines
.png){kind=icon}
OA
AI
DOI：10.1088/2058-9565/ab13ea.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Recent technological breakthroughs have precipitated the availability of specialized devices that promise to solve NP-Hard problems faster than standard computers. These 'Ising Machines' are however analog in nature and as such inevitably have implementation errors. We find that their success probability decays exponentially with problem size for a fixed error level, and we derive a sufficient scaling law for the error in order to maintain a fixed success probability. We corroborate our results with experiment and numerical simulations and discuss the practical implications of our findings.
Keywords:
Ising optimization
quantum annealing
analog implementation errors
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
5
Papers:
1.4K
Citations:
5.1K