From Boolean Functions to Quantum Circuits: A Scalable Quantum Compilation Flow in C++
Bruno Schmitt, Fereshte Mozafari, Giulia Meuli, Heinz Riener and Giovanni De Micheli
Integrated Systems Laboratory (LSI), EPFL, Switzerland
ABSTRACT
We propose a flow for automated quantum compilation. Our flow takes a Boolean function implemented in Python as input and translates it into a format appropriate for reversible logic synthesis. We focus on two quantum compilation tasks: uniform state preparation and oracle synthesis. To illustrate the use of our flow, we solve IBM’s virtual hackathon challenge of 2021, called the Zed city problem, an instance of vertex coloring, by using quantum search algorithms. The expressiveness of Python in combination with automated compilation algorithms allows us to express quantum algorithms at a high level of abstraction, which reduces the effort to implement them, and leads to better and more flexible implementations. We show that our proposed flow generates a lower-cost circuit implementation of the oracle needed to solve IBM’s challenge when compared to the winning submission.
Keywords: Quantum, Design Automation, Compilation, Reversible Logic Synthesis.
