Strings 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.

翻译：一般的字符串问题可以通过使用特殊的数据结构来更快地解决,例如在许多情况下以树和阵列结构的后缀。在本文中,我们表明,这些数据结构中使用的后缀可以通过使用碳气矩阵作为量子运算器来获得,量子运算器可以在对数时间执行。因此,如果字符串以量子状态表示,使用显示的电路实施,就可以在量子计算机上有效地处理弦。