Potential of Quantum Finite Automata with Exact Acceptance

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216224%3A14330%2F15%3A00084457" target="_blank" >RIV/00216224:14330/15:00084457 - isvavai.cz</a>
Result on the web
<a href="http://www.worldscientific.com/doi/abs/10.1142/S0129054115500215" target="_blank" >http://www.worldscientific.com/doi/abs/10.1142/S0129054115500215</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1142/S0129054115500215" target="_blank" >10.1142/S0129054115500215</a>

Result language
angličtina
Original language name
Potential of Quantum Finite Automata with Exact Acceptance
Original language description
The potential of the exact quantum information processing is an interesting, important and intriguing issue. For examples, it has been believed that quantum tools can provide significant, that is larger than polynomial, advantages in the case of exact quantum computation only, or mainly, for problems with very special structures. We will show that this is not the case. In this paper the potential of quantum finite automata producing outcomes not only with a (high) probability, but with certainty (so called exactly) is explored in the context of their uses for solving promise problems and with respect to the size of automata.
Czech name
—
Czech description
—

Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
IN - Informatics
OECD FORD branch
—

Project
<a href="/en/project/EE2.3.30.0009" target="_blank" >EE2.3.30.0009: Employment of Newly Graduated Doctors of Science for Scientific Excellence</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Publication year
2015
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Similar results(10)