A Best-Fit Mapping Algorithm to Facilitate ESOP-Decomposition in Clifford+T Quantum Network Synthesis

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+<i>T</i>). This mapping method is called best-fit mapping and aims at reducing the cost of the resulting quantum network. It exploits <i>k</i>-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 <i>T</I> gates.


Published in:
Proceedings of the 23rd Asia and South Pacific Design Automation Conference (ASP-DAC)
Presented at:
23rd Asia and South Pacific Design Automation Conference (ASP-DAC), Jeju Island, Korea, January 22-25, 2018
23rd Asia and South Pacific Design Automation Conference (ASP-DAC), Jeju Island, Korea, January 22-25, 2018
Year:
2018
Publisher:
IEEE
Laboratories:




 Record created 2018-01-09, last modified 2018-03-17

Fulltext:
Download fulltext
PDF

Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)