Associate professor at UvA (ILLC)
Email: L.Torenvliet at uva.nl
Research line: Quantum information science
Leen Torenvliet studied mathematics at the University of Amsterdam, from which university he obtained his PhD in 1986. He was subsequently appointed as an assistant professor in Logic and Theoretical Computer Science (with tenure) and was promoted to associate professor in 2001, which is his current position. Leen has written about 50 papers on various subjects in theoretical computer science ranging from the structural relations between complexity classes and algorithms and datastructures, machine learning and Kolmogorov complexity, to implementations of algorithms both sequential and parallel.
Leen helped set up the programme in computer science at the UvA in 1980, and was programme director for a period of three years until 2010, when he became scientific director of the Institute for Logic Language and Computaton. He is currently the leader of the program Logic and Computation at that institute.
Most relationships between classical complexity classes, like proper inclusion, have remained unresolved for the past couple of decades. Now on the rise of quantum computing, more natural complexity classes related to quantum computing (e.g, BQP) have arisen and more questions about relations between these classes and their classical counterparts. Are quantum compexity classes really more complex than are the old classes, and are there structural reasons for that? This is probably the main reason Leen is interested in quantum computing.