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 $x,y\in \{0,1{\}}^n$ are at the {\em Hamming distance} $H(x,y)=0$…