Interactive proofs with quantum finite automata

DOI10.1016/j.tcs.2014.11.030zbMath1312.68123arXiv1401.2929OpenAlexW1969389934WikidataQ113863226 ScholiaQ113863226MaRDI QIDQ2513604

Tomoyuki Yamakami, Harumichi Nishimura

Publication date: 28 January 2015

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1401.2929

zbMATH Keywords

finite automatoninteractionquantum computinginteractive proof systemclassical proverquantum prover

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Quantum computation (81P68)

Related Items (4)

Unnamed Item ⋮ Nonuniform families of polynomial-size quantum finite automata and quantum logarithmic-space computation with polynomial-size advice ⋮ Constant-space, constant-randomness verifiers with arbitrarily small error ⋮ Power of the interactive proof systems with verifiers modeled by semi-quantum two-way finite automata

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An application of quantum finite automata to interactive proof systems
• Quantum automata and quantum grammars
• PSPACE has constant-round quantum interactive proof systems
• Finite state verifiers I
• On the Power of Finite Automata with both Nondeterministic and Probabilistic States
• Implementation and Application of Automata

This page was built for publication: Interactive proofs with quantum finite automata