Deterministic Construction of QFAs based on the Quantum Fingerprinting Technique
Quantum Physics
2023-01-02 v1
Abstract
It is known that for some languages quantum finite automata are more efficient than classical counterparts. Particularly, a QFA recognizing the language 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 . We construct a QFA for a promise problem and implement this QFA on the IBMQ simulator using qiskit library tools.
Cite
@article{arxiv.2212.14442,
title = {Deterministic Construction of QFAs based on the Quantum Fingerprinting Technique},
author = {Aliya Khadieva and Mansur Ziatdinov},
journal= {arXiv preprint arXiv:2212.14442},
year = {2023}
}