Ronald de Wolf

Ronald Michiel de Wolf (born 1973) is a Dutch Computer Scientist, currently a Senior Researcher at Centrum Wiskunde & Informatica (CWI) and a Professor at the Institute for Logic, Language and Computation (ILLC) of the University of Amsterdam (UvA).

Ronald de Wolf
Born1973
Zaandam [1]
Alma materUniversity of Amsterdam[1]
Erasmus University Rotterdam [1]
Known forQuantum fingerprinting
Communication complexity
Coding theory
Scientific career
FieldsComputer Science, Quantum Computing, Logic
InstitutionsCWI
University of California, Berkeley
Doctoral advisorHarry Buhrman, Paul Vitanyi[1][2]

His research interests are on Quantum computing, Quantum information, Coding theory, and Computational complexity theory.

His scientific contributions include the first exponential separation between one-way quantum and classical communication protocols for a partial Boolean function,[3] and a proof that a locally decodable code (LDC) with 2 classical queries need exponential length.[4] This suggested the use of techniques from quantum computing to prove results in "classical" computer science.

De Wolf and his coauthors received the Best Paper Award at the Annual ACM Symposium on Theory of Computing (STOC) in 2012.[5]

Publications
  • Ronald de Wolf publications indexed by Google Scholar
  • List of publications on arXiv
  • Buhrman, Harry; Cleve, Richard; Watrous, John; de Wolf, Ronald (2001). "Quantum fingerprinting". Physical Review Letters. 87 (16). arXiv:quant-ph/0102001. doi:10.1103/PhysRevLett.87.167902. PMID 11690244. 167902.
  • Nienhuys-Cheng, Shan-Hwei; de Wolf, Ronald (1997). Siekmann, J.; Carbonell, J. G. (eds.). Foundations of Inductive Logic Programming. Lecture Notes in Computer Science. Springer-Verlag New York, Inc. ISBN 978-3540629276. 1228.

References
  1. Prof. dr. R.M. de Wolf, 1973 - at the University of Amsterdam's Album Academicum
  2. Mathematics Genealogy Project
  3. Dmitry Gavinsky, Julia Kempe, Iordanis Kerenidis, Ran Raz, and Ronald de Wolf. 2007. Exponential separations for one-way quantum communication complexity, with applications to cryptography. In Proceedings of the thirty-ninth annual ACM symposium on Theory of computing (STOC '07). ACM, New York, NY, USA, 516-525. DOI: https://doi.org/10.1145/1250790.1250866
  4. Iordanis Kerenidis and Ronald de Wolf. 2003. Exponential lower bound for 2-query locally decodable codes via a quantum argument. In Proceedings of the thirty-fifth annual ACM symposium on Theory of computing (STOC '03). ACM, New York, NY, USA, 106-115. DOI: https://doi.org/10.1145/780542.780560
  5. S. Samuel Fiorini, Serge Massar, Sebastian Pokutta, Hans Raj Tiwary, and Ronald de Wolf. 2012. Linear vs. semidefinite extended formulations: exponential separation and strong lower bounds. In Proceedings of the forty-fourth annual ACM symposium on Theory of computing (STOC '12). ACM, New York, NY, USA, 95-106. DOI: https://doi.org/10.1145/2213977.2213988
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.