Quantum Computing.
algorithms and this involves a series of NOT, controlled NOT and Toffoli gates though work has been done to make this part as efficient as possible. Even so this section of Shor’s algorithm is the slowest. Generally speaking one needs l³ gates to reproduce a classical algorithm with reversible