Quantum News Quantum Supremacy

Scott Aaronson Winner of 2020 ACM Prize In Computing

April 14, 2021

Scott Aaronson Winner of 2020 ACM Prize In Computing

Aaronson, who is Professor of Computer Science at the University of Texas, Austin, has also made fundamental contributions to classical complexity theory. The award, which was established in 2007 to recognize “early to mid-career fundamental innovative contributions in computing” carries a prize of $250,000, with its financial support provided by He has also explored how quantum supremacy experiments could deliver a key application of quantum computing, namely the generation of cryptographically random bits. Scott Aaronson is the recipient of the 2020 ACM Prize in Computing for his “groundbreaking contributions to quantum computing.” TED Talks to dispel misconceptions and provide the public with a more accurate overview of the field and his book Quantum Computing Since Democritus, see side panel. Aaronson is known for his work on “algebrization”, a technique he invented with Avi Wigderson to understand the limits of algebraic techniques for separating and collapsing complexity classes. When the effort to build quantum computation devices was first seriously explored in the 1990s, some labeled it as science fiction.

Article from iProgrammer.