Classical and Quantum Counter Automata on Promise Problems
From MaRDI portal
Publication:2947425
DOI10.1007/978-3-319-22360-5_19zbMath1466.68052arXiv1412.6761OpenAlexW1581172149MaRDI QIDQ2947425
Masaki Nakanishi, Abuzer Yakaryılmaz, Aida Gainutdinova
Publication date: 23 September 2015
Published in: Implementation and Application of Automata (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1412.6761
quantum computationquantum automatapromise problemsprobabilistic computationcounter automatazero-errorLas-Vegas algorithmsblind counter
Related Items (4)
Unary probabilistic and quantum automata on promise problems ⋮ Exact Affine Counter Automata ⋮ Unnamed Item ⋮ Quantum Pushdown Automata with Garbage Tape
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Characterizations of one-way general quantum finite automata
- On probabilistic pushdown automata
- Remarks on blind and partially blind one-way multicounter machines
- Quantum automata and quantum grammars
- Unary probabilistic and quantum automata on promise problems
- Quantum computation with write-only memory
- Quantum versus deterministic counter automata
- Two-way finite automata with quantum and classical states.
- Derivative-free methods for bound constrained mixed-integer optimization
- Undecidability on quantum finite automata
- Quantum Finite Automata: A Modern Introduction
- Sequential Penalty Derivative-Free Methods for Nonlinear Constrained Optimization
- Implications of Quantum Automata for Contextuality
- Rapid solution of problems by quantum computation
- Quantum theory, the Church–Turing principle and the universal quantum computer
- Quantum algorithms revisited
- Superiority of one-way and realtime quantum machines
- QUANTUM COUNTER AUTOMATA
- One-Counter Verifiers for Decidable Languages
- Quantum Pushdown Automata with a Garbage Tape
- Classical Automata on Promise Problems
- Probabilistic automata
This page was built for publication: Classical and Quantum Counter Automata on Promise Problems
