论文标题
循环矩阵的量子实现及其在量子字符串处理中的使用
Quantum implementation of circulant matrices and its use in quantum string processing
论文作者
论文摘要
通常，可以使用特殊的数据结构（例如在树木和阵列构成的后缀）来更快地解决字符串问题。在本文中，我们表明可以通过使用循环矩阵作为量子运算符来获得这些数据结构中使用的后缀，该量子可以在对数时间中实现。因此，如果将字符串作为量子状态给出，则使用提出的电路实现，可以在量子计算机上有效地进行字符串处理。
String problems in general can be solved faster by using special data structures such as suffixes in many cases structured as trees and arrays. In this paper, we show that suffixes used in those data structures can be obtained by using circulant matrices as a quantum operator which can be implemented in logarithmic time. Hence, if the strings are given as quantum states, using the presented circuit implementation one can do string processing efficiently on quantum computers.
