| | |
| | |
Stat |
Members: 3645 Articles: 2'500'096 Articles rated: 2609
19 April 2024 |
|
| | | |
|
Article overview
| |
|
One-Way Reversible and Quantum Finite Automata with Advice | Tomoyuki Yamakami
; | Date: |
30 Aug 2012 | Abstract: | We examine characteristic features of reversible and quantum computations in
the presence of supplementary external information, known as advice. In
particular, we present a simple, algebraic characterization of languages
recognized by one-way reversible finite automata augmented with deterministic
advice. With a further elaborate argument, we prove a similar but slightly
weaker result for bounded-error one-way quantum finite automata with advice. An
immediate application of those properties leads to containments and separations
among various language families that are further assisted by appropriate
advice. We further demonstrate the power of randomized advice and quantum
advice when given to one-way quantum finite automata. | Source: | arXiv, 1208.6092 | Services: | Forum | Review | PDF | Favorites |
|
|
No review found.
Did you like this article?
Note: answers to reviews or questions about the article must be posted in the forum section.
Authors are not allowed to review their own article. They can use the forum section.
browser Mozilla/5.0 AppleWebKit/537.36 (KHTML, like Gecko; compatible; ClaudeBot/1.0; +claudebot@anthropic.com)
|
| |
|
|
|
| News, job offers and information for researchers and scientists:
| |