Prior to coming to UT, Aaronson taught for nine years in the Electrical Engineering and Computer Science department at MIT. As a Schlumberger Centennial Professor at the University of Austin his primary area of research is theoretical computer science, and his interests center around the capabilities and limits of quantum computers, and computational complexity theory more generally.<\/p>\n\n\n\n
In 2026 he was awarded with the Inaugural Luca Trevisan Award for Expository Work in Theoretical Computer Science and was elected to the U.S. National Academy of Sciences.<\/p>\n\n\n\n
As a leading mathematical mind of our time, he has given lectures and published papers on the capabilities and limits of quantum computers, computational complexity theory, as well as his book “Quantum Computing since Democritus<\/a>“.<\/p>\n\n\n\n You can find out more about Scott’s work on his blog<\/a> and from his Wikipedia<\/a> entry.. We also highly recommend the video “From Quantum Computing to AI Safety”<\/a>.<\/p>\n\n\n\n <\/p>\n","protected":false},"excerpt":{"rendered":" Prior to coming to UT, Aaronson taught for nine years in the Electrical Engineering and Computer Science department at MIT. As a Schlumberger Centennial Professor at the University of Austin his primary area of research is theoretical computer science, and his interests center around the capabilities and limits of quantum computers, and computational complexity theory […]<\/p>\n","protected":false},"author":2,"featured_media":1004,"comment_status":"closed","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"iawp_total_views":228,"footnotes":""},"categories":[80,18],"tags":[87],"class_list":["post-1003","post","type-post","status-publish","format-standard","has-post-thumbnail","hentry","category-speakers-from-academia","category-speaker","tag-professor-at-the-computer-science-department-at-ut"],"aioseo_notices":[],"aioseo_head":"\n\t\t\n\t\n\t\n\t\n\t\n\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t
\n\n\n\n