{"paper":{"title":"Generalizations of the distributed Deutsch-Jozsa promise problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DC","cs.FL"],"primary_cat":"quant-ph","authors_text":"Daowen Qiu, Jozef Gruska, Shenggen Zheng","submitted_at":"2014-02-28T14:21:06Z","abstract_excerpt":"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$ or $H(x,y)=\\frac{n}{2}$. Buhrman et al. (STOC' 98) proved that the exact {\\em quantum communication complexity} of this problem is ${\\bf O}(\\log {n})$ while the {\\em deterministic communication complexity} is ${\\bf \\Omega}(n)$. This was the first impressive (exponential) gap between quantum and classical communication complexity.\n  In this paper, we generalize the above distributed Deutsch-Jozsa promise problem to d"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.7254","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}