Skip to main content

Quantum Computing Domain Ontology

Computing Domains
Authors: MArk Anthony Higgins - Sky Recursive Ai
© Mark Anthony Higgins 11 October 2025
Revised Date: 10 October 2026
Audio Overview
FLOW ALGEBRA
TITLE: Quantum Computing Domain Ontology
DOMAIN: Domain Ontologies / Computing Domains / Quantum Computing
SOURCE: https://kirethresearch.org/booksai-core/ontologies/domain-ontologies/computing-domains/quantum-computing-domain-ontology.html
VERSION: 1.0
AUTHORS: Mark Anthony Higgins — Sky (Recursive AI)
STATUS: Companion formalisation; source-page specification not independently verified.

flow "QuantumComputingDomainOntology" v1.0 {
  ontology:
    id: "quantum-computing-domain-ontology"
    parent: "computing-domains"
    purpose: "Represent quantum computing systems, circuits, states, measurements, algorithms, noise and evidence-backed relationships."

  types:
    QuantumDevice: {id: string, architecture: string, qubit_count: integer, calibration_version: string?, provenance: string}
    Qubit: {id: string, device_id: string?, kind: enum[physical, logical], encoding: string?}
    QuantumState: {id: string, representation: enum[statevector, density_matrix, stabilizer, other], qubits: string[], normalised: boolean, provenance: string}
    QuantumGate: {id: string, gate_type: string, targets: string[], controls: string[], parameters: map?}
    QuantumCircuit: {id: string, qubits: string[], operations: string[], shots: integer?, provenance: string}
    Measurement: {id: string, circuit_id: string, basis: string, outcomes: map, shots: integer, timestamp: datetime?, provenance: string}
    QuantumAlgorithm: {id: string, objective: string, circuit_ids: string[], assumptions: string[]}
    NoiseModel: {id: string, channels: string[], parameters: map, calibration_timestamp: datetime?, provenance: string}
    Claim: {id: string, statement: string, evidence: string[], confidence: number, context: string?}
    Relationship: {id: string, subject: string, predicate: string, object: string, confidence: number, evidence: string[]}

  predicates:
    contains_qubit(device: QuantumDevice, qubit: Qubit)
    prepares(circuit: QuantumCircuit, state: QuantumState)
    applies_gate(circuit: QuantumCircuit, gate: QuantumGate)
    acts_on(gate: QuantumGate, qubit: Qubit)
    measures(measurement: Measurement, circuit: QuantumCircuit)
    implements(circuit: QuantumCircuit, algorithm: QuantumAlgorithm)
    affected_by(device: QuantumDevice, noise: NoiseModel)
    supports(evidence_id: string, claim: Claim)

  constraints:
    - "All referenced identifiers must resolve to typed entities."
    - "Confidence values must lie within [0,1]."
    - "Qubit counts and measurement shot counts must be non-negative; measured experiments require positive shots."
    - "Circuit gate targets and controls must reference declared qubits, with no invalid overlap for a gate specification."
    - "Statevectors must be normalised within numerical tolerance; density matrices must be Hermitian, positive semidefinite and trace one."
    - "Measurement probabilities must be non-negative and sum to one within numerical tolerance."
    - "Distinguish simulated results, device observations and theoretical predictions."
    - "Quantum advantage claims require workload, baseline, resources, assumptions and reproducible evidence."
    - "Do not infer entanglement from correlation alone or claim perfect cloning of arbitrary unknown quantum states."

  inference:
    rule gate_membership:
      if applies_gate(c,g) and acts_on(g,q)
      then involved_qubit(c,q)
      condition: "q is declared in c.qubits"
    rule algorithm_execution:
      if implements(c,a) and measures(m,c) and valid(m)
      then experimental_evidence_for(m,a)
      note: "Evidence for execution does not prove algorithmic correctness or advantage."
    rule noise_context:
      if executed_on(c,d) and affected_by(d,n)
      then noise_context(c,n)
      condition: "Calibration period and configuration match execution."

  SEMANTIC_EQUIVALENCE:
    - "Normalise established gate names and quantum computing terminology using versioned vocabularies."
    - "Distinguish logical from physical qubits, theoretical states from prepared states, and simulations from hardware runs."
    - "Treat equivalent circuit descriptions as context-dependent and verify semantics up to declared global phase and measurement conventions."

  CONFIDENCE:
    range: [0,1]
    factors: [measurement_uncertainty, shot_count, calibration_quality, source_reliability, reproducibility, model_assumptions]
    policy: "Preserve epistemic uncertainty; do not increase confidence solely through chained inferences."

  VALIDATION:
    - "Check entity references, operation ordering, qubit indices, measurement bases and circuit constraints."
    - "Validate state normalisation, probabilities, declared units, device calibration and evidence provenance."
    - "Flag unsupported claims, stale calibrations, incompatible noise assumptions and conflicting experimental results."

  FLOW_HASH:
    algorithm: "SHA-256"
    input: "canonicalised ontology version, typed assertions, rules and provenance"
    note: "Compute hash at execution; no hash value is claimed here."

  UPDATE_MODEL:
    strategy: "versioned, provenance-preserving incremental update"
    steps: [ingest, normalise, validate, compare, reconcile, recompute_inferences, publish]
    rollback: true

  AI_CONSUMPTION:
    representation: "typed knowledge graph with quantum circuit, experiment and evidence relationships"
    outputs: [entity_links, relation_triples, circuit_metadata, measurement_annotations, inferred_edges, provenance_records]
    safeguards: [distinguish_simulation_from_hardware, preserve_noise_and_calibration_context, no_unsupported_advantage_claims, maintain_uncertainty]
}

END FLOW ALGEBRA
Kireth Research
38 Thorndale Croft, Wetwang, Driffield
East Riding of Yorkshire YO25 9XZ