Published In
Quantum Information and Computation
Document Type
Article
Publication Date
3-1-2025
Subjects
Quantum physics -- Mathematical models
Abstract
Quantum automata can solve certain problems with a smaller state space than classical automata. We developed a quantum finite automaton using ternary rotation quantum gates and the Chrestenson family of ternary quantum gates. The main idea of this paper is to show how to combine rotation ternary quantum circuit-based QuantumFinite Automaton and quantum reversible circuit-based Deterministic Finite Automaton to build a more powerful machine. The combined machine can enable more complex language and pattern recognition. The developed quantum finite automaton and resulting combined machine can be used for robotics applications such as language, gesture, and motion recognition.
Rights
Copyright (c) 2025 The Authors Creative Commons License This work is licensed under a Creative Commons Attribution 4.0 International License.
Locate the Document
http://doi.org/10.2478/qic-2025-0003
DOI
10.2478/qic-2025-0003
Persistent Identifier
https://archives.pdx.edu/ds/psu/43581
Citation Details
Huang, Y., Perkowski, M., Song, X., & Acken, J. M. (2025). Quantum Finite Automaton Using Ternary Rotation Quantum Gates and Chrestenson Family Quantum Gates. Quantum Information & Computation, 25(2025), 57-70.