Corpus ID: 235743188

State-efficient QFA Algorithm for Quantum Computers

@article{Salehi2021StateefficientQA,
  title={State-efficient QFA Algorithm for Quantum Computers},
  author={{\"O}zlem Salehi and A. Yakaryilmaz},
  journal={ArXiv},
  year={2021},
  volume={abs/2107.02262}
}
The study of quantum finite automata (QFA’s) is one of the possible approaches in exploring quantum computers with finite memory. Despite being one of the most restricted models, Moore-Crutchfield quantum finite automaton (MCQFA) is proven to be exponentially more succinct than classical finite automata models in recognizing certain languages such as MODp = {a | j ≡ 0 mod p}, where p is a prime number. In this paper, we present a modified MCQFA algorithm for the language MODp, the operators of… Expand

Figures and Tables from this paper

References

SHOWING 1-7 OF 7 REFERENCES
Implementing Quantum Finite Automata Algorithms on Noisy Devices
TLDR
This paper presents improved circuit based implementations for QFA algorithms recognizing the MODp problem using the Qiskit framework and provides a 3 qubit implementation for the MOD11 problem reducing the total number of required gates using alternative approaches. Expand
Automata and Quantum Computing
TLDR
This paper surveys various models of quantum finite automata and their properties, and provides some open questions and new directions for researchers. Expand
1-way quantum finite automata: strengths, weaknesses and generalizations
  • A. Ambainis, R. Freivalds
  • Computer Science, Physics
  • Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280)
  • 1998
TLDR
This work constructs a 1-way QFA that is exponentially smaller than any equivalent classical (even randomized) finite automaton, and thinks that this construction may be useful for design of other space-efficient quantum algorithms. Expand
Improved Constructions of Quantum Automata
TLDR
A simple construction of quantum automata which achieve an exponential advantage over classical finite automata and the possibility to derandomize it is considered and some preliminary results in this direction are presented. Expand
Quantum automata and quantum grammars
TLDR
This work proposes quantum versions of finite-state and push-down automata, and regular and context-free grammars, and finds analogs of several classical theorems, including pumping lemmas, closure properties, rational and algebraic generating functions, and Greibach normal form. Expand
Efficient Z gates for quantum computing
For superconducting qubits, microwave pulses drive rotations around the Bloch sphere. The phase of these drives can be used to generate zero-duration arbitrary virtual $Z$ gates, which, combined withExpand
Kvantu Algoritmu Realizācija Fiziskā Kvantu Datorā
  • Master’s thesis, University of Latvia
  • 2018