Non-Interactive Proof Verification Procedures of Reversible and Quantum Finite Automata

• Item type: SIG Technical Reports(1)
• 公開日: 2014-02-24
• タイトル: Non-Interactive Proof Verification Procedures of Reversible and Quantum Finite Automata
• タイトル / 言語: en
• タイトル: Non-Interactive Proof Verification Procedures of Reversible and Quantum Finite Automata
• 言語: eng
• 資源タイプ / 資源タイプ識別子: http://purl.org/coar/resource_type/c_18gh
• 資源タイプ: technical report
• 著者所属: Department of Information Science, University of Fukui
• 著者所属: Department of Information Science, University of Fukui
• 著者所属(英): en
• 著者所属(英): Department of Information Science, University of Fukui
• 著者所属(英): en
• 著者所属(英): Department of Information Science, University of Fukui
• 著者名: Marcos, Villagra; Tomoyuki, Yamakami
• 著者名(英): Marcos, Villagra; Tomoyuki, Yamakami
• 論文抄録 / 内容記述タイプ: Other
• 論文抄録 / 内容記述: We discuss the computational complexity of non-interactive verification procedures of finite automata that determine whether given proofs are correct. First, we show that languages admitting non-interactive proof systems by one-way quantum or reversible finite automata are exactly regular languages. When those automata are forced to read their entire input (referred to as a classical acceptance model), there are regular languages that do not admit those systems. In this model, we further show that quantum proofs, even in the form of entangled quantum states, are no more powerful than non-entangled proofs. We also give a semigroup-theoretic sufficient condition for languages characterized by non-interactive proof systems with reversible finite automata. From this condition, we draw a conclusion, that no finite language admits non-interactive proof systems with reversible finite automata, and moreover, the non-closure under complementation of the corresponding class of languages.
• 論文抄録(英) / 内容記述タイプ: Other
• 論文抄録(英) / 内容記述: We discuss the computational complexity of non-interactive verification procedures of finite automata that determine whether given proofs are correct. First, we show that languages admitting non-interactive proof systems by one-way quantum or reversible finite automata are exactly regular languages. When those automata are forced to read their entire input (referred to as a classical acceptance model), there are regular languages that do not admit those systems. In this model, we further show that quantum proofs, even in the form of entangled quantum states, are no more powerful than non-entangled proofs. We also give a semigroup-theoretic sufficient condition for languages characterized by non-interactive proof systems with reversible finite automata. From this condition, we draw a conclusion, that no finite language admits non-interactive proof systems with reversible finite automata, and moreover, the non-closure under complementation of the corresponding class of languages.
• 書誌レコードID / 収録物識別子タイプ: NCID
• 書誌レコードID / 収録物識別子: AN1009593X
• 書誌情報: 研究報告アルゴリズム（AL）; 巻 2014-AL-147, 号 18, p. 1-8, 発行日 2014-02-24
• Notice: SIG Technical Reports are nonrefereed and hence may later appear in any journals, conferences, symposia, etc.
• 出版者 / 言語: ja
• 出版者: 情報処理学会