Improved Quantum Communication Complexity Bounds for Disjointness and Equality

@inproceedings{Hyer2002ImprovedQC,
  title={Improved Quantum Communication Complexity Bounds for Disjointness and Equality},
  author={Peter H\oyer and Ronald de Wolf},
  booktitle={STACS},
  year={2002}
}
We prove new bounds on the quantum communication complexity of the disjointness and equality problems. For the case of exact and non-deterministic protocols we show that these complexities are all equal to n+1, the previous best lower bound being n/2. We show this by improving a general bound for non-deterministic protocols of de Wolf. We also give an O( √ n ·c ∗ )-qubit bounded-error protocol for disjointness, modifying and improving the earlier O( √ n logn) protocol of Buhrman, Cleve, and… CONTINUE READING

From This Paper

Topics from this paper.
40 Citations
36 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-10 of 36 references

Quantum communication

  • I. Kremer
  • Computer Science Department,
  • 1995
Highly Influential
4 Excerpts

Similar Papers

Loading similar papers…