Improved constructions of quantum automata
From MaRDI portal
Publication:1017403
DOI10.1016/J.TCS.2009.01.027zbMATH Open1163.68020OpenAlexW2034563250MaRDI QIDQ1017403FDOQ1017403
Authors: Andris Ambainis, Nikolajs Nahimovs 
Publication date: 19 May 2009
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2009.01.027
Recommendations
- Improved Constructions of Quantum Automata
- Improved constructions of mixed state quantum automata
- Quantum finite automata
- Quantum Turing automata
- Characterizations of quantum automata
- Quantum finite automata: advances on Bertoni's ideas
- Quantum counter automata
- Quantum automata theory -- a review
- Some remarks on quantum automata
Formal languages and automata (68Q45) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Quantum computation (81P68)
Cites Work
- Title not available (Why is that?)
- Quantum automata and quantum grammars
- Estimates on exponential sums related to the Diffie-Hellman distributions
- Dense quantum coding and quantum finite automata
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Construction of a Thin Set with small Fourier Coefficients
- Constructing Small Sets that are Uniform in Arithmetic Progressions
Cited In (19)
- State succinctness of two-way finite automata with quantum and classical states
- Lifting query complexity to time-space complexity for two-way finite automata
- Exponentially more concise quantum recognition of non-RMM regular languages
- Descriptional complexity of iterated uniform finite-state transducers
- Nonuniform families of polynomial-size quantum finite automata and quantum logarithmic-space computation with polynomial-size advice
- Promise problems solved by quantum and classical finite automata
- One-way finite automata with quantum and classical states
- From Quantum Query Complexity to State Complexity
- GAPs for Shallow Implementation of Quantum Finite Automata
- Quantum algorithm for dynamic programming approach for DAGs and applications
- Improved constructions of mixed state quantum automata
- Potential of Quantum Finite Automata with Exact Acceptance
- Improved Constructions of Quantum Automata
- Deterministic construction of QFAs based on the quantum fingerprinting technique
- Super-Exponential Size Advantage of Quantum Finite Automata with Mixed States
- Quantum online algorithms with respect to space and advice complexity
- Quantum finite automata: advances on Bertoni's ideas
- Quantum Finite Automata: A Modern Introduction
- Hamming, Permutations and Automata
This page was built for publication: Improved constructions of quantum automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1017403)
