Quantum Computing Since Democritus
E1002082
Quantum Computing Since Democritus is a popular science book by Scott Aaronson that introduces quantum computing, complexity theory, and related philosophical ideas in an accessible and often humorous way.
All labels observed (1)
| Label | Occurrences |
|---|---|
| Quantum Computing Since Democritus canonical | 1 |
How this entity was disambiguated
This entity first appeared as the object of triple T12797756 — 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: Quantum Computing Since Democritus Context triple: [Scott Aaronson, notableWork, Quantum Computing Since Democritus]
-
A.
Quantum Mechanics: The Theoretical Minimum
Quantum Mechanics: The Theoretical Minimum is an introductory physics book that presents the core concepts and mathematical foundations of quantum mechanics in a rigorous yet accessible way for motivated beginners.
-
B.
Bennett's logical reversibility
Bennett's logical reversibility is a concept in computation theory stating that computational processes can be designed so that each step is logically reversible, allowing information to be recovered and, in principle, computation to occur without energy dissipation.
-
C.
Computational Complexity: A Conceptual Perspective
Computational Complexity: A Conceptual Perspective is a graduate-level textbook that presents the foundations and key themes of computational complexity theory with an emphasis on conceptual understanding over technical detail.
-
D.
Quantum Theory: Concepts and Methods
Quantum Theory: Concepts and Methods is a widely used graduate-level textbook by physicist Asher Peres that presents the foundations and formalism of quantum mechanics with an emphasis on conceptual clarity and mathematical rigor.
-
E.
“Probabilistic computations: Toward a unified measure of complexity”
“Probabilistic computations: Toward a unified measure of complexity” is a seminal research paper by Andrew Yao that laid foundational concepts in computational complexity theory, particularly regarding the role and analysis of randomness in algorithms.
- 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: Quantum Computing Since Democritus Target entity description: Quantum Computing Since Democritus is a popular science book by Scott Aaronson that introduces quantum computing, complexity theory, and related philosophical ideas in an accessible and often humorous way.
-
A.
Quantum Mechanics: The Theoretical Minimum
Quantum Mechanics: The Theoretical Minimum is an introductory physics book that presents the core concepts and mathematical foundations of quantum mechanics in a rigorous yet accessible way for motivated beginners.
-
B.
Bennett's logical reversibility
Bennett's logical reversibility is a concept in computation theory stating that computational processes can be designed so that each step is logically reversible, allowing information to be recovered and, in principle, computation to occur without energy dissipation.
-
C.
Computational Complexity: A Conceptual Perspective
Computational Complexity: A Conceptual Perspective is a graduate-level textbook that presents the foundations and key themes of computational complexity theory with an emphasis on conceptual understanding over technical detail.
-
D.
Quantum Theory: Concepts and Methods
Quantum Theory: Concepts and Methods is a widely used graduate-level textbook by physicist Asher Peres that presents the foundations and formalism of quantum mechanics with an emphasis on conceptual clarity and mathematical rigor.
-
E.
“Probabilistic computations: Toward a unified measure of complexity”
“Probabilistic computations: Toward a unified measure of complexity” is a seminal research paper by Andrew Yao that laid foundational concepts in computational complexity theory, particularly regarding the role and analysis of randomness in algorithms.
- F. None of above. chosen
Statements (50)
| Predicate | Object |
|---|---|
| instanceOf |
non-fiction book
ⓘ
popular science book ⓘ science book ⓘ |
| author | Scott Aaronson NERFINISHED ⓘ |
| countryOfPublication |
United Kingdom
ⓘ
United States of America ⓘ
surface form:
United States
|
| genre |
computer science
ⓘ
mathematics ⓘ philosophy of science ⓘ popular science ⓘ science ⓘ |
| hasPart |
chapters on complexity theory
ⓘ
chapters on computability and logic ⓘ chapters on information and entropy ⓘ chapters on philosophy of quantum mechanics ⓘ chapters on quantum computing ⓘ chapters on randomness and probability ⓘ |
| intendedAudience |
general audience
ⓘ
scientifically literate readers ⓘ students ⓘ |
| language | English ⓘ |
| mainSubject |
computability theory
ⓘ
computational complexity theory ⓘ foundations of quantum mechanics ⓘ information theory ⓘ logic ⓘ philosophy of computation ⓘ philosophy of physics ⓘ probability theory ⓘ quantum computing ⓘ |
| mediaType |
hardcover
ⓘ
paperback ⓘ print ⓘ |
| notableFor | bridging quantum computing and philosophy for a broad audience ⓘ |
| publicationYear | 2013 ⓘ |
| publisher | Cambridge University Press ⓘ |
| style |
accessible
ⓘ
humorous ⓘ informal ⓘ |
| topic |
BQP complexity class
NERFINISHED
ⓘ
Many-Worlds interpretation NERFINISHED ⓘ NP-completeness ⓘ P versus NP problem NERFINISHED ⓘ anthropic reasoning ⓘ computational hardness ⓘ free will in physics ⓘ interpretations of quantum mechanics ⓘ philosophy of mathematics ⓘ quantum algorithms ⓘ quantum circuits ⓘ |
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: Quantum Computing Since Democritus Description of subject: Quantum Computing Since Democritus is a popular science book by Scott Aaronson that introduces quantum computing, complexity theory, and related philosophical ideas in an accessible and often humorous way.
Referenced by (1)
Full triples — surface form annotated when it differs from this entity's canonical label.