A quantum-computing theorist known for mathematical limits on quantum query algorithms and an openly available set of lecture notes spanning algorithms, communication and error correction.
CWIarXiv / Journal of the ACMarXivDe Wolf helps define how quantum speedups should be assessed. His coauthored polynomial-method paper made it possible to prove important lower bounds on quantum queries, complementing the search for faster algorithms. His lecture notes provide a broad route into the field’s mathematical foundations. Together, the research and teaching emphasize precise models, stated assumptions and meaningful comparisons with classical computation, which are essential when evaluating ambitious claims about quantum advantage.
CWIarXiv / Journal of the ACMarXivDefining contributions
Work, in context- 1998
Polynomial lower bounds for quantum queries
With Robert Beals, Harry Buhrman, Richard Cleve and Michele Mosca, de Wolf developed a polynomial approach to proving quantum query lower bounds. The paper constrained possible quantum speedups for total Boolean functions and supplied a widely applicable analytical technique.
Coauthor of the polynomial-method research with Beals, Buhrman, Cleve and Mosca.
Source-supported recordarXiv / Journal of the ACM - 2019
An open quantum-computing course
De Wolf published his Quantum Computing: Lecture Notes on arXiv, drawing on a course first drafted in 2011 and subsequently updated. The notes cover algorithms, complexity, communication and error correction, making a substantial mathematical curriculum freely accessible.
Author and continuing reviser of the openly published quantum-computing lecture notes.
Source-supported recordarXiv
Keep in perspective
Alphabetized under W in accordance with the author’s explicit surname guidance.
Follow the evidence
3 sourcesPrimary papers, institutional records and attributed announcements. Each source supports the claims linked above.
- CWIinstitutional personal page
Ronald de Wolf
Current CWI and University of Amsterdam roles; explicit instruction to alphabetize surname at W.
Checked 2026-09-19 - arXiv / Journal of the ACMprimary research
Quantum Lower Bounds by Polynomials
Authors and polynomial-method lower bounds.
Published 1998-02-18 · Checked 2026-09-19 - arXivprimary research
Quantum Computing: Lecture Notes
Open notes, subject coverage, first-course history and continuing revisions.
Published 2019-07-19 · Checked 2026-09-19