dorsal/arxiv
View SchemaAn Application of Quantum Finite Automata to Interactive Proof Systems
| Authors | Harumichi Nishimura, Tomoyuki Yamakami |
|---|---|
| Categories | |
| ArXiv ID | quant-ph/0410040 |
| URL | https://arxiv.org/abs/quant-ph/0410040 |
| DOI | 10.1016/j.jcss.2008.12.001 |
| Journal | Journal of Computer and System Sciences, Vol.75, pp.255-269, 2009 |
Abstract
Quantum finite automata have been studied intensively since their introduction in late 1990s as a natural model of a quantum computer with finite-dimensional quantum memory space. This paper seeks their direct application to interactive proof systems in which a mighty quantum prover communicates with a quantum-automaton verifier through a common communication cell. Our quantum interactive proof systems are juxtaposed to Dwork-Stockmeyer's classical interactive proof systems whose verifiers are two-way probabilistic automata. We demonstrate strengths and weaknesses of our systems and further study how various restrictions on the behaviors of quantum-automaton verifiers affect the power of quantum interactive proof systems.
{
"annotation_id": "ffe5beb9-8a67-4e8a-b745-465e1f698864",
"date_created": "2026-03-02T18:02:10.110000Z",
"date_modified": "2026-03-02T18:02:10.110000Z",
"file_hash": "6393bd1a5e36f73f5dc818ae6546700576ade0870e36982c6277b61c77fac382",
"private": false,
"record": {
"abstract": "Quantum finite automata have been studied intensively since their\nintroduction in late 1990s as a natural model of a quantum computer with\nfinite-dimensional quantum memory space. This paper seeks their direct\napplication to interactive proof systems in which a mighty quantum prover\ncommunicates with a quantum-automaton verifier through a common communication\ncell. Our quantum interactive proof systems are juxtaposed to\nDwork-Stockmeyer\u0027s classical interactive proof systems whose verifiers are\ntwo-way probabilistic automata. We demonstrate strengths and weaknesses of our\nsystems and further study how various restrictions on the behaviors of\nquantum-automaton verifiers affect the power of quantum interactive proof\nsystems.",
"arxiv_id": "quant-ph/0410040",
"authors": [
"Harumichi Nishimura",
"Tomoyuki Yamakami"
],
"categories": [
"quant-ph",
"cs.CC"
],
"doi": "10.1016/j.jcss.2008.12.001",
"journal_ref": "Journal of Computer and System Sciences, Vol.75, pp.255-269, 2009",
"title": "An Application of Quantum Finite Automata to Interactive Proof Systems",
"url": "https://arxiv.org/abs/quant-ph/0410040"
},
"schema_id": "dorsal/arxiv",
"source": {
"execution_id": "87347ee4-429e-497c-a29c-92e78cc90b95",
"id": "arXiv Dataset IDs",
"type": "Model",
"variant": "snapshot-2026-03-01",
"version": "0.1.0"
},
"user_id": 1000002
}