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.

翻译：一般字符串问题可以通过使用诸如后缀树和后缀数组等特殊数据结构来更快地求解。本文表明，这些数据结构中所用的后缀可以通过作为量子算符的循环矩阵来获得，且该算符可在对数时间内实现。因此，若字符串以量子态形式给出，利用所提出的电路实现，可以在量子计算机上高效地进行字符串处理。