Triple

T17028125
Position Surface form Disambiguated ID Type / Status
Subject Bennett's logical reversibility E413119 entity
Predicate relatedTo P37 FINISHED
Object Toffoli gate
The Toffoli gate is a universal reversible logic gate that extends the controlled-NOT operation to three bits, enabling reversible and quantum computation.
E1246817 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: Toffoli gate | Statement: [Bennett's logical reversibility, relatedTo, Toffoli gate]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07
Target entity: Toffoli gate
Context triple: [Bennett's logical reversibility, relatedTo, Toffoli gate]
  • A. Hadamard gate
    The Hadamard gate is a fundamental single-qubit quantum logic gate that creates equal superpositions of basis states and is widely used in many quantum algorithms.
  • B. 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.
  • C. 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.
  • D. 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.
  • E. Cubitt
    Cubitt is an English surname most notably associated with a prominent 19th-century family of architects and builders, including Lewis Cubitt.
  • 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: Toffoli gate
Triple: [Bennett's logical reversibility, relatedTo, Toffoli gate]
Generated description
The Toffoli gate is a universal reversible logic gate that extends the controlled-NOT operation to three bits, enabling reversible and quantum computation.
NED2 Entity disambiguation (via description) gpt-5-mini-2025-08-07
Target entity: Toffoli gate
Target entity description: The Toffoli gate is a universal reversible logic gate that extends the controlled-NOT operation to three bits, enabling reversible and quantum computation.
  • A. Hadamard gate
    The Hadamard gate is a fundamental single-qubit quantum logic gate that creates equal superpositions of basis states and is widely used in many quantum algorithms.
  • B. 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.
  • C. 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.
  • D. 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.
  • E. Cubitt
    Cubitt is an English surname most notably associated with a prominent 19th-century family of architects and builders, including Lewis Cubitt.
  • 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_69d886cc4170819093deddc7b8b4b6a7 completed April 10, 2026, 5:12 a.m.
NER Named-entity recognition batch_69e3d5d728148190b83367cd6fdefa50 completed April 18, 2026, 7:04 p.m.
NED1 Entity disambiguation (via context triple) batch_6a011b553c588190b46785b85142dce5 completed May 10, 2026, 11:57 p.m.
NEDg Description generation batch_6a011d2651e88190b6a57fa11e29bb21 completed May 11, 2026, 12:04 a.m.
NED2 Entity disambiguation (via description) batch_6a011d99a038819086924a1b2af55967 completed May 11, 2026, 12:06 a.m.
Created at: April 10, 2026, 5:33 a.m.