Compilation Flow for Classically Defined Quantum Operations
Bruno Schmitt1,2, Ali Javadi-Abhari3 and Giovanni De Micheli1
1Integrated Systems Laboratory (LSI), EPFL, Switzerland
2IBM Quantum, IBM Research, Switzerland
3IBM Quantum, IBM T.J. Watson Research Center, United States
ABSTRACT
We present a flow for synthesizing quantum operations that are defined by classical combinational functions. The discussion will focus on out-of-place computation, i.e., Uf : |x>|y>|0>k ↦ |x>|y ⊕ f(x)>|0>k. Our flow allows users to express this function at a high level of abstraction. At its core, there is an improved version of the current state-of-the-art algorithm for synthesizing oracles [1]. As a result, our synthesized circuits use up to 25% fewer qubits and up to 43% fewer Clifford gates. Crucially, these improvements are possible without increasing the number of T gates nor the execution time.
Keywords: Quantum, Design Automation, Compilation, Synthesis.
