R. de Wolf. Characterization of non-deterministic quantum query and quantum communication complexity. In Proceedings of the 15th Annual IEEE Conference on Computational Complexity, pages 271--278, 2000. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Succinct Quantum Proofs for Properties of Finite Groups - Watrous (2000) (7 citations) (Correct)
....Turing machines that accept with nonzero probability if and only if the input is in L. This class coincides with the counting class co C= P [18, 19] This notion of quantum nondeterminism has also been investigated recently in the context of communication complexity and query complexity by de Wolf [28]. Second, we way view nondeterminism as it relates to verification. A common way to view NP is that NP is the class of languages consisting of those strings for which there exist polynomial length proofs of membership that can be checked in polynomial time, and one may extend this viewpoint to ....
R. de Wolf. Characterization of non-deterministic quantum query and quantum communication complexity. In Proceedings of the 15th Annual IEEE Conference on Computational Complexity, pages 271--278, 2000.
Quantum Entanglement and Communication Complexity - Buhrman, Cleve, Van Dam (1998) (3 citations) (Correct)
....according to the distribution (x, y) over the input states. In [1] it was shown that we can have an exponential gap between the quantum and the classical sampling complexity of the Disjoint function. Separations for nondeterministic (quantum) communication complexity are exhibited in the articles [31] and [24] In [7] there is a general framework for establishing lower bounds on exact communication complexity with entanglement. For the zero error (Las Vegas) model, Klauck [20] has given a polynomial di#erence between the quantum and the classical setting. The question whether quantum ....
R. de Wolf, Characterization of non-deterministic quantum query and quantum communication complexity, in Proceedings of the 15th Annual IEEE Conference on Computational Complexity, 2000, pp. 271--278.
Quantum Communication and Complexity - de Wolf (2000) (1 citation) Self-citation (De wolf) (Correct)
....communication complexity. A non deterministic protocol has positive acceptance probability on input (x; y) iff f(x; y) 1. Classically, the non deterministic communication complexity is characterized by the logarithm of the cover number of the communication matrix M f . Recently, de Wolf [49] showed that the quantum non deterministic communication complexity is characterized (up to a factor of 2) by the logarithm of the rank of a non deterministic version of M f . Finally, here s a list of interesting open problems in quantum communication complexity: ffl Raz s exponential gap only ....
R. de Wolf. Characterization of non-deterministic quantum query and quantum communication complexity. In Proceedings of 15th IEEE Conference on Computational Complexity, pages 271--278, 2000. cs.CC/0001014.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC