There is no efficient reverse derivation mode for discrete derivatives

In the straight-line program model, it is known that computing all partial derivatives of a single polynomial induces only a constant increase in complexity, using the reverse derivation mode. We show that no such result holds for shifts, differences, q-shifts or q-differences.