Efficient probability amplification in two-way quantum finite automata (original) (raw)
Related papers
Succinctness of two-way probabilistic and quantum finite automata
Discrete Mathematics & Theoretical Computer Science, 2010
Computational Power of Quantum and Probabilistic Automata
acadlib.lv
1Way Quantum Finite Automata: Strengths, Weaknesses and Generalizations
1998
Exploiting the Difference in Probability Calculation between Quantum and Probabilistic Computations
2002
1998
State succinctness of two-way finite automata with quantum and classical states
Theoretical Computer Science, 2013
One-way finite automata with quantum and classical states
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2012
One-way probabilistic reversible and quantum one-counter automata
Theoretical Computer Science, 2002
Quantum Finite Automata with One-Sided Unbounded Error
2-tape 1-way Quantum Finite State Automata
ArXiv, 2016
Information and Computation
Two-way Quantum One-counter Automata
Eprint Arxiv Cs 0110005, 2001
Lower Bounds for Generalized Quantum Finite Automata
2008
On the state complexity of semi-quantum finite automata
RAIRO - Theoretical Informatics and Applications, 2014
One-way quantum finite automata together with classical states
Arxiv preprint arXiv: …
1-Way Multihead Quantum Finite State Automata
Applied Mathematics, 2016
Theoretical Computer Science, 2008
Unbounded-error quantum computation with
2011
Characterizations of one-way general quantum finite automata
Theoretical Computer Science, 2012
On the complexity of minimizing probabilistic and quantum automata
Information and Computation, 2012
Computational Power of the Quantum Turing Automata
2007
Small size quantum automata recognizing some regular languages
Theoretical Computer Science, 2005
Exponentially more concise quantum recognition of non-RMM regular languages
2014
Language recognition by generalized quantum finite automata with unbounded error (abstract & poster)
Arxiv preprint arXiv:0901.2703, 2009
Probabilistic and quantum finite automata with postselection
2011
Language Recognition by Generalized Quantum Finite Automata with Unbounded Error
Computing Research Repository, 2009
Quantum automata and quantum computing
2002
Languages recognized by nondeterministic quantum finite automata
2009
Multi-letter Reversible and Quantum Finite Automata
Lecture Notes in Computer Science
On the Size of One-way Quantum Finite Automata with Periodic Behaviors
RAIRO - Theoretical Informatics and Applications, 2002
Implementing Quantum Finite Automata Algorithms on Noisy Devices
2021
Quantum Finite Automata and Probabilistic Reversible Automata: R-trivial Idempotent Languages
2011
One-way quantum finite automata together with classical states: Equivalence and Minimization
Experimental demonstration of quantum finite automaton
npj Quantum Information, 2019
On the class of languages recognizable by 1-way quantum finite automata
2000