Definition: Scheduled ancestry

A complete dependency graph includes every quantum input, classical control, guard, routing decision, and retained record actually used by the protocol. For distinct operation events $p,q$, write $p{R}_{\mathrm{sch}}q$ if there is a directed dependency path from $p$ to $q$. Its reflexive closure is the scheduled event order.

An edge records an operation that the protocol calls. It does not assert that the operation is sensitive to every input it receives.