Triple

T14860117
Position Surface form Disambiguated ID Type / Status
Subject Deutsch–Jozsa algorithm E349464 entity
Predicate relatedTo P37 FINISHED
Object 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.
E1124194 NE FINISHED

How this triple was built (4 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: Grover’s algorithm | Statement: [Deutsch–Jozsa algorithm, relatedTo, Grover’s algorithm]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07
Target entity: Grover’s algorithm
Context triple: [Deutsch–Jozsa algorithm, relatedTo, Grover’s algorithm]
  • A. 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.
  • B. 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.
  • C. Bennett–Brassard 1984 protocol
    The Bennett–Brassard 1984 protocol is the first quantum key distribution scheme, using quantum properties of photons to enable two parties to establish a shared secret key with security guaranteed by the laws of quantum mechanics.
  • D. The Learnability of Quantum States
    "The Learnability of Quantum States" is a research paper by Scott Aaronson that investigates under what conditions quantum states can be efficiently learned or approximated from measurement data within the framework of computational learning theory.
  • E. Shor
    Shor is a Turkic language spoken primarily by the Shor people in southwestern Siberia, Russia.
  • F. None of above. chosen
  • G. Unsure - the case is ambiguous/there is not enough information to decide.
NEDg Description generation gpt-5.1
Instruction
Generate a one-sentence description of the target entity. 
You are given a context triple in the form (subject, predicate, object), where the object is the target entity. 
# Instructions
Use the triple to infer relevant information about the entity. Describe the entity based on what is most defining, well-known. 
Avoid repeating the information from the triple, unless really essential.
# Response Format
Return only the sentence: "Description: [one-sentence description of the target entity]"
Input
Entity: Grover’s algorithm
Triple: [Deutsch–Jozsa algorithm, relatedTo, Grover’s algorithm]
Generated description
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.
NED2 Entity disambiguation (via description) gpt-5-mini-2025-08-07
Target entity: Grover’s algorithm
Target entity description: 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.
  • A. 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.
  • B. 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.
  • C. Bennett–Brassard 1984 protocol
    The Bennett–Brassard 1984 protocol is the first quantum key distribution scheme, using quantum properties of photons to enable two parties to establish a shared secret key with security guaranteed by the laws of quantum mechanics.
  • D. The Learnability of Quantum States
    "The Learnability of Quantum States" is a research paper by Scott Aaronson that investigates under what conditions quantum states can be efficiently learned or approximated from measurement data within the framework of computational learning theory.
  • E. Shor
    Shor is a Turkic language spoken primarily by the Shor people in southwestern Siberia, Russia.
  • F. None of above. chosen

Provenance (5 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.
NEDg Description generation batch_69fe66a5f3a88190827c6c9247323153 completed May 8, 2026, 10:41 p.m.
NED2 Entity disambiguation (via description) batch_69fe6736ff34819098524e4401a414aa completed May 8, 2026, 10:44 p.m.
Created at: April 10, 2026, 1:54 a.m.