Characterization of sequential quantum machines
From MaRDI portal
Recommendations
Cited in
(24)- Automata theory based on quantum logic: recognizability and accessibility
- Two-tape finite automata with quantum and classical states
- Characterization of tree automata based on quantum logic
- Equivalence checking of quantum finite-state machines
- A probabilistic model of computing with words
- Characterizations of one-way general quantum finite automata
- Promise problems solved by quantum and classical finite automata
- Automata theory based on quantum logic: Some characterizations
- scientific article; zbMATH DE number 7028346 (Why is no real title available?)
- Quantum computers.
- Hierarchy and equivalence of multi-letter quantum finite automata
- A note on quantum sequential machines
- Determination of equivalence between quantum sequential machines
- Determining the equivalence for one-way quantum finite automata
- On hybrid models of quantum finite automata
- Characterizations of quantum automata
- On the power of two-way multihead quantum finite automata
- Multi-letter quantum finite automata: decidability of the equivalence and minimization of states
- Automata theory based on quantum logic: reversibilities and pushdown automata
- Weakly regular quantum grammars and asynchronous quantum automata
- Parsing a Sequence of Qubits
- Quaternionic quantum automata
- Algebraic properties of uninitialized sequential quantum machines
- On coverings of products of uninitialized sequential quantum machines
This page was built for publication: Characterization of sequential quantum machines
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1604939)
