Benchmarking the optimization optical machines with the planted solutions

We introduce universal, easy-to-reproduce generative models for the QUBO instances to differentiate the performance of the hardware/solvers effectively. Our benchmark process extends the well-known Hebb's rule of associative memory with the asymmetric pattern weights. We provide a comprehensive...

Full description

Saved in:
Bibliographic Details
Published inarXiv.org
Main Authors Stroev, Nikita, Berloff, Natalia G, Davidson, Nir
Format Paper
LanguageEnglish
Published Ithaca Cornell University Library, arXiv.org 02.04.2024
Subjects
Algorithms
Associative memory
Optimization
Online AccessGet full text

Cover

More Information
Summary:We introduce universal, easy-to-reproduce generative models for the QUBO instances to differentiate the performance of the hardware/solvers effectively. Our benchmark process extends the well-known Hebb's rule of associative memory with the asymmetric pattern weights. We provide a comprehensive overview of calculations conducted across various scales and using different classes of dynamical equations. Our aim is to analyze their results, including factors such as the probability of encountering the ground state, planted state, spurious state, or states falling outside the predetermined energy range. Moreover, the generated problems show additional properties, such as the easy-hard-easy complexity transition and complicated cluster structures of planted solutions. Our method establishes a prospective platform to potentially address other questions related to the fundamental principles behind device physics and algorithms for novel computing machines.
ISSN:2331-8422