Designing unit Ising models for logic gate simulation through integer linear programming

Ising models minimizing a quadratic objective function with spin variables of either $ {-}1 $ − 1 or $ +1 $ + 1 are instrumental in tackling combinatorial optimization problems by programmable Quantum Annealers. This paper introduces unit Ising models, where non-zero coefficients are restricted to $...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	International journal of parallel, emergent and distributed systems Ročník 40; číslo 2; s. 116 - 136
Hlavní autoři:	Tsukiyama, Shunsuke, Nakano, Koji, Parque, Victor, Ito, Yasuaki, Kato, Takumi, Kawamata, Yuya, Ii, Kaiki
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Taylor & Francis 04.03.2025
Témata:	application specific hardware factorization integer linear programming one-way function Quantum computing
ISSN:	1744-5760, 1744-5779
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Popis
Shrnutí:	Ising models minimizing a quadratic objective function with spin variables of either $ {-}1 $ − 1 or $ +1 $ + 1 are instrumental in tackling combinatorial optimization problems by programmable Quantum Annealers. This paper introduces unit Ising models, where non-zero coefficients are restricted to $ {-}1 $ − 1 or $ +1 $ + 1 . Due to the limited resolution of quantum annealers, unit Ising models are more suitable for quantum annealers. A fixed unit Ising model for logic circuits could lead to Application-Specific Unit Quantum Annealers (ASUQAs) for inverse function computation, similar to ASICs. Our findings suggest a powerful new method for compromising the RSA cryptosystem by leveraging ASUQAs for factorization.
ISSN:	1744-5760 1744-5779
DOI:	10.1080/17445760.2024.2438043