165 citations · 531 across the 35 of their papers we have counts for
5 papers · 1 filter
Promise problems solved by quantum and classical finite automata
Shenggen Zheng, Lvzhou Li, Daowen Qiu +1
The concept of promise problems was introduced and started to be systematically explored by Even, Selman, Yacobi, Goldreich, and other scholars. It has been argued that promise pro…
From Quantum Query Complexity to State Complexity
Shenggen Zheng, Daowen Qiu
State complexity of quantum finite automata is one of the interesting topics in studying the power of quantum finite automata. It is therefore of importance to develop general meth…
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…
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…
Generalizations of the distributed Deutsch-Jozsa promise problem
Jozef Gruska, Daowen Qiu, Shenggen Zheng
In the {\em distributed Deutsch-Jozsa promise problem}, two parties are to determine whether their respective strings are at the {\em Hamming distance} …