arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2406.18130cs.ET
收藏

通过整数线性规划设计用于逻辑门模拟的单元 Ising 模型

Designing Unit Ising Models for Logic Gate Simulation through Integer Linear Programming

Shunsuke Tsukiyama, Koji Nakano, Xiaotian Li, Yasuaki Ito, Takumi Kato, Yuya Kawamata

AI总结:

本文提出通过整数线性规划设计系数仅为±1的单元Ising模型,以模拟逻辑电路并计算布尔函数及其逆函数,为利用专用量子退火器破解RSA密码系统提供了新方法。

摘要:

Ising 模型由被称为 Hamiltonian 的二次目标函数定义,该函数由取值为 $-1$ 或 $+1$ 的自旋变量组成。目标是为这些变量分配自旋值,以最小化 Hamiltonian 的值。Ising 模型在解决许多组合优化问题中发挥着重要作用,推动了针对其求解器开发的广泛研究。值得注意的是,D-Wave Systems 率先创建了量子退火器,即基于量子力学的可编程求解器,用于此类模型。本文提出了单元 Ising 模型,其中线性和二次项的所有非零系数均为 $-1$ 或 $+1$。由于量子退火器的分辨率有限,单元 Ising 模型更适合量子退火器寻找最优解。我们提出了一种新的单元 Ising 模型设计方法,通过整数线性规划来模拟计算 Boolean 函数的逻辑电路。通过使用量子退火器优化这些 Ising 模型,我们可以计算 Boolean 函数及其逆函数。利用针对逻辑电路的固定单元 Ising 模型,我们有望设计出用于计算逆函数的专用单元量子退火器(ASUQAs),这类似于数字电路中的专用集成电路(ASICs)。例如,若将该技术应用于乘法电路,我们可以设计出用于分解两个数字的 ASUQA。我们的研究结果表明,通过在因数分解中利用 ASUQAs,存在一种破坏 RSA 密码系统的强大新方法。

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑