Searching for "Lower Bounds for Quantum Communication Complexity." – sorted by Relevance.
-
Lower Bounds for Quantum Communication Complexity
- arXiv:quant-ph/0106160v3 15 Apr 2002 LOWER BOUNDS FOR QUANTUM COMMUNICATION COMPLEXITY ∗ HARTMUT
- Cited by 22 (3 self) – Add To MetaCart
-
A discrepancy-based proof of Razborov’s quantum lower bounds
- ] established optimal lower bounds on the quantum communication complexity of every function of the form f (x, y
- Cited by 2 (2 self) – Add To MetaCart
-
Lower bounds in communication complexity based on factorization norms
- results we extend some known lower bounds to the realm of quantum communication complexity
- Cited by 16 (3 self) – Add To MetaCart
-
Renyi-entropic bounds on quantum communication
- ]. Kremer’s work in particular demonstrated several lower bounds on the quantum communication complexity
- Cited by 2 (0 self) – Add To MetaCart
-
A direct product theorem for discrepancy
- showing a Ω( √ n) lower bound on the quantum communication complexity of disjointness, Razborov [Raz03
- Cited by 4 (2 self) – Add To MetaCart
-
The pattern matrix method for lower bounds on quantum communication
- The Pattern Matrix Method for Lower Bounds on Quantum Communication Alexander A. Sherstov The Univ
- Cited by 13 (5 self) – Add To MetaCart
-
The Pattern Matrix Method for Lower Bounds on Communication Complexity ∗
- The Pattern Matrix Method for Lower Bounds on Communication Complexity ∗ Alexander A. Sherstov
- Add To MetaCart
-
Quantum communication complexity of block-composed functions. Available at arXiv:0710.0095v1
- in the concluding section. 4 2 Preliminaries 2.1 Communication complexities and quantum lower bound by approximate
- Cited by 7 (1 self) – Add To MetaCart
-
Improved Quantum Communication Complexity
- -enhanced quantum communication complexity [13, 28]. In contrast, we show here that the 12 in the above lower bound
- Add To MetaCart
-
Improved quantum communication complexity bounds for disjointness and equality
- -enhanced quantum communication complexity [13, 28]. In contrast, we show here that the 1 2 in the above lower bound
- Cited by 16 (2 self) – Add To MetaCart

