86 citations · 170 across the 18 of their papers we have counts for
17 papers
Verifiable blind quantum computation with identity authentication for different types of clients
Junyu Quan, Qin Li, Lvzhou Li
Quantum computing has considerable advantages in solving some problems over its classical counterpart. Currently various physical systems are developed to construct quantum compute…
Security Improvements of Several Basic Quantum Private Query Protocols with O(log N) Communication Complexity
Fang Yu, Daowen Qiu, Xiaoming Wang +3
New quantum private database (with N elements) query protocols are presented and analyzed. Protocols preserve O(logN) communication complexity of known protocols for the same task,…
Capability of local operations and classical communication for distinguishing bipartite unitary operations
Lvzhou Li, Shenggen Zheng, Haozhen Situ +1
The problem behind this paper is, if the number of queries to unitary operations is fixed, say , then when do local operations and classical communication (LOCC) suffice for opt…
Lower bounds on the size of semi-quantum finite automata
Lvzhou Li, Daowen Qiu
In the literature, there exist several interesting hybrid models of finite automata which have both quantum and classical states. We call them semi-quantum automata. In this paper,…
Decidability of minimization of fuzzy automata
Lvzhou Li, Daowen Qiu
State minimization is a fundamental problem in automata theory. The problem is also of great importance in the study of fuzzy automata. However, most work in the literature conside…
State succinctness of two-way finite automata with quantum and classical states
Shenggen Zheng, Daowen Qiu, Jozef Gruska +2
{\it Two-way quantum automata with quantum and classical states} (2QCFA) were introduced by Ambainis and Watrous in 2002. In this paper we study state succinctness of 2QCFA. For an…