23 citations · 41 across the 8 of their papers we have counts for
8 papers
Semiquantum key distribution using initial states in only one basis without the classical user measuring
Xueying Liang, Xiangfu Zou, Xin Wang +6
From the perspective of resource theory, it is interesting to achieve the same quantum task using as few quantum resources as possible. Semiquantum key distribution (SQKD), which a…
Enhanced Fast Boolean Matching based on Sensitivity Signatures Pruning
Jiaxi Zhang, Liwei Ni, Shenggen Zheng +4
Boolean matching is significant to digital integrated circuits design. An exhaustive method for Boolean matching is computationally expensive even for functions with only a few var…
Analyses and improvement of a broadcasting multiple blind signature scheme based on quantum GHZ entanglement
Wei Zhang, Daowen Qiu, Xiangfu Zou +1
A broadcasting multiple blind signature scheme based on quantum GHZ entanglement has been presented recently by Tian et al. It is said that the scheme's unconditional security is g…
Improvement of a quantum broadcasting multiple blind signature scheme based on quantum teleportation
Wei Zhang, Daowen Qiu, Xiangfu Zou
Recently, a broadcasting multiple blind signature scheme based on quantum teleportation has been proposed for the first time. It is claimed to have unconditional security and prope…
Reply to "Comment on 'Semiquantum-key distribution using less than four quantum states' "
Xiangfu Zou, Daowen Qiu
Recently Boyer and Mor pointed out the first conclusion of Lemma 1 in our original paper is not correct, and therefore, the proof of Theorem 5 based on Lemma 1 is wrong. Furthermor…
Arbitrated quantum signature schemes without using entangled states
Xiangfu Zou, Daowen Qiu
A digital signature is a mathematical scheme for demonstrating the authenticity of a digital message or document. For signing quantum messages, some arbitrated quantum signature sc…
Characterizations of one-way general quantum finite automata
Lvzhou Li, Daowen Qiu, Xiangfu Zou +3
In this paper we study a generalized model named one-way general quantum finite automata} (1gQFA), in which each symbol in the input alphabet induces a trace-preserving quantum ope…
Decidability of the Equivalence of Multi-Letter Quantum Finite Automata
Daowen Qiu, Xiangfu Zou, Lvzhou Li +1
Multi-letter {\it quantum finite automata} (QFAs) were a quantum variant of classical {\it one-way multi-head finite automata} (J. Hromkovič, Acta Informatica 19 (1983) 377-384), a…