Quantum counter automata
From MaRDI portal
Publication:4902895
Recommendations
Cites work
- A Time Complexity Gap for Two-Way Probabilistic Finite-State Automata
- A context-free language which is not acceptable by a probabilistic automaton
- Extending stochastic and quantum functions
- On probabilistic pushdown automata
- On the complexity of simulating space-bounded quantum computations
- One-way probabilistic reversible and quantum one-counter automata.
- Quantum versus deterministic counter automata
- Topological automata
- Unbounded-error quantum computation with small space bounds
Cited in
(14)- Exact affine counter automata
- scientific article; zbMATH DE number 2090014 (Why is no real title available?)
- Exact Affine Counter Automata
- Quantum pushdown automata with garbage tape
- Quantum alternation
- Improved constructions of quantum automata
- Implications of quantum automata for contextuality
- scientific article; zbMATH DE number 7204467 (Why is no real title available?)
- Superiority of one-way and realtime quantum machines
- scientific article; zbMATH DE number 1848278 (Why is no real title available?)
- Classically time-controlled quantum automata
- Quantum versus deterministic counter automata
- scientific article; zbMATH DE number 2080917 (Why is no real title available?)
- scientific article; zbMATH DE number 1490010 (Why is no real title available?)
This page was built for publication: Quantum counter automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4902895)