Recursive Methods for Synthesizing Permutations on Limited-Connectivity Quantum Computers [article]

Cynthia Chen, Bruno Schmitt, Helena Zhang, Lev S. Bishop, Ali Javadi-Abhari
2022 arXiv   pre-print
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 non-scalable, yet exact, synthesis. Our algorithms are applicable to generic connectivity constraints, scale favorably, and achieve close-to-optimal performance in many cases. We demonstrate the utility of these algorithms by optimizing the compilation
more » ... f Quantum Volume circuits, and to disprove an old conjecture on reversals being the hardest permutation on a path.
arXiv:2207.06199v1 fatcat:wgzrh6b6avd6hndsbprpemz7e4