Typed oracles and generic algorithms

Purpose and scope

Distinguishes oracle types and compile-time specialized algorithms from ordinary circuit names. Phase/XOR behavior, verification conditions and auxiliary-qubit ownership become visible source contracts.

Core design rules

• PhaseOracle<N> and XorOracle<N,M> express different effects; silently coercing one into the other is not accepted.
• Generic source is lowered to a concrete circuit before execution while retaining source and specialization provenance.
• Tier A/Tier B verification, clean auxiliary-resource conditions and algorithm preconditions are checked separately.

Example from the original

This example illustrates the design recorded in the original. It is not by itself a claim of executable or stable support; check required options and the current version.

xor_oracle parity_101(x: QReg<3>, out: QReg<1>) {
  CNOT(x[0], out[0]);
  CNOT(x[2], out[0]);
}

Limits and interpretation

• Generic Grover support does not imply generic Simon, QPE or Shor support.
• Qubit, expansion and verification budgets remain bounded; an oracle type is not scalability or hardware-advantage evidence.

Status and implementation boundary

The original records both proposed status and an experimental reference implementation. An implementation record is not promotion to a stable feature; check the capability center for current availability.