Jaeyong Jeong

Oct 21, 2024 | onlinelibrary.wiley.com | Hyun Kim |Juhyuk Park |Joon Pyo Kim |Jaeyong Jeong

1 Introduction Efficiently solving combinatorial optimization problems (COPs) is crucial, given their extensive applications in critical domains such as artificial intelligence, finance, drug discovery, cryptography, telecommunications, and more.[1] These problems, classified as nondeterministic polynomial-time hard (NP-hard), present significant computational challenges, with the difficulty of finding optimal solutions increasing exponentially with problem size.[2] The Ising model,...