arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2304.04075quant-ph
收藏

量子算法解决方案:在模拟相干伊辛机上求解最短向量问题

Quantum algorithmic solutions to the shortest vector problem on simulated coherent Ising machines

Edmund Dable-Heath, Laura Casas, Victor Hertz, Christian Porter, Florian Mintert, Cong Ling

AI总结:

本文利用二次无约束二元优化将最短向量问题映射为量子伊辛模型,在模拟相干伊辛机上求解,展示了三种算法变体的进展。

摘要:

量子计算对当代密码系统构成威胁,其进展预计将在未来几十年内达到引发问题的状态。许多旨在实现量子安全的拟议密码系统基于最短向量问题及相关问题。本文中,我们使用最短向量问题的二次无约束二元优化公式,将其实现为模拟相干伊辛机上的量子伊辛模型,展示了在求解三种算法变体的SVP方面取得的进展。

英文摘要:

Quantum computing poses a threat to contemporary cryptosystems, with advances to a state in which it will cause problems predicted for the next few decades. Many of the proposed cryptosystems designed to be quantum-secure are based on the Shortest Vector Problem and related problems. In this paper we use the Quadratic Unconstrained Binary Optimisation formulation of the Shortest Vector Problem implemented as a quantum Ising model on a simulated Coherent Ising Machine, showing progress towards solving SVP for three variants of the algorithm.

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

↑