• Corpus ID: 244715109

Learning Quantum Finite Automata with Queries

@article{Qiu2021LearningQF,
  title={Learning Quantum Finite Automata with Queries},
  author={Daowen Qiu},
  journal={ArXiv},
  year={2021},
  volume={abs/2111.14041}
}
  • Daowen Qiu
  • Published 28 November 2021
  • Computer Science
  • ArXiv
Learning finite automata (termed as model learning) has become an important field in machine learning and has been useful realistic applications. Quantum finite automata (QFA) are simple models of quantum computers with finite memory. Due to their simplicity, QFA have well physical realizability, but one-way QFA still have essential advantages over classical finite automata with regard to state complexity (two-way QFA are more powerful than classical finite automata in computation ability as… 

References

SHOWING 1-10 OF 41 REFERENCES
1-way quantum finite automata: strengths, weaknesses and generalizations
  • A. Ambainis, R. Freivalds
  • Computer Science
    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.
Multi-letter quantum finite automata: decidability of the equivalence and minimization of states
TLDR
It is shown that the states minimization problem of multi-letter QFAs is solvable in EXPSPACE and the decidability of the equivalence and minimization problems ofMulti-letter quantum finite automata is studied.
Quantum Finite Automata
TLDR
The main results about quantum finite automata are described and some possible areas for future work are described, including the languages for which QFAs can be smaller than conventional finite Automata.
Determining the equivalence for one-way quantum finite automata
Characterizations of 1-Way Quantum Finite Automata
TLDR
This paper characterize the measure-once model when it is restricted to accepting with bounded error and show that, without that restriction, it can solve the word problem over the free group and shows that piecewise testable sets can be accepted with boundederror by a measure-many quantum finite automaton, introducing new construction techniques for quantum automata in the process.
On the power of quantum finite state automata
TLDR
It is proved that the class of languages recognizing by linear time, bounded error 2qfa's properly includes the regular languages, and 1-way and 2-way quantum finite state automata are introduced, which are the quantum analogues of deterministic, nondeterministic and probabilistic 1- way and2-way finite state Automata.
Algebraic Results on Quantum Automata
TLDR
It is a surprising consequence of the results that LQFA and Boolean combinations of BPQFA are equivalent in language recognition power.
Automata theory based on quantum logic: Reversibilities and pushdown automata
  • Daowen Qiu
  • Computer Science
    Theor. Comput. Sci.
  • 2007
...
1
2
3
4
5
...