R
Ronald de Wolf
Researcher at University of Amsterdam
Publications - 172
Citations - 8415
Ronald de Wolf is an academic researcher from University of Amsterdam. The author has contributed to research in topics: Quantum algorithm & Upper and lower bounds. The author has an hindex of 37, co-authored 168 publications receiving 7595 citations. Previous affiliations of Ronald de Wolf include Centrum Wiskunde & Informatica & Technion – Israel Institute of Technology.
Papers
More filters
Journal ArticleDOI
Complexity measures and decision tree complexity: a survey
Harry Buhrman,Ronald de Wolf +1 more
TL;DR: Several complexity measures for Boolean functions are discussed: certificate complexity, sensitivity, block sensitivity, and the degree of a representing or approximating polynomial, and how they give bounds for the decision tree complexity of Boolean functions on deterministic, randomized, and quantum computers.
Journal ArticleDOI
Quantum fingerprinting
TL;DR: In this article, the authors show that fingerprints consisting of quantum information can be made exponentially smaller than the original strings without any correlations or entanglement between the parties, and they give a test that distinguishes any two unknown quantum fingerprints with high probability.
Journal ArticleDOI
Quantum lower bounds by polynomials
TL;DR: This work examines the number of queries to input variables that a quantum algorithm requires to compute Boolean functions on {0,1}N in the black-box model and gives asymptotically tight characterizations of T for all symmetric f in the exact, zero-error, and bounded-error settings.
Journal ArticleDOI
Nonlocality and communication complexity
TL;DR: The area of quantum communication complexity is reviewed, and it is shown how it connects the foundational physics questions regarding non-locality with those of communication complexity studied in theoretical computer science.
Posted Content
Quantum Lower Bounds by Polynomials
TL;DR: In this article, it was shown that the exponential quantum speed-up obtained for partial functions (i.e., problems involving a promise on the input) by Deutsch and Jozsa and by Simon cannot be obtained for any total function, and that there is a classical deterministic algorithm that computes some total Boolean function f with bounded-error using T black-box queries.