Definition: Complete finite network

A complete network is a finite directed acyclic circuit of CPTP maps, including:

• quantum and classical carrier ports and identity wires;

• fixed independent ancillary preparations;

• gates, storage, allocations, resets, and discards;

• destructive measurements and all retained outcomes;

• every controller variable read to choose a gate, guard, route, reset, or availability time;

• the encoder and decoder, with their actual support.

A finite adaptive instruction tree is padded to a finite common envelope containing every branch and its selecting controls. There is no hidden state-functional scheduler.