Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

情報処理学会研究報告アルゴリズム（AL）

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

Marcos Villagra, Tomoyuki Yamakami

Published Feb 24, 2014• 0 citations
OpenAlex

Related papers

An application of quantum finite automata to interactive proof systems

Harumichi Nishimura, Tomoyuki Yamakami

arXiv:quant-ph/0410040•Journal of Computer and System Sciences•Dec 25, 2008•30 citations

Interactive proofs with quantum finite automata

Harumichi Nishimura, Tomoyuki Yamakami

arXiv:1401.2929•Theoretical Computer Science•Dec 6, 2014•9 citations

An Application of Quantum Finite Automata to Interactive Proof Systems

Tomoyuki Yamakami, Harumichi Nishimura

Electronic colloquium on computational complexity•Jan 1, 2004•1 citation

An Application of Quantum Finite Automata to Interactive Proof Systems (Extended Abstract)

Harumichi Nishimura, Tomoyuki Yamakami

Lecture notes in computer science•Jan 1, 2005•11 citations

Power of the interactive proof systems with verifiers modeled by semi-quantum two-way finite automata

Shenggen Zheng, Daowen Qiu, Jozef Gruska

arXiv:1304.3876•Information and Computation•Feb 7, 2015•25 citations

Multi-letter Reversible and Quantum Finite Automata

Aleksandrs Belovs, Ansis Rosmanis, Juris Smotrovs

Lecture notes in computer science•Sep 12, 2007•17 citations