Ronald de Wolf  Home/Search
Context Related
Links: ACM DBLP | cwi.nl/~rdewolf/publ/qc/nq.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: cwi.nl/~rdewolf/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: It is known that the classical and quantum query complexities of a total Boolean function f are polynomially related to the degree of its representing polynomial, but the optimal exponents in these relations are unknown. We show that the non-deterministic quantum query complexity of f is linearly related to the degree of a "non-deterministic" polynomial for f . We also prove a quantum-classical gap of 1 vs. n for non-deterministic query complexity for a total f . In the case of quantum... (Update)
Context of citations to this paper: More
...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...
...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....
Cited by: More
Succinct Quantum Proofs for Properties of Finite Groups - Watrous (2000) (Correct)
Quantum Entanglement and Communication Complexity - Buhrman, Cleve, Van Dam (1998) (Correct)
Quantum Communication and Complexity - de Wolf (2000) (Correct)
Active bibliography (related documents): More All
0.7: Complexity Measures and Decision Tree Complexity: A Survey - Buhrman, de Wolf (1999) (Correct)
0.6: Communication Complexity Lower Bounds by Polynomials - Buhrman, de Wolf (1999) (Correct)
0.4: Quantum Computing and Communication Complexity - Buhrman (2000) (Correct)
Similar documents based on text: More All
0.3: Sharp Quantum versus Classical Query Complexity Separations - de Beaudrap, Cleve, Watrous (2002) (Correct)
0.3: Quantum Certificate Complexity - Aaronson (Correct)
0.3: Algorithms for Boolean Function Query Properties - Aaronson (Correct)
Related documents from co-citation: More All
3: Quantum complexity theory - Bernstein, Vazirani - 1993
2: the Distributional Complexity of Disjointness (context) - Razborov - 1990
2: the Einstein-Podolsky-Rosen paradox (context) - Bell - 1964
BibTeX entry: (Update)
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. http://citeseer.ist.psu.edu/dewolf00characterization.html More
@inproceedings{ dewolf00characterization,
author = "Ronald de Wolf",
title = "Characterization of Non-Deterministic Quantum Query and Quantum Communication Complexity",
booktitle = "{IEEE} Conference on Computational Complexity",
pages = "271-278",
year = "2000",
url = "citeseer.ist.psu.edu/dewolf00characterization.html" }
Citations (may not include all citations):326 Topics in Matrix Analysis (context) - Horn, Johnson - 1991
210 A fast quantum mechanical algorithm for database search - Grover - 1996 ACM DBLP
197 Cambridge University Press (context) - Kushilevitz, Nisan - 1997
164 Polynomial-time algorithms for prime factorization and discr.. - Shor - 1997 ACM DBLP
144 the power of quantum computation - Simon - 1997
126 Rapid solution of problems by quantum computation (context) - Deutsch, Jozsa - 1992 ACM
60 Generic oracles and oracle classes (context) - Blum, Impagliazzo - 1987
57 the degree of Boolean functions as real polynomials - Nisan, Szegedy - 1994
50 the distributional complexity of disjointness (context) - Razborov - 1992
46 An exact quantum polynomial-time algorithm for Simon's probl.. - Brassard, Hyer - 1997 ACM DBLP
45 Quantum computation - Berthiaume - 1997 ACM
36 Complexity limitations on quantum computation - Fortnow, Rogers - 1999 ACM DBLP
32 Quantum computations: Algorithms and error correction (context) - Yu - 1997
30 Quantum counting - Brassard, Hyer et al. - 1998 ACM DBLP
28 Substituting quantum entanglement for communication (context) - Cleve, Buhrman - 1997
28 Exponential separation of quantum and classical communicatio.. - Raz - 1999 ACM DBLP
22 The quantum communication complexity of sampling - Ambainis, Schulman et al. - 1998 ACM DBLP
20 SIAM Journal on Computing (context) - Adleman, Demarrais et al. - 1997
19 Communication complexity lower bounds by polynomials - Buhrman, de Wolf - 1999 ACM DBLP
17 Complexity measures and decision tree complexity: A survey - Buhrman, de Wolf - 1999 DBLP
16 Bounds for small-error and zero-error quantum algorithms - Buhrman, Cleve et al. - 1999 ACM DBLP
15 Quantum algorithm for the collision problem - Brassard, Hyer et al. - 1997
11 An introduction to quantum complexity theory (context) - Cleve - 1999
11 Computer Science Department (context) - Kremer, Master's et al. - 1995
10 robustness and the nonisomorphism of NP-complete sets (context) - Hartmanis, Hemachandra - 1987
7 or why is it difficult to separate NP (context) - Tardos
7 The query complexity of order-finding - Cleve - 1999 ACM DBLP
5 Earlier version in FOCS (context) - Nisan, Wigderson et al. - 1995
1 Talk given at AQIP'99 (context) - Yu, NP - 1999
1 Paper in preparation (context) - Cleve, Massar - 1999
1 conjecture for modular communication complexity (context) - Meinel, Waack et al. - 1996
Documents on the same site (http://www.cwi.nl/~rdewolf/): More
Quantum Computation - Berthiaume (1997) (Correct)
Least Generalizations under Implication - Nienhuys-Cheng, de Wolf (1996) (Correct)
Lower Bounds for Quantum Search and Derandomization - Buhrman, de Wolf (1998) (Correct)
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