Author
Birkan, U., Köken, Özlem Salehi, Olejar, V., Nurlu, C., Yakaryılmaz, A.
Publication Date
2021
Publication Place
-
Springer
Subject
Quantum algorithms, Quantum circuit, Quantum finite automata, Rotation gate
Type
Document
Language
English
Digital
Yes
Manuscript
No
Library
Özyeğin University
Library Asset ID
978-303077979-5
Record ID
bda4dfb1-5595-40db-b482-22f6a7d88e40
Library Location
Computer Science
Date
2021
Notes
QResearch Department of QWorld ; TÜBİTAK ; European Regional Development Fund
Sample Text
Quantum finite automata (QFAs) literature offers an alternative mathematical model for studying quantum systems with finite memory. As a superiority of quantum computing, QFAs have been shown exponentially more succinct on certain problems such as recognizing the language MODp={aj∣j≡0modp} with bounded error, where p is a prime number. In this paper we present improved circuit based implementations for QFA algorithms recognizing the MODp problem using the Qiskit framework. We focus on the case p= 11 and provide a 3 qubit implementation for the MOD11 problem reducing the total number of required gates using alternative approaches. We run the circuits on real IBM quantum devices but due to the limitation of the real quantum devices in the NISQ era, the results are heavily affected by the noise. This limitation reveals once again the need for algorithms using less amount of resources. Consequently, we consider an alternative 3 qubit implementation which works better in practice and obtain promising results even for the problem MOD31.
DOI
10.1007/978-3-030-77980-1_1
Cilt
12747 LNCS
