Reducing execution time of quantum algorithms by additional permutation gates

For a given quantum algorithm the time-optimal implementation is attained using the Cartan decomposition. We extend this approach and show that the execution time of a quantum algorithm can be further reduced by adding an extra gate to it. We apply this method to Grover's algorithm and show that the execution time is halved.