Interactive proofs with quantum finite automata.

•We study quantum interactive proof (QIP) systems whose verifiers are quantum finite automata.•QIP systems with classical provers are compared with those with quantum provers.•We demonstrate that public QIP systems with qfa-verifiers remain powerful.•Many interactions between a prover and a verifier are more powerful than a single interaction.