Algebraic results on quantum automata

DOI10.1007/s00224-005-1263-xzbMath1101.68029OpenAlexW2041354954MaRDI QIDQ2432533

Martin Beaudry, Denis Thérien, Marats Golovkins, Mark Mercer, Andris Ambainis, Arnolds Ķikusts

Publication date: 25 October 2006

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00224-005-1263-x

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Quantum computation (81P68) Algebraic theory of languages and automata (68Q70)

Related Items (30)

Unary probabilistic and quantum automata on promise problems ⋮ One-Way Finite Automata with Quantum and Classical States ⋮ Complexity of Promise Problems on Classical and Quantum Automata ⋮ Quantum Finite Automata: A Modern Introduction ⋮ State succinctness of two-way finite automata with quantum and classical states ⋮ Unnamed Item ⋮ Deterministic construction of QFAs based on the quantum fingerprinting technique ⋮ Size lower bounds for quantum automata ⋮ Computational limitations of affine automata and generalized affine automata ⋮ On the Power of One-Way Automata with Quantum and Classical States ⋮ Learning quantum finite automata with queries ⋮ Mirrors and memory in quantum automata ⋮ Another approach to the equivalence of measure-many one-way quantum finite automata and its application ⋮ Lower Bounds for Generalized Quantum Finite Automata ⋮ Exponentially more concise quantum recognition of non-RMM regular languages ⋮ SOME LANGUAGES RECOGNIZED BY TWO-WAY FINITE AUTOMATA WITH QUANTUM AND CLASSICAL STATES ⋮ Quantum finite automata: advances on Bertoni's ideas ⋮ Two-tape finite automata with quantum and classical states ⋮ On the Computational Power of Affine Automata ⋮ Unbounded-error quantum computation with small space bounds ⋮ Trace monoids with idempotent generators and measure-only quantum automata ⋮ Determining the equivalence for one-way quantum finite automata ⋮ How does adiabatic quantum computation fit into quantum automata theory? ⋮ Improved constructions of mixed state quantum automata ⋮ Languages Recognized with Unbounded Error by Quantum Finite Automata ⋮ Quantum Automata Theory – A Review ⋮ Characterizations of one-way general quantum finite automata ⋮ On relation between linear temporal logic and quantum finite automata ⋮ Quantum finite automata with control language ⋮ Power of the interactive proof systems with verifiers modeled by semi-quantum two-way finite automata

This page was built for publication: Algebraic results on quantum automata