Triple
T14860118
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Deutsch–Jozsa algorithm |
E349464
|
entity |
| Predicate | relatedTo |
P37
|
FINISHED |
| Object | Shor’s algorithm |
E1124193
|
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: Shor’s algorithm | Statement: [Deutsch–Jozsa algorithm, relatedTo, Shor’s algorithm]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Shor’s algorithm Context triple: [Deutsch–Jozsa algorithm, relatedTo, Shor’s algorithm]
-
A.
Grover’s algorithm
Grover’s algorithm is a quantum search algorithm that provides a quadratic speedup over classical methods for finding a marked item in an unsorted database.
-
B.
Bernstein–Vazirani algorithm
The Bernstein–Vazirani algorithm is a quantum algorithm that efficiently determines a hidden binary string using a single query to an oracle, illustrating quantum speedup over classical methods.
-
C.
Simon’s algorithm
chosen
Simon’s algorithm is a quantum algorithm that efficiently solves a specific type of hidden-period problem, demonstrating an exponential speedup over classical algorithms and paving the way for later breakthroughs like Shor’s algorithm.
-
D.
Deutsch–Jozsa algorithm
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.
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.
- 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_69fe6b4f224c8190bb2e06203c9b3a94 |
completed | May 8, 2026, 11:01 p.m. |
Created at: April 10, 2026, 1:54 a.m.