190 citations · 841 across the 69 of their papers we have counts for
Showing 2013 · cs.CCShow all
2 papers · 2 filters
cs.CC2013★ 3 cited
Communication complexity of promise problems and their applications to finite automata
Jozef Gruska, Daowen Qiu, Shenggen Zheng
Equality and disjointness are two of the most studied problems in communication complexity. They have been studied for both classical and also quantum communication and for various…
cs.CC2013★ 29 cited
Power of the interactive proof systems with verifiers modeled by semi-quantum two-way finite automata
Shenggen Zheng, Daowen Qiu, Jozef Gruska
In this paper we explore the power of AM for the case that verifiers are {\em two-way finite automata with quantum and classical states} (2QCFA)--introduced by Ambainis and Watrous…