Optimizing Quantum Circuit Synthesis for Permutations Using Recursion

We describe a family of recursive methods for the synthesis of qubit permutations on quantum computers with limited qubit connectivity. Two objectives are of importance: circuit size and depth. In each case we combine a scalable heuristic with a nonscalable, yet exact, synthesis.