Optimizing Quantum Circuit Synthesis for Permutations using Recursive Methods
TimeTuesday, July 12th10:53am - 11:15am PDT
Location3005, Level 3
Event Type
Research Manuscript
Quantum Computing
DescriptionQuantum compilers take a high-level description of a program and make it amenable for execution on a quantum hardware. A key limitation of many QC technologies is that all-to-all qubit connectivities are not attainable. The compiler therefore "permutes" qubits between layers of computation in order to allow execution of gates between non-adjacent qubits. Optimal synthesis of such permutations for arbitrary underlying topologies is an NP-hard problem.
Here we describe hybrid strategies that combine effective heuristics with small-scale exact solutions, improving upon previously best-known algorithms for both circuit size and circuit depth.