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 $...

Full description

Saved in:
Bibliographic Details
Published in:International journal of parallel, emergent and distributed systems Vol. 40; no. 2; pp. 116 - 136
Main Authors: Tsukiyama, Shunsuke, Nakano, Koji, Parque, Victor, Ito, Yasuaki, Kato, Takumi, Kawamata, Yuya, Ii, Kaiki
Format: Journal Article
Language:English
Published: Taylor & Francis 04.03.2025
Subjects:
application specific hardware
factorization
integer linear programming
one-way function
Quantum computing
ISSN:1744-5760, 1744-5779
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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