activity
20052021
most citedPower of the interactive proof systems with verifiers modeled by semi-quantum two-way finite automata

29 citations · 115 across the 15 of their papers we have counts for

collaborators

15 papers

quant-ph2021★ 5 cited

Testing Boolean Functions Properties

Zhengwei Xie, Daowen Qiu, Guangya Cai +2

The goal in the area of functions property testing is to determine whether a given black-box Boolean function has a particular given property or is -far from having th…

cs.CR2020★ 6 cited

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,…

quant-ph2019★ 1 cited

Multiple Pulses Phase-matching Quantum Key Distribution

Gang Chen, Le Wang, Wei Li +4

We propose a multiple pulses phase-matching quantum key distribution protocol (MPPM-QKD) to exceed the linear key rate bound and to achieve higher error tolerance. In our protocol,…

quant-ph2018★ 1 cited

Synthesis of Quantum Images Using Phase Rotation

Shiping Du, Daowen Qiu, Jozef Gruska +1

A topic about synthesis of quantum images is proposed, and a specific phase rotation transform constructed is adopted to theoretically realise the synthesis of two quantum images.…

quant-ph2015★ 1 cited

Time-space tradeoffs for two-way finite automata

Shenggen Zheng, Daowen Qiu, Jozef Gruska

We explore bounds of {\em time-space tradeoffs} in language recognition on {\em two-way finite automata} for some special languages. We prove: (1) a time-space tradeoff upper bound…

cs.FL2014

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…