Bi-directionalsynthesis of 4-bit reversible circuits

Computer Journal

Volumn 51, Issue 2, 2008, Pages 207-215

  Yang, Guowu ^a   Song, Xiaoyu ^b   Hung, William N N ^b,c   Perkowski, Marek A ^b  

^a UNIVERSITY OF ELECTRONIC SCIENCE AND TECHNOLOGY OF CHINA   (China)

^b Department of Electrical and Computer Engineering   (United States)

^c Synplicity Inc   (United States)

Author keywords

Algorithm; Minimization; Quantum circuits; Reversible logic

Indexed keywords

ALGORITHMS; FORMAL LOGIC; OPTIMIZATION; QUANTUM COMPUTERS; RANDOM PROCESSES;

BI-DIRECTIONAL SYNTHESIS; QUANTUM CIRCUITS; QUANTUM COMPUTING; REVERSIBLE LOGIC;

COMPUTER CIRCUITS;

EID: 44849109247     PISSN: 00104620     EISSN: 14602067     Source Type: Journal    
DOI: 10.1093/comjnl/bxm042     Document Type: Article

References (19)

1. Toffoli, T. (1980) Reversible computing. Technical Report MIT/LCS/ TM-151. MIT Lab for Computer Science.
2. Song, X., Yang, G., Perkowski, M. and Wang, Y. (2006) Algebraic characterization of reversible logic gates. Theory Comput. Syst., 39, 311-319.
3. De Vos, A., Raa, B. and Storme, L. (2002) Generating the group of reversible logic gates. J. Phy. A: Math. Gen., 35, 7063-7078.
4. Perkowski, M., Lukac, M., Pivtoraiko, M., Kerntopf, P. and Folgheraiter, M. (2003) A hierarchical approach to computer aided design of quantum circuits. Proc. sixth Int. Symp. Representations and Methodology of Future Computing Technology (RM2003), Trier, Germany.
5. Bullock, S.S. and Markov, I.L. (2003) An arbitrary two-qubit computation in 23 elementary gates. Proc. Design Automation Conf., Anaheim, CA, pp. 324-329. ACM/IEEE.
6. Miller, D.M., Maslov, D. and Dueck, G.W. (2003) A transformation based algorithm for reversible logic synthesis. Proc. Design Automation Conf., Anaheim, CA, pp. 318-323. ACM/IEEE.
7. Yang, G., Hung, W.N.N., Song, X. and Perkowski, M. (2005) Majority-based reversible logic gates. Theor. Comput. Sci., 334, 295-274.
8. Shende, V.V., Prasad, A.K., Markov, I.L. and Hayes, J.P. (2003) Synthesis of reversible logic gates. IEEE Trans. CAD, 22, 710-722.
9. Yang, G., Song, X., Hung, W.N.N. and Perkowski, M. (2005) Fast synthesis of exact minimal reversible circuits using group theory. Asia and South Pacific Design Automation Conf. (ASP-DAC), Shanghai, China, pp. 1002-1005. ACM/IEEE.
10. Schönert, M. et al. (1995) GAP - Groups, Algorithms, and Programming (5th edn). Lehrstuhl, D and für, Mathematik Rheinisch Westfälische Technische Hoch-schule. Aachen, Germany.
11. Storme, L., De Vos, A. and Jacobs, G. (1999) Group theoretical aspects of reversible logic gates. J. Univers. Comput. Sci., 5, 307-321.
12. Korf, R. (1999) Artificial intelligence search algorithms. Algorithms and Theory of Computation Handbook. CRC Press, Boca Raton, FL.
13. Dixon, J.D. and Mortimer, B. (1996) Permutation Groups. Springer, New York.
14. Hung, W.N.N., Song, X., Yang, G., Yang, J. and Perkowski, M. (2006) Optimal synthesis of multiple output boolean functions using a set of quantum gates by symbolic reachability analysis. IEEE Trans. Comput. Aided Des., 25, 1652-1663.
15. Alder, H.L. and Roessler, E.B. (1972) Introduction to Probability and Statistics. W.H. Freeman and Company, San Francisco.
16. Bailey, D.E. (1971) Probability and Statistics. John Weily and Sons Inc., New York, London.
17. Maslov, D., Young, C., Miller, D.M. and Dueck, G.W. (2005) Quantum circuit simplification using templates. Design Automation and Test in Europe (DATE), Munich, Germany, pp. 1208-1213. IEEE.
18. Maslov, D., Miller, D.M. and Dueck, G.W. (2006). Techniques for the synthesis of reversible toffoli networks. eprint arXiv:qUant-ph/0607166.
19. Hung, W.N.N., Song, X., Yang, G., Yang, J. and Perkowski, M. (2004) Quantum logic synthesis by symbolic reachability analysis. Proc. Design Automation Conf., San Diego, CA, pp. 838-841. ACM/IEEE.