BQP vs. the Polynomial Hierarchy
E1002076
"BQP vs. the Polynomial Hierarchy" is a highly influential research paper by Scott Aaronson that investigates the relationship between quantum polynomial-time computation and the classical polynomial hierarchy, with major implications for our understanding of quantum advantage and complexity theory.
All labels observed (1)
| Label | Occurrences |
|---|---|
| BQP vs. the Polynomial Hierarchy canonical | 1 |
How this entity was disambiguated
This entity first appeared as the object of triple T12797749 — 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: BQP vs. the Polynomial Hierarchy Context triple: [Scott Aaronson, notableWork, BQP vs. the Polynomial Hierarchy]
-
A.
Valiant–Vazirani theorem
The Valiant–Vazirani theorem is a fundamental result in computational complexity theory showing that solving unique solutions of NP problems is, under randomized reductions, as hard as solving general NP problems, with major implications for the study of randomness and hardness of approximation.
-
B.
“Inapproximability results for SAT and other problems”
“Inapproximability results for SAT and other problems” is a seminal theoretical computer science paper by Johan Håstad that establishes tight hardness-of-approximation bounds for satisfiability and related optimization problems using probabilistically checkable proofs.
-
C.
Furst–Saxe–Sipser lower bounds
Furst–Saxe–Sipser lower bounds are foundational results in circuit complexity theory that established superpolynomial lower bounds for constant-depth Boolean circuits (AC⁰), demonstrating inherent limitations of such circuits for computing certain functions.
-
D.
P, NP, and NP-Completeness: The Basics of Complexity Theory
"P, NP, and NP-Completeness: The Basics of Complexity Theory" is a foundational textbook by Oded Goldreich that introduces the core concepts, problems, and techniques of computational complexity theory, with a focus on the classes P, NP, and NP-complete problems.
-
E.
Interactive Proofs and the Hardness of Approximating Cliques
"Interactive Proofs and the Hardness of Approximating Cliques" is a seminal theoretical computer science paper that introduced powerful interactive proof techniques to show that finding near-maximum cliques in graphs is computationally intractable to approximate within strong bounds.
- 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: BQP vs. the Polynomial Hierarchy Target entity description: "BQP vs. the Polynomial Hierarchy" is a highly influential research paper by Scott Aaronson that investigates the relationship between quantum polynomial-time computation and the classical polynomial hierarchy, with major implications for our understanding of quantum advantage and complexity theory.
-
A.
Valiant–Vazirani theorem
The Valiant–Vazirani theorem is a fundamental result in computational complexity theory showing that solving unique solutions of NP problems is, under randomized reductions, as hard as solving general NP problems, with major implications for the study of randomness and hardness of approximation.
-
B.
“Inapproximability results for SAT and other problems”
“Inapproximability results for SAT and other problems” is a seminal theoretical computer science paper by Johan Håstad that establishes tight hardness-of-approximation bounds for satisfiability and related optimization problems using probabilistically checkable proofs.
-
C.
Furst–Saxe–Sipser lower bounds
Furst–Saxe–Sipser lower bounds are foundational results in circuit complexity theory that established superpolynomial lower bounds for constant-depth Boolean circuits (AC⁰), demonstrating inherent limitations of such circuits for computing certain functions.
-
D.
P, NP, and NP-Completeness: The Basics of Complexity Theory
"P, NP, and NP-Completeness: The Basics of Complexity Theory" is a foundational textbook by Oded Goldreich that introduces the core concepts, problems, and techniques of computational complexity theory, with a focus on the classes P, NP, and NP-complete problems.
-
E.
Interactive Proofs and the Hardness of Approximating Cliques
"Interactive Proofs and the Hardness of Approximating Cliques" is a seminal theoretical computer science paper that introduced powerful interactive proof techniques to show that finding near-maximum cliques in graphs is computationally intractable to approximate within strong bounds.
- F. None of above. chosen
Statements (49)
| Predicate | Object |
|---|---|
| instanceOf |
complexity theory paper
ⓘ
computer science paper ⓘ research paper ⓘ |
| area | theoretical computer science ⓘ |
| author | Scott Aaronson NERFINISHED ⓘ |
| concernsClass |
BPP
NERFINISHED
ⓘ
BQP NERFINISHED ⓘ NP ⓘ P NERFINISHED ⓘ PH ⓘ PP NERFINISHED ⓘ P^{#P} NERFINISHED ⓘ |
| contribution |
connects quantum query algorithms with the structure of the polynomial hierarchy
ⓘ
develops new techniques for proving oracle separations between quantum and classical complexity classes ⓘ formalizes problems designed to separate quantum computation from the polynomial hierarchy ⓘ provides evidence against the containment of BQP in PH in the relativized setting ⓘ |
| field |
computational complexity theory
ⓘ
quantum computing ⓘ |
| focus |
limitations of classical simulation of quantum algorithms
ⓘ
relationship between quantum polynomial time and the polynomial hierarchy ⓘ |
| implication |
indicates that resolving BQP versus PH likely requires nonrelativizing techniques
ⓘ
suggests limitations of classical relativizing techniques for proving upper bounds on BQP ⓘ supports the view that quantum computers may solve problems beyond the reach of the polynomial hierarchy ⓘ |
| influenced |
research on fine-grained separations between quantum and classical complexity classes
ⓘ
studies of random oracles in quantum complexity ⓘ subsequent work on quantum supremacy proposals ⓘ |
| influencedBy |
earlier work on oracle separations in complexity theory
ⓘ
research on quantum query complexity ⓘ |
| language | English ⓘ |
| mainResult |
argues that Fourier Checking is not in the polynomial hierarchy relative to a random oracle under plausible conjectures
ⓘ
exhibits an oracle relative to which BQP is not contained in the polynomial hierarchy ⓘ gives evidence that quantum computers can solve certain problems outside the polynomial hierarchy in the relativized world ⓘ introduces the Fourier Checking problem as a candidate for demonstrating quantum advantage over the polynomial hierarchy ⓘ shows that Fourier Checking is solvable in BQP relative to a random oracle ⓘ |
| status |
highly cited
ⓘ
influential in quantum complexity theory ⓘ |
| topic |
BQP
NERFINISHED
ⓘ
Fourier Checking problem NERFINISHED ⓘ Fourier Fishing problem NERFINISHED ⓘ black-box separations ⓘ oracle separations ⓘ polynomial hierarchy ⓘ quantum advantage ⓘ query complexity ⓘ relativized complexity classes ⓘ |
| usesMethod |
Fourier analysis of Boolean functions
ⓘ
oracle constructions ⓘ probabilistic method ⓘ query complexity lower bounds ⓘ |
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: BQP vs. the Polynomial Hierarchy Description of subject: "BQP vs. the Polynomial Hierarchy" is a highly influential research paper by Scott Aaronson that investigates the relationship between quantum polynomial-time computation and the classical polynomial hierarchy, with major implications for our understanding of quantum advantage and complexity theory.
Referenced by (1)
Full triples — surface form annotated when it differs from this entity's canonical label.