Exploiting the Difference in Probability Calculation between Quantum and Probabilistic Computations (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
On the complexity of minimizing probabilistic and quantum automata
Information and Computation, 2012
Efficient probability amplification in two-way quantum finite automata
Theoretical Computer Science, 2009
On the state complexity of semi-quantum finite automata
RAIRO - Theoretical Informatics and Applications, 2014
Probabilistic and quantum finite automata with postselection
2011
RAIRO - Theoretical Informatics and Applications, 2001
1Way Quantum Finite Automata: Strengths, Weaknesses and Generalizations
1998
Quantum automata and quantum computing
2002
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
1998
Quantum Finite Automata with One-Sided Unbounded Error
Lower Bounds for Generalized Quantum Finite Automata
2008
Theoretical Computer Science, 2008
Languages recognized by nondeterministic quantum finite automata
2009
State succinctness of two-way finite automata with quantum and classical states
Theoretical Computer Science, 2013
Computational Power of the Quantum Turing Automata
2007
Probabilistic, frequency and quantum automata on omega-words⋆
Information and Computation
One-way probabilistic reversible and quantum one-counter automata
Theoretical Computer Science, 2002
Small size quantum automata recognizing some regular languages
Theoretical Computer Science, 2005
Language recognition by generalized quantum finite automata with unbounded error (abstract & poster)
Arxiv preprint arXiv:0901.2703, 2009
Unbounded-error quantum computation with
2011
Quantum Finite Automata and Probabilistic Reversible Automata: R-trivial Idempotent Languages
2011
Characterizations of one-way general quantum finite automata
Theoretical Computer Science, 2012
Complexity Limitations on Quantum Computation
Journal of Computer and System Sciences, 1999
Probability in quantum computation and quantum computational logics: a survey
Mathematical Structures in Computer Science, 2014
Language Recognition by Generalized Quantum Finite Automata with Unbounded Error
Computing Research Repository, 2009
The complexity of parameters for probabilistic and quantum computation
A common algebraic description for probabilistic and quantum computations
Theoretical Computer Science, 2005
Exponentially more concise quantum recognition of non-RMM regular languages
2014
Improved constructions of mixed state quantum automata
Theoretical Computer Science, 2009