论文标题
基于量子指纹技术的QFA的确定性结构
Deterministic Construction of QFAs based on the Quantum Fingerprinting Technique
论文作者
论文摘要
众所周知，对于某些语言，量子有限自动机比经典的同行更有效。特别是，识别语言$ mod_p $的QFA比经典有限自动机具有指数优势。但是，这种QFA的构建是概率的。在当前的工作中，我们建议对语言$ mod_p $的QFA的确定性结构。我们为Promise问题构建QFA $ palindrome_s $，并使用Qiskit库工具在IBMQ模拟器上实现此QFA。
It is known that for some languages quantum finite automata are more efficient than classical counterparts. Particularly, a QFA recognizing the language $MOD_p$ has an exponential advantage over the classical finite automata. However, the construction of such QFA is probabilistic. In the current work, we propose a deterministic construction of the QFA for the language $MOD_p$. We construct a QFA for a promise problem $Palindrome_s$ and implement this QFA on the IBMQ simulator using qiskit library tools.
