scientific article; zbMATH DE number 1502104
From MaRDI portal
Publication:4503144
zbMath0965.68021MaRDI QIDQ4503144
Publication date: 4 September 2000
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (18)
One-Way Finite Automata with Quantum and Classical States ⋮ On the Size of One-way Quantum Finite Automata with Periodic Behaviors ⋮ Complexity of Promise Problems on Classical and Quantum Automata ⋮ From Quantum Query Complexity to State Complexity ⋮ State succinctness of two-way finite automata with quantum and classical states ⋮ Exact results for accepting probabilities of quantum automata. ⋮ Another approach to the equivalence of measure-many one-way quantum finite automata and its application ⋮ Algebraic Methods in Quantum Informatics ⋮ Generalizations of the distributed Deutsch–Jozsa promise problem ⋮ Book review of: Phillip Kaye, Raymond Laflamme, Michele Mosca, An introduction to quantum computing ⋮ Quantum automata for some multiperiodic languages ⋮ Quantum finite automata: advances on Bertoni's ideas ⋮ Small size quantum automata recognizing some regular languages ⋮ Determining the equivalence for one-way quantum finite automata ⋮ Efficient probability amplification in two-way 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 ⋮ Note on the Succinctness of Deterministic, Nondeterministic, Probabilistic and Quantum Finite Automata
This page was built for publication:
