An efficient method for improving the performance of quantum boolean circuit synthesis algorithms

So far there are no synthesis algorithms that can find all the optimal quantum boolean circuits except an exhaustive algorithm. In this paper, we propose a method based on the divide and conquer approach which can significantly improve the performance of the existing synthesis algorithms to synthesize quantum boolean circuits. A quantum boolean circuit is first divided into two subcircuits. The subcircuit with fewer gates will input all possible combinations of m gates excluding those with the same function specification. The other subcircuit can be synthesized by using the existing algorithm. The two subcircuits are combined and then we can choose the most simplified quantum boolean circuit. According to the experimental results of all the 3-variable functions, we can see that the performance of the existing algorithms can be significantly improved by using our method. Therefore the synthesized quantum boolean circuits are much more simplified than previous results.

[1]  Charles H. Bennett,et al.  Logical reversibility of computation , 1973 .

[2]  Niraj K. Jha,et al.  Synthesis of reversible logic , 2004, Proceedings Design, Automation and Test in Europe Conference and Exhibition.

[3]  Alan Mishchenko,et al.  Logic Synthesis of Reversible Wave Cascades , 2002, IWLS.

[4]  Thierry Paul,et al.  Quantum computation and quantum information , 2007, Mathematical Structures in Computer Science.

[5]  Lov K. Grover.  A fast quantum mechanical algorithm for database search , 1996, STOC '96.

[6]  John P. Hayes,et al.  Reversible logic circuit synthesis , 2002, IWLS.

[7]  Peter W. Shor,et al.  Algorithms for quantum computation: discrete logarithms and factoring , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

[8]  R. Landauer,et al.  Irreversibility and heat generation in the computing process , 1961, IBM J. Res. Dev..

[9]  George K. Papakonstantinou,et al.  Minimization of Reversible Wave Cascades , 2005, IEICE Trans. Fundam. Electron. Commun. Comput. Sci..

[10]  Sy-Yen Kuo,et al.  Modified Karnaugh map for quantum Boolean circuits construction , 2003, 2003 Third IEEE Conference on Nanotechnology, 2003. IEEE-NANO 2003..

[11]  Tommaso Toffoli,et al.  Reversible Computing , 1980, ICALP.

[12]  Gerhard W. Dueck,et al.  Techniques for the synthesis of reversible Toffoli networks , 2006, TODE.