As I read the introduction of both the linked article and the cited paper, the result is mostly of importance to complexity theory, and the intention is not to actually apply this procedure to actual quantum algorithms.

For quantum complexity theory, the result is significant, as it shows that there is no need to distinguish between algorithms with and without intermediate measurement when comparing complexity.