|
| related topics |
| {algorithm, log, probability} |
| {let, theorem, proof} |
| {time, systems, information} |
| {state, states, entangled} |
| {measurement, state, measurements} |
| {information, entropy, channel} |
|
Quantum Finite State Transducers
R. Freivalds, A. Winter
abstract: We introduce quantum finite state transducers (qfst), and study the class of
relations which they compute. It turns out that they share many features with
probabilistic finite state transducers, especially regarding undecidability of
emptiness (at least for low probability of success). However, like their
`little brothers', the quantum finite automata, the power of qfst is
incomparable to that of their probabilistic counterpart. This we show by
discussing a number of characteristic examples.
- oai_identifier:
- oai:arXiv.org:quant-ph/0011052
- categories:
- quant-ph
- comments:
- LaTeX2e, 14 pages, short version to appear in Proc. SOFSEM 2001.
Requires cl2emult.cls and some packages
- arxiv_id:
- quant-ph/0011052
- journal_ref:
- Proc. SOFSEM 2001, pp. 233--242, Springer, Berlin 2001.
- created:
- 2000-11-13
- updated:
- 2001-08-13
Full article ▸
|
|
| related documents |
| 9706003v4 |
| 0210141v2 |
| 0302022v1 |
| 0109038v1 |
| 9905026v1 |
| 0306042v1 |
| 0008095v3 |
| 0505007v3 |
| 0201152v1 |
| 0609220v1 |
| 0511272v1 |
| 0106152v1 |
| 0207131v1 |
| 0609166v1 |
| 0305031v1 |
| 0303074v1 |
| 9903071v1 |
| 0609160v1 |
| 0207108v1 |
| 0508156v3 |
| 0403071v1 |
| 0206089v2 |
| 0606077v1 |
| 0106121v2 |
| 0208112v1 |
|