We propose a couple of oracle construction methods for quantum pattern matching. One of the constructs is based upon the conventional string comparison method. This, along with a unique input state preparation, when combined with the Grover’s search algorithm, results in a deterministic exact and partial pattern matching logic. The other method generates a superposition of Hamming distances between the searched pattern and all the substrings formed from the input string. The measurement statistics from a large ensemble would provide data on the closest match. We show that this method can leverage parallel computing for enhanced performance. Alternatively, it can also be combined with the minimum finding algorithm for a deterministic outcome.

我们提出了两种用于量子模式匹配的oracle构造方法。构造之一是基于常规字符串比较方法的。当与Grover的搜索算法结合使用时，再加上独特的输入状态准备，可以产生确定的精确和部分模式匹配逻辑。另一种方法在搜索的模式与从输入字符串形成的所有子字符串之间生成汉明距离的叠加。来自大型合奏的测量统计信息将提供最匹配的数据。我们证明了这种方法可以利用并行计算来增强性能。可替代地，它也可以与最小发现算法相结合以获得确定的结果。