An Efficient Algorithm to Synthesize Quantum Circuits and Optimization


Susam O., Altun M.

2014 21st IEEE International Conference on Electronics, Circuits and Systems (ICECS), Marseille, France, 7 - 10 December 2014, pp.570-573 identifier

  • Publication Type: Conference Paper / Full Text
  • City: Marseille
  • Country: France
  • Page Numbers: pp.570-573

Abstract

Quantum computers, more specifically quantum circuits, take on the eyes with their computational promises such as reversibility. In this paper, we perform synthesis and optimization of quantum circuits. In the first part, we propose a fast synthesis algorithm that implements any given reversible Boolean function with quantum gates. Instead of an exhaustive search on every given function, our algorithm creates a library of essential functions and performs sorting. As an example, to implement 4 bit circuits we only use 120 essential functions out of all 20922789888000 functions. In the second part, we optimize our circuits by using new templates. The proposed templates mainly consist of Toffoli gates with negative and positive controlling lines. These templates also show us that optimum area solutions proposed in the literature are not actually optimum; they can be improved.