Scott Aaronson
E305932
academic
author
blogger
computer scientist
human
science communicator
theoretical computer scientist
Scott Aaronson is a prominent theoretical computer scientist known for his work on quantum computing and computational complexity, as well as for his accessible popular science writing.
All labels observed (2)
| Label | Occurrences |
|---|---|
| Scott Aaronson canonical | 2 |
| Aaronson | 1 |
How this entity was disambiguated
This entity first appeared as the object of triple T2866567 — resolving that mention is where its identity was fixed. The disambiguator weighed these candidate entities and picked the highlighted one (or “None”, minting a new entity). This is how homonymy is resolved: the same surface form can point to different entities.
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Scott Aaronson Context triple: [Princeton Science Library, hasNotableAuthor, Scott Aaronson]
-
A.
Lance Fortnow
Lance Fortnow is an American theoretical computer scientist known for his contributions to computational complexity theory and for his expository work on the P vs NP problem.
-
B.
Avi Wigderson
Avi Wigderson is a prominent Israeli-American computer scientist renowned for his foundational contributions to computational complexity theory and for receiving the Turing Award.
-
C.
Omer Reingold
Omer Reingold is a prominent theoretical computer scientist known for his influential work in computational complexity and cryptography, including a landmark log-space algorithm for undirected graph connectivity.
-
D.
David Deutsch
David Deutsch is a British physicist and philosopher best known as a pioneer of quantum computation and a leading proponent of the many-worlds interpretation of quantum mechanics.
-
E.
Iftach Haitner
Iftach Haitner is an Israeli computer scientist and cryptographer known for his contributions to the foundations of cryptography and computational complexity.
- F. None of above. chosen
- G. Unsure - the case is ambiguous/there is not enough information to decide.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: Scott Aaronson Target entity description: Scott Aaronson is a prominent theoretical computer scientist known for his work on quantum computing and computational complexity, as well as for his accessible popular science writing.
-
A.
Lance Fortnow
Lance Fortnow is an American theoretical computer scientist known for his contributions to computational complexity theory and for his expository work on the P vs NP problem.
-
B.
Avi Wigderson
Avi Wigderson is a prominent Israeli-American computer scientist renowned for his foundational contributions to computational complexity theory and for receiving the Turing Award.
-
C.
Omer Reingold
Omer Reingold is a prominent theoretical computer scientist known for his influential work in computational complexity and cryptography, including a landmark log-space algorithm for undirected graph connectivity.
-
D.
David Deutsch
David Deutsch is a British physicist and philosopher best known as a pioneer of quantum computation and a leading proponent of the many-worlds interpretation of quantum mechanics.
-
E.
Iftach Haitner
Iftach Haitner is an Israeli computer scientist and cryptographer known for his contributions to the foundations of cryptography and computational complexity.
- F. None of above. chosen
Statements (53)
| Predicate | Object |
|---|---|
| instanceOf |
academic
ⓘ
author ⓘ blogger ⓘ computer scientist ⓘ human ⓘ science communicator ⓘ theoretical computer scientist ⓘ |
| academicDegree |
Bachelor’s degree in computer science
ⓘ
PhD in computer science ⓘ |
| awardReceived |
ACM Prize in Computing
ⓘ
Alan T. Waterman Award ⓘ Presidential Early Career Award for Scientists and Engineers ⓘ
surface form:
PECASE (Presidential Early Career Award for Scientists and Engineers)
|
| citizenship | United States of America ⓘ |
| educatedAt |
Cornell University
ⓘ
University of California, Berkeley ⓘ |
| employer |
Massachusetts Institute of Technology
ⓘ
University of Texas at Austin ⓘ |
| familyName |
Scott Aaronson
self-linksurface differs
ⓘ
surface form:
Aaronson
|
| fieldOfWork |
computational complexity theory
ⓘ
computational learning theory ⓘ philosophy of quantum mechanics ⓘ quantum complexity theory ⓘ quantum computing ⓘ quantum information theory ⓘ theoretical computer science ⓘ |
| givenName | Scott ⓘ |
| hasBlog |
Shtetl-Optimized blog
ⓘ
surface form:
Shtetl-Optimized
|
| hasWebsite | https://www.scottaaronson.com ⓘ |
| influenced |
public understanding of quantum computing
ⓘ
research in quantum complexity theory ⓘ |
| influencedBy | quantum information theorists such as John Preskill ⓘ |
| knownFor |
blogging about quantum computing and complexity
ⓘ
popular science writing ⓘ research on quantum supremacy and complexity-theoretic foundations ⓘ work on computational complexity theory ⓘ work on quantum computing ⓘ |
| languageSpoken | English ⓘ |
| notableWork |
BQP vs. the Polynomial Hierarchy
ⓘ
Limits on Efficient Computation in the Physical World ⓘ P vs. NP survey and expository writings ⓘ Quantum Computing Since Democritus ⓘ Quantum Copy-Protection and Quantum Money ⓘ Shtetl-Optimized blog ⓘ The Complexity of Quantum States and Transformations ⓘ The Learnability of Quantum States ⓘ Why Philosophers Should Care About Computational Complexity ⓘ |
| occupation |
professor
ⓘ
researcher ⓘ writer ⓘ |
| positionHeld |
David J. Bruton Jr. Centennial Professor of Computer Science at UT Austin
ⓘ
founding director of the Quantum Information Center at UT Austin ⓘ professor of electrical engineering and computer science at MIT ⓘ |
| sexOrGender | male ⓘ |
How these facts were elicited
The pipeline generated the facts above by prompting gpt-5.1 with this entity's name + description and the instruction below.
Instruction
You are a knowledge base construction expert. Given a subject entity and a description of it, return factual statements that you know for the subject as a JSON list of dictionaries(triples), where keys must be "subject", "predicate" and "object". The number of facts may be very high, between 25 to 50 or more, for very popular subjects. For less popular subjects, the number of facts can be very low, like 5 or 10. # Requirements - If you don't know the subject at all, return an empty list. - If the subject is not a named entity, return an empty list. - Include at least one triple where predicate is "instanceOf". - Do not get too wordy. - Separate several objects into multiple triples with one object.
Input
Subject: Scott Aaronson Description of subject: Scott Aaronson is a prominent theoretical computer scientist known for his work on quantum computing and computational complexity, as well as for his accessible popular science writing.
Referenced by (3)
Full triples — surface form annotated when it differs from this entity's canonical label.
this entity surface form:
Aaronson