Triple
T12797749
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Scott Aaronson |
E305932
|
entity |
| Predicate | notableWork |
P4
|
FINISHED |
| Object |
BQP vs. the Polynomial Hierarchy
"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.
|
E1002076
|
NE FINISHED |
Provenance (5 batches)
| Stage | Batch ID | Job type | Status |
|---|---|---|---|
| creating | batch_69d7bdf366888190a8cccb982606889c |
elicitation | completed |
| NER | batch_69d96e6f858c8190915ede38e9a6a2df |
ner | completed |
| NED1 | batch_69f6850d6ebc8190aaffcac09f4b15eb |
ned_source_triple | completed |
| NED2 | batch_69f686bcac94819088782273effbb06a |
ned_description | completed |
| NEDg | batch_69f6863fada48190afe2ff7896a60094 |
nedg | completed |
Created at: April 9, 2026, 5:30 p.m.