2024/06/26 by Shunsuke Tsukiyama, Tsukiyama, Shunsuke, Koji Nakano +9 · 2 citations
Computer Science · Engineering · #Emerging Technologies (cs.ET) #FOS: Computer and information sciences #Formal Methods in Verification #VLSI and Analog Circuit Testing #VLSI and FPGA Design Techniques
paper · pdf · doi:10.48550/arxiv.2406.18130
openalex publication_date 2024/06/26 · openalex created_date 2024/06/28 · openalex updated_date 2026/07/28
An Ising model is defined by a quadratic objective function known as the Hamiltonian, composed of spin variables that can take values of either -1 or +1. The goal is to assign spin values to these variables in a way that minimizes the value of the Hamiltonian. Ising models are instrumental in tackling many combinatorial optimization problems, leading to significant research in developing solvers for them. Notably, D-Wave Systems has pioneered the creation of quantum annealers, programmable solvers based on quantum mechanics, for these models. This paper introduces unit Ising models, where all non-zero coefficients of linear and quadratic terms are either -1 or +1. Due to the limited resolution of quantum annealers, unit Ising models are more suitable for quantum annealers to find optimal solutions. We propose a novel design methodology for unit Ising models to simulate logic circuits computing Boolean functions through integer linear programming. By optimizing these Ising models with quantum annealers, we can compute Boolean functions and their inverses. With a fixed unit Ising model for a logic circuit, we can potentially design Application-Specific Unit Quantum Annealers (ASUQAs) for computing the inverse function, which is analogous to Application-Specific Integrated Circuits (ASICs) in digital circuitry. For instance, if we apply this technique to a multiplication circuit, we can design an ASUQA for factorization of two numbers. Our findings suggest a powerful new method for compromising the RSA cryptosystem by leveraging ASUQAs in factorization.