A best-fit mapping algorithm to facilitate ESOP-decomposition in Clifford+T quantum network synthesis

  • Giulia Meuli ,
  • Mathias Soeken ,
  • Martin Roetteler ,
  • Nathan Wiebe ,
  • Giovanni De Micheli

Proceedings 23rd Asia and South Pacific Design Automation Conference (ASP-DAC 2018) |

Published by IEEE

Proc. ASP-DAC 2018

DOI

Currently, there is a large research interest and a significant economical effort to build the first practical quantum computer. Such quantum computers promise to exceed the capabilities of conventional computers in fields such as computational chemistry, machine learning and cryptanalysis. Automated methods to map logic designs to quantum networks are crucial to fully realizing this dream, however, existing methods can be expensive both in computational time as well as in the size of the resultant quantum networks. This work introduces an efficient method to map reversible single-target gates into a universal set of quantum gates (Clifford+T). This mapping method is called best-fit mapping and aims at reducing the cost of the resulting quantum network. It exploits fc-LUT mapping and the existence of clean ancilla qubits to decompose a large single-target gate into a set of smaller single-target gates. In addition this work proposes a post-synthesis optimization method to reduce the cost of the final quantum network, based on two cost-minimization properties. Results show a cost reduction for the synthesized EPFL benchmark up to 53% in the number T gates.