Model of the quantum finite automata libraryĪutomaton Definition. The available pieces of software were either too low-level, focusing on quantum gates and quantum phenomena in micro-scale, or too abstract, providing interfaces for developing quantum algorithms in general, but without tools dedicated specifically for quantum automata. However, we have not found a solution focused solely on quantum finite automata. Examples of such libraries include ProjectQ 4, Qiskit 5 and the aforementioned Q#. They often enable using real life simulators or quantum computers as their back-ends. The high-level libraries provide similar functionalities but focus more on code expressiveness. The low-level libraries include Quirk 2, with graphical interface available through a web browser, or Quantum++ 3, a high performance library written in C++11. On the other hand, there have been many libraries focused on bringing quantum computation onto the classical architectures, perhaps the best known being Q# 1. A comprehensive survey of simulators of classical finite automata is given in and JFLAP emerges as the most mature and popular tool. Simulation of classical finite automata is a mature area. The library could also be useful for teaching students courses on finite automata in a quantum context. The library can help in exploring hypotheses on unknown relations between classes of quantum finite automata and quantum languages by providing evidence about accepting probabilities of particular words and sets of words. This paper presents the library for simulating quantum finite automata. Because of that, we developed a library written in Python, running on a classical computer and providing implementation of several types of quantum finite automata. However, such devices are not yet available and simulators have to be used instead. Studying these languages is useful in establishing the computational and expressive power of quantum machines in general. The task of quantum finite automata is to recognise quantum languages. The picture for theory of quantum automata and languages generated by them is less clear, and various important problems remain open. Connections with different domains, including algebra and logics, have also been established. Since the introduction of finite automata in 1959 by Rabin and Scott, the theme has been quite well recognized and approached from various aspects. Finite automata are also interesting models themselves, due to their simplicity but at the same time rich structure and interesting properties. Finite automata are real models of computers, which have only limited amount of memory.
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |