scientific article; zbMATH DE number 6300099
From MaRDI portal
Publication:5418251
zbMath1304.68121MaRDI QIDQ5418251
Jozef Gruska, Lvzhou Li, Paula Mateus, Dao Wen Qiu
Publication date: 3 June 2014
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Formal languages and automata (68Q45) Quantum algorithms and complexity in the theory of computing (68Q12)
Related Items (11)
One-Way Finite Automata with Quantum and Classical States ⋮ Time-Space Complexity Advantages for Quantum Computing ⋮ From Quantum Query Complexity to State Complexity ⋮ State succinctness of two-way finite automata with quantum and classical states ⋮ Learning quantum finite automata with queries ⋮ Generalizations of the distributed Deutsch–Jozsa promise problem ⋮ Exponentially more concise quantum recognition of non-RMM regular languages ⋮ Computing power of Turing machines in the framework of unsharp quantum logic ⋮ Application of distributed semi-quantum computing model in phase estimation ⋮ Promise problems solved by quantum and classical finite automata ⋮ Power of the interactive proof systems with verifiers modeled by semi-quantum two-way finite automata
This page was built for publication:
