29 citations · 115 across the 15 of their papers we have counts for
Showing cs.CCShow all
3 papers · 1 filter
cs.CC2014★ 3 cited
Exact quantum algorithms have advantage for almost all Boolean functions
Andris Ambainis, Jozef Gruska, Shenggen Zheng
It has been proved that almost all -bit Boolean functions have exact classical query complexity . However, the situation seemed to be very different when we deal with exact q…
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…