Two-tape finite automata with quantum and classical states

DOI10.1007/s10773-010-0582-0zbMath1213.81157arXiv1104.3634OpenAlexW3099926236WikidataQ62049420 ScholiaQ62049420MaRDI QIDQ539559

Shenggen Zheng, Lvzhou Li, Dao Wen Qiu

Publication date: 30 May 2011

Published in: International Journal of Theoretical Physics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1104.3634

zbMATH Keywords

quantum finite automataquantum computing models

Mathematics Subject Classification ID

Geometry and quantization, symplectic methods (81S10)

Related Items (5)

One-Way Finite Automata with Quantum and Classical States ⋮ SOME LANGUAGES RECOGNIZED BY TWO-WAY FINITE AUTOMATA WITH QUANTUM AND CLASSICAL STATES ⋮ On the power of two-way multihead quantum finite automata ⋮ On coverings of products of uninitialized sequential quantum machines ⋮ On relation between linear temporal logic and quantum finite automata

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A note on quantum sequential machines
• Quantum automata and quantum grammars
• Characterization of sequential quantum machines
• Two-way finite automata with quantum and classical states.
• Hierarchy and equivalence of multi-letter quantum finite automata
• Algebraic results on quantum automata
• Determining the equivalence for one-way quantum finite automata
• Interference automata
• Characterizations of 1-Way Quantum Finite Automata
• Dense quantum coding and quantum finite automata
• Quantum computing: pro and con
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer

This page was built for publication: Two-tape finite automata with quantum and classical states