Leonard Schulman
Leonard Schulman | |
|---|---|
| Born | September 14, 1963 (age 61) Princeton, New Jersey |
| Nationality | American, Israeli |
| Alma mater | Massachusetts Institute of Technology |
| Known for | Algorithms, information theory, coding theory, quantum computation |
| Scientific career | |
| Fields | Computer science, applied mathematics |
| Institutions | California Institute of Technology |
| Doctoral advisor | Michael Sipser |
Leonard J. Y. Schulman (born September 14, 1963) is professor of computer science in the Computing and Mathematical Sciences Department at the California Institute of Technology. He is known for work on algorithms, information theory, coding theory, and quantum computation.
Personal biography
[edit]Schulman is the son of theoretical physicist Lawrence Schulman.
Academic biography
[edit]Schulman studied at the Massachusetts Institute of Technology, where he completed a BS degree in mathematics in 1988 and a PhD degree in applied mathematics in 1992. He was a faculty member in the College of Computing at the Georgia Institute of Technology from 1995 to 2000 before joining the faculty of the California Institute of Technology.[1] From 2003-2017, he served as the director of the Center for Mathematics of Information[2] at Caltech. He also participates in the Institute for Quantum Information and Matter.[3] In 2017-2018, he was a EURIAS Senior Fellow at the Israel Institute for Advanced Studies at the Hebrew University in Jerusalem.
Research
[edit]Schulman's research centers broadly around algorithms and information. He has made notable contributions to varied areas within this space including clustering, derandomization, quantum information theory, and coding theory. In coding theory he proved the Interactive Coding Theorem (a generalization of the Shannon Coding Theorem.) In clustering, his work on quantifying the effectiveness of Lloyd-type methods for the k-means problem, was named a Computing Reviews "Notable Paper" in 2012. [4] In quantum computation, he is known for his work on the non-abelian hidden subgroup problem, and for his work on noise thresholds for ensemble quantum computing.
Awards and honors
[edit]Schulman received the MIT Bucsela Prize in 1988, an NSF Mathematical Sciences Postdoctoral Fellowship in 1992 and an NSF CAREER award in 1999. His work received the IEEE S.A. Schelkunoff Prize in 2005.[5] Schulman was also recognized for the ACM Notable Paper in 2012. In 2022 he was awarded the FOCS Test of Time Award [6] for his work on error correction in the setting of interactive communication. He was the editor-in-chief of the SIAM Journal on Computing for two terms (2013-2018.) He was elected as a Fellow of the Society for Industrial and Applied Mathematics, in the 2022 Class of SIAM Fellows, "for seminal contributions to coding theory, quantum computing and matrix analysis, and outstanding service".[7]
References
[edit]- ^ Leonard Schulman at the Caltech Directory
- ^ The Center for the Mathematics of Information at Caltech
- ^ Institute for Quantum Information and Matter at Caltech
- ^ Computing Reviews Notable Papers and Books of 2012
- ^ IEEE Schelkunoff Prize Recipients
- ^ FOCS (Foundations of Computer Science) Test of Time Award
- ^ "SIAM Announces Class of 2022 Fellows". SIAM News. March 31, 2022. Retrieved 2022-03-31.
External links
[edit]
- American computer scientists
- 20th-century American mathematicians
- 21st-century American mathematicians
- California Institute of Technology faculty
- Massachusetts Institute of Technology School of Science alumni
- Living people
- American theoretical computer scientists
- 1963 births
- Fellows of the Society for Industrial and Applied Mathematics