论文标题
将量子搜索算法应用于经典数据库的方法
A Method for Application of a Quantum Search Algorithm to Classical Databases
论文作者
论文摘要
Grover的算法通常是作为搜索数据库的一种方法，但是它将更准确地描述为识别满足某些逻辑从句的整数间隔的元素的一种方法 - 一个示例可能是识别与Sudoku问题解决方案相对应的二进制字符串。在本文中，我们提出了使用Grover的搜索算法执行真实数据库搜索的第一种方法，该方法是首先创建从范围0：2^n-1中的一组索引到一组数据库元素，然后将条款应用于这些元素的一组。然后，我们基于Grover对通过数字字段筛选算法生成的候选解决方案数据库的搜索来证明对Diffie-Hellman密码系统进行攻击的可行性。
Grover's algorithm is normally presented as a method of searching a database, however it would be more accurately described as a method of identifying elements of an interval of the integers which satisfy some logical clause - an example might be identifying binary strings which correspond to the solutions of a Sudoku problem. In this paper we present the first method of performing a true database search using Grover's search algorithm, by first creating a mapping from a set of indices in the range 0:2^n-1 to a set of database elements, then applying the clause to these elements. We then demonstrate the feasibility of an attack against the Diffie-Hellman cryptosystem based on a Grover's search of a database of candidate solutions generated via the number field sieve algorithm.
