Ronald de Wolf

from Wikipedia, the free encyclopedia

Ronald Michiel de Wolf (born January 28, 1973 in Zaandam ) is a Dutch computer scientist who deals with quantum informatics .

After graduating from high school in Capelle aan den IJssel, Ronald de Wolf studied computer science at the University of Rotterdam in 1991 (master's degree 1996) and philosophy (master's degree 1997). From 1997 he was at the CWI and the University of Amsterdam , where he obtained his doctorate in computer science ( Quantum computing and communication complexity ) under Paul Vitányi and Harry Buhrman in 2001 . As a post-doctoral student he was with Umesh Vazirani at the University of California, Berkeley and from 2002 to 2006 at the Centrum Wiskunde & Informatica(CWI), where he became Senior Researcher in 2007. Since 2011 he has also been a professor at the University of Amsterdam.

With Harry Buhrman and others he developed a general method for determining the limits of quantum computers, the quantum polynomial method. Also with Buhrman, he showed that quantum computers are much more efficient for some problems (such as the determination of quantum fingerprints). With Kerenidis he applied quantum informatics to a classic computer science problem and found exponential lower limits for the length of locally decodable error-correcting codes (with 2 bits of the code word for decoding one bit). Previously, only polynomial lower limits had been found using classical computer science methods. The process also provided new cryptographic protocols.

In 2003 he received the Cor Baayen Award from the ERCIM (European Research Consortium for Informatics and Mathematics). In 2014 he received a Consolidator Grant from the European Research Council and a TOP Grant from the Dutch research organization NWO.

He is not to be confused with the American Scientology critic Ronald DeWolf .

Fonts (selection)

  • with SH Nienhuys-Cheng: Foundations of Inductive Logic Programming, Lecture Notes in Artificial Intelligence 1228, Springer 1997
  • with R. Beals, H. Buhrman, R. Cleve, Michele Mosca : Quantum lower bounds by polynomials, FOCS 1998, Arxiv 1998, and Journal of the ACM, Volume 48, 2001, pp. 778-797
  • with Harry Buhrman, Richard Cleve, John Watrous: Quantum fingerprinting, Physical Review Letters, Volume 87, 2001, p. 167902, Arxiv
  • with Iordanis Kerenidis: Exponential lower bound for 2-query locally decodable codes via a quantum argument, Proceedings of the thirty-fifth annual ACM symposium on Theory of computing (STOC '03). ACM, New York, 2003, pp. 106-115, final version: Journal of Computer Systems Science, Volume 69, 2004, pp. 395-420
  • with Dmitry Gavinsky, Julia Kempe, Iordanis Kerenidis, Ran Raz : Exponential separations for one-way quantum communication complexity, with applications to cryptography, Proceedings of the thirty-ninth annual ACM symposium on Theory of computing (STOC '07). ACM, New York, 2007, pp. 516-525, final version: SIAM J. Computing, Volume 38, 2008, pp. 1695-1708
  • with D. Gavinsky, J. Kempe, O. Regev: Bounded-error quantum state identication and exponential separations in communication complexity, SIAM Journal on Computing, Volume 39, 2009, pp. 1–39 (earlier version in STOC 2006).
  • with Harry Buhrman, Richard Cleve, Serge Massar: Nonlocality and communication complexity, Rev. Mod. Phys., Volume 82, 2010, pp. 665–698, Arxiv
  • with S. Samuel Fiorini, Serge Massar, Sebastian Pokutta, Hans Raj Tiwary: Linear vs. semidefinite extended formulations: exponential separation and strong lower bounds, Proceedings of the forty-fourth annual ACM symposium on Theory of computing (STOC '12). ACM, New York 2012, pp. 95-106, later version: Exponential Lower Bounds for Polytopes in Combinatorial Optimization, Journal of the ACM, Volume 62, 2015, p. 17,
  • with V. Chen, E. Grigorescu: Efficient and Error-Correcting Data Structures for Membership and Polynomial Evaluation, SIAM Journal on Computing, Volume 42, 2013, pp. 84–111

Web links

Individual evidence

  1. ↑ Curriculum Vitae on his homepage, accessed November 13, 2018
  2. ↑ Ronald de Wolf in the Mathematics Genealogy Project (English)Template: MathGenealogyProject / Maintenance / id used
  3. ↑ R. Beals, H. Buhrman, R. Cleve, M. Mosca, R. de Wolf, Quantum lower bounds by polynomials, FOCS 1998, Arxiv
  4. ↑ Possibilities and Limitations of Quantum Computing , Ercim News, January 2004 (Cor Baayen Award for Ronald de Wolf)
personal data
SURNAME Wolf, Ronald de
ALTERNATIVE NAMES Wolf, Ronald Michiel de
BRIEF DESCRIPTION Dutch computer scientist
DATE OF BIRTH January 28, 1973
PLACE OF BIRTH Zaandam