A general finite scheduling recurrence

Memory optimization for multi-step quantum strategies is an established subject; classical memory and global consistency matter Bisio. Our frontier recurrence instead optimizes named-register schedules of a fixed compiled decomposition. It does not identify this restricted quantity with the unrestricted memory cost of a quantum strategy.