分布式量子离散对数算法
Distributed Quantum Discrete Logarithm Algorithm
AI总结:
本文提出一种分布式量子离散对数算法,通过减少量子寄存器规模并提高成功概率,解决离散对数问题。
摘要:
解决量子计算机中的离散对数问题(DLP)是一项基础任务,具有重要影响。除了Shor算法外,近年来许多研究者提出了替代方案。然而,由于当前硬件限制,量子计算机能处理的DLP实例规模仍不足。为克服这一限制,我们提出一种分布式量子离散对数算法,以减少解决DLP所需的量子寄存器大小。具体而言,我们设计了一种分布式量子算法,用于确定解是否包含在给定的集合中。基于此过程,我们的方法通过识别包含解的集合的交集来解决DLP。与Shor原始算法相比,我们的方法减少了寄存器大小,提高了成功概率,且不需要量子通信。
英文摘要:
Solving the discrete logarithm problem (DLP) with quantum computers is a fundamental task with important implications. Beyond Shor's algorithm, many researchers have proposed alternative solutions in recent years. However, due to current hardware limitations, the scale of DLP instances that can be addressed by quantum computers remains insufficient. To overcome this limitation, we propose a distributed quantum discrete logarithm algorithm that reduces the required quantum register size for solving DLPs. Specifically, we design a distributed quantum algorithm to determine whether the solution is contained in a given set. Based on this procedure, our method solves DLPs by identifying the intersection of sets containing the solution. Compared with Shor's original algorithm, our approach reduces the register size and can improve the success probability, while requiring no quantum communication.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。