Quantum computing: 1-way quantum automata
From MaRDI portal
Recommendations
Cited in
(54)- Some algebraic properties of measure-once two-way quantum finite automata
- Improved constructions of quantum automata
- On a class of languages recognizable by probabilistic reversible decide-and-halt automata
- Mathematical logic and quantum finite state automata
- Equivalence checking of quantum finite-state machines
- Hierarchy and equivalence of multi-letter quantum finite automata
- Power of the interactive proof systems with verifiers modeled by semi-quantum two-way finite automata
- On hybrid models of quantum finite automata
- Quantum automata for some multiperiodic languages
- Small size quantum automata recognizing some regular languages
- Some formal tools for analyzing quantum automata.
- Determining the equivalence for one-way quantum finite automata
- Lower bounds on the size of semi-quantum finite automata
- Undecidability on quantum finite automata
- Analysis of finite 1-qubit quantum automata unitary operators of which are rotations
- Complexity of promise problems on classical and quantum automata
- Quantum finite automata: a modern introduction
- Quantum automata theory -- a review
- Characterizations of 1-Way Quantum Finite Automata
- One-way finite automata with quantum and classical states
- Languages Recognized with Unbounded Error by Quantum Finite Automata
- Some remarks on quantum automata
- Quantum finite automata with control language
- Complexity bounds of constant-space quantum computation
- Algebraic Methods in Quantum Informatics
- Lower Bounds for Generalized Quantum Finite Automata
- Quantum combing
- State succinctness of two-way finite automata with quantum and classical states
- Size lower bounds for quantum automata
- Superiority of exact quantum automata for promise problems
- A decision procedure for well-formed linear quantum cellular automata
- Another approach to the equivalence of measure-many one-way quantum finite automata and its application
- Exponentially more concise quantum recognition of non-RMM regular languages
- Quantum reversibility and a new model of quantum automaton
- Space-efficient 1. 5-way quantum Turing machine
- Automatic translation of quantum circuits to optimized one-way quantum computation patterns
- Quantum Markov chains: description of hybrid systems, decidability of equivalence, and model checking linear-time properties
- Quantum finite automata: advances on Bertoni's ideas
- Implementation and Application of Automata
- Unbounded-error quantum computation with small space bounds
- Improved Constructions of Quantum Automata
- Preface
- Trace monoids with idempotent generators and measure-only quantum automata
- Lifting query complexity to time-space complexity for two-way finite automata
- Learning quantum finite automata with queries
- Mirrors and memory in quantum automata
- On the intersection problem for quantum finite automata
- State complexity of one-way quantum finite automata together with classical states
- Latvian quantum finite state automata for unary languages
- On some decision problems on quantum automata
- Quantum automata and languages of finite index
- Characterizations of one-way general quantum finite automata
- Multi-letter quantum finite automata: decidability of the equivalence and minimization of states
- On relation between linear temporal logic and quantum finite automata
This page was built for publication: Quantum computing: 1-way quantum automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4452048)
