12 citations · 15 across the 2 of their papers we have counts for
2 papers
cs.FL2014★ 12 cited
Potential of quantum finite automata with exact acceptance
Jozef Gruska, Daowen Qiu, Shenggen Zheng
The potential of the exact quantum information processing is an interesting, important and intriguing issue. For examples, it has been believed that quantum tools can provide signi…
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…