dorsal/arxiv
View SchemaThe Complexity of Probabilistic versus Quantum Finite Automata
| Authors | Gatis Midrijanis |
|---|---|
| Categories | |
| ArXiv ID | quant-ph/0309080 |
| URL | https://arxiv.org/abs/quant-ph/0309080 |
| Journal | SOFSEM 2002 Proceedings,, pp. 273-278 |
Abstract
We present a language $L_n$ which is recognizable by a probabilistic finite automaton (PFA) with probability $1 - \epsilon$ for all $\epsilon > 0$ with $O(log^2n)$ states, with a deterministic finite automaton (DFA) with O(n) states, but a quantum finite automaton (QFA) needs at least $2^{\Omega(n/ \log n)}$ states.
{
"annotation_id": "856a8713-a553-4ff3-9733-b320d9e7014f",
"date_created": "2026-03-02T18:02:03.126000Z",
"date_modified": "2026-03-02T18:02:03.126000Z",
"file_hash": "6d0137e953b75c607956b3e177950475ae77d2d532c7fe757fa5ac849b4e046a",
"private": false,
"record": {
"abstract": "We present a language $L_n$ which is recognizable by a probabilistic finite\nautomaton (PFA) with probability $1 - \\epsilon$ for all $\\epsilon \u003e 0$ with\n$O(log^2n)$ states, with a deterministic finite automaton (DFA) with O(n)\nstates, but a quantum finite automaton (QFA) needs at least $2^{\\Omega(n/ \\log\nn)}$ states.",
"arxiv_id": "quant-ph/0309080",
"authors": [
"Gatis Midrijanis"
],
"categories": [
"quant-ph"
],
"journal_ref": "SOFSEM 2002 Proceedings,, pp. 273-278",
"title": "The Complexity of Probabilistic versus Quantum Finite Automata",
"url": "https://arxiv.org/abs/quant-ph/0309080"
},
"schema_id": "dorsal/arxiv",
"source": {
"execution_id": "0df02719-7166-40cb-8232-e9996e343b1c",
"id": "arXiv Dataset IDs",
"type": "Model",
"variant": "snapshot-2026-03-01",
"version": "0.1.0"
},
"user_id": 1000002
}