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
Showing quant-phShow all

7 papers · 1 filter

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…

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…

quant-ph2014★ 20 cited

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

quant-ph2012★ 3 cited

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…