Triple

T14860089
Position Surface form Disambiguated ID Type / Status
Subject Deutsch–Jozsa algorithm E349464 entity
Predicate originalPublicationTitle P33185 FINISHED
Object Rapid solution of problems by quantum computation E349464 NE FINISHED

How this triple was built (2 steps)

Every LLM step that produced this triple, in pipeline order — named-entity classification, the disambiguation choices (the exact options shown, with the pick highlighted), and the generated description. The batch + timestamp of each is in the Provenance table below.

NER Named-entity recognition gpt-5-mini
Instruction
Given a phrase, classify it is english named entity (e.g., persons, organizations, works of art) in Latin script, or not (e.g., literals, dates, URLs, verbose phrases). For disambiguation, the statement where the phrase occurs as object is also given. Please return a JSON object with `phrase` (string, the phrase being analyzed) and `is_ne` (boolean, indicating whether the phrase is a Named Entity).
Input
Phrase: Rapid solution of problems by quantum computation | Statement: [Deutsch–Jozsa algorithm, originalPublicationTitle, Rapid solution of problems by quantum computation]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07 
Target entity: Rapid solution of problems by quantum computation
Context triple: [Deutsch–Jozsa algorithm, originalPublicationTitle, Rapid solution of problems by quantum computation]
  • A. Quantum Computing Since Democritus
    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.
  • B. The Complexity of Quantum States and Transformations
    "The Complexity of Quantum States and Transformations" is a highly cited research paper by Scott Aaronson that investigates the computational complexity and limitations of describing, preparing, and manipulating quantum states and operations.
  • C. 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.
  • D. Deutsch–Jozsa algorithm chosen
    The Deutsch–Jozsa algorithm is a foundational quantum algorithm that demonstrates how quantum computation can solve certain decision problems exponentially faster than any classical deterministic algorithm.
  • E. “Molecular computation of solutions to combinatorial problems”
    “Molecular computation of solutions to combinatorial problems” is Leonard Adleman’s pioneering 1994 paper that introduced DNA computing by demonstrating how molecular biology techniques can solve a combinatorial search problem.
  • F. None of above.
  • G. Unsure - the case is ambiguous/there is not enough information to decide.

Provenance (3 batches)

The batch behind each pipeline step, in order, with when it ran. Timestamps are batch-level — stages were processed in waves, so the object chain (NER → NED1 → NEDg → NED2) reads in order, but predicate / elicitation batches can sit in a different wave.

Step Stage Batch ID Status When
creating Elicitation batch_69d822ed7e1881909b90fca143ad7e34 completed April 9, 2026, 10:06 p.m.
NER Named-entity recognition batch_69ded44598e48190b759a05ed2d9ecaf completed April 14, 2026, 11:56 p.m.
NED1 Entity disambiguation (via context triple) batch_69fe650a43bc8190b836fe690d2a3c71 completed May 8, 2026, 10:34 p.m.
Created at: April 10, 2026, 1:54 a.m.