Efficient compiling of quantum programs using experimentally demonstrated global gates

While most quantum programs are compiled using single- and two-qubit gates, some quantum computers support parallel, global gates. Indeed, it has been experimentally demonstrated that such global instructions can be implemented with little additional complication over that required to implement a single two-qubit gate. In this talk, I will briefly discuss how one can implement such a global native gate at a high level. I will then use it to enable efficient quantum program compilation, for a large class of oft-used unitary operators. Included are (i) n-qubit Clifford operations and (ii) multiply-controlled gates, implemented using a constant or effectively-constant number of global gates. An overview of previous results will be provided to highlight the striking advantage afforded by the compilation techniques.