Paulihedral: A generalized block-wise compiler optimization framework for quantum simulation kernels

65Citations
Citations of this article
40Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The quantum simulation kernel is an important subroutine appearing as a very long gate sequence in many quantum programs. In this paper, we propose Paulihedral, a block-wise compiler framework that can deeply optimize this subroutine by exploiting high-level program structure and optimization opportunities. Paulihedral first employs a new Pauli intermediate representation that can maintain the high-level semantics and constraints in quantum simulation kernels. This naturally enables new large-scale optimizations that are hard to implement at the low gate-level. In particular, we propose two technology-independent instruction scheduling passes, and two technology-dependent code optimization passes which reconcile the circuit synthesis, gate cancellation, and qubit mapping stages of the compiler. Experimental results show that Paulihedral can outperform state-of-The-Art compiler infrastructures in a wide-range of applications on both near-Term superconducting quantum processors and future fault-Tolerant quantum computers.

Cite

CITATION STYLE

APA

Li, G., Wu, A., Shi, Y., Javadi-Abhari, A., Ding, Y., & Xie, Y. (2022). Paulihedral: A generalized block-wise compiler optimization framework for quantum simulation kernels. In International Conference on Architectural Support for Programming Languages and Operating Systems - ASPLOS (pp. 554–569). Association for Computing Machinery. https://doi.org/10.1145/3503222.3507715

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free