It is well-known that the Toffoli gate and the negation gate together yield a universal gate set, in the sense that every permutation of {0, 1}n can be implemented as a composition of these gates. Since every bit operation that does not use all of the bits performs an even permutation, we need to use at least one auxiliary bit to perform every permutation, and it is known that one bit is indeed...
