Data structures and algorithms for simplifying reversible circuits

ACM Journal on Emerging Technologies in Computing Systems

Volumn 2, Issue 4, 2006, Pages 277-293

  Prasad, Aditya K ^a   Shende, Vivek V ^b,d   Markov, Igor L ^b,d   Hayes, John P ^b,d   Patel, Ketan N ^c  

^a AMAZON   (United States)

^b UNIVERSITY OF MICHIGAN   (United States)

^c QUALCOMM INC   (United States)

^d University of Michigan   (United States)

Author keywords

Circuit libraries; Circuit simplification; Optimal subcircuit

Indexed keywords

CIRCUIT LIBRARIES; QUANTUM CIRCUITS;

ALGORITHMS; BINARY CODES; DIGITAL INTEGRATED CIRCUITS; FORMAL LOGIC; OPTIMIZATION;

DATA STRUCTURES;

EID: 33846695384     PISSN: 15504832     EISSN: 15504840     Source Type: Journal    
DOI: 10.1145/1216396.1216399     Document Type: Article

References (25)

1. AGRAWAL, A. AND JHA, N. K. 2004. Synthesis of reversible logic. In Proceedings of the Design, Automation and Test in Europe Conference and Exhibition. 1384-1385.
2. BARENCO, A., BENNETT, C. H., CLEVE, R., Di VINCENZO, D. P., MARGOLUS, N., SHOR, P., SLEATOR, T., SMOLIN, J., AND WEINFURTER, H. 1995. Elementary gates for quantum computation. Phys. Rev. A 52, 3457-3467.
3. BENNETT, C. 1973. Logical reversibility of computation. IBM J. Res. Develop. 17, 525-532.
4. CONG, J., ROMESIS, M., AND XIE, M. 2003. Optimality, scalability and stability study of partitioning and placement algorithms. In Proceedings of the International Symposium on Physical Design. 88-94.
5. CORMEN, T., LEISERSON, C. E., RIVEST, R. L., AND STEIN, C. 2001. Introduction to Algorithms, 2nd ed., MIT Press, Cambridge, MA.
6. DARNAUER, J. A. AND DAI, W. W. 1996. A method for generating random circuits and its application to routability measurement. In Proceedings of the International Symposium of FPGAs. 66-72.
7. DARNAUER, J. A., BRAND, D., GERBI, J. V., JOYNER JR., W. H., AND TREVILLYAN, L. 1984. LSS: A system for production logic synthesis. IBM J. Res.Develop. 28, 5(Sept.), 537-545.
8. DESOETE, B. AND DE Vos, A. 2002. A reversible carry-look-ahead adder using control gates. Integr. 33, 89-104.
9. DE Vos, A., RAA, B., AND STORME, L. 2002. Generating the group of reversible logic gates. J. Phys. A 35, 7063-7078.
10. FEYNMAN, R. 1985. Quantum mechanical computers. Optics News, 11, 11-20.
11. GROVER, L. K. 1998. A framework for fast quantum mechanical algorithms. In Proceedings of the 30th Annual ACM Symposium on the Theory of Computing.
12. IWAMA, K., KAMBAYASHI, Y., AND YAMASHITA, S. 2002. Transformation rules for designing CNOT-based quantum circuits. In Proceedings of the 39th Conference on Design Automation. 419-425.
13. KERNTOPF, P. 2004. A new heuristic algorithm for reversible logic synthesis. In Proceedings of the Conference on Design Automation. 834-837.
14. MACWILLIAMS, F. J. AND SLOANE, N. J. A. 1977. The Theory of Error-Correcting Codes. North-Holland, Amsterdam.
15. MASLOV, D., DUECK, D., AND MILLER, D. M. 2003a. Simplification of Toffoli networks via templates. In Proceedings of the Symposium on Integrated Circuits and System Design (Sao Paulo, Brazil). 53-58.
16. MASLOV, D., DUECK, D., AND MILLER, D. M. 2003b. Fredkin/Toffoli templates for reversible logic synthesis. In Proceedings of the International Conference on Computer Aided Design. 256-261.
17. MCGREGOR, J. P. AND LEE, R. B. 2001. Architectural enhancements for fast subword permutations with repetitions in cryptographic applications. In Proceedings of the IEEE International Conference on Computer Design 453-461.
18. MCKEEMAN, W. 1965. Peephole optimization. ACM8, 443-444.
19. MILLER, D.M., MASLOV, D., AND DUECK, G. W. 2003. A transformation based algorithm for reversible logic synthesis. In Proceedings of the 40th Conference on Design Automation. 318-323.
20. NIELSEN, M. AND CHUANG, I. 2000. Quantum Computation and Quantum Information, Cambridge University Press, New York.
21. SHENDE, V. V., PRASAD, A. K., MARKOV, I. L., AND HAYES, J. P. 2003. Synthesis of reversible logic circuits. IEEE Trans. Comput. Aided Des., 710-722.
22. STROOBANDT, D., VERPLAETSE, P., AND VAN CAMPENHOUT, J. 1999. Towards synthetic benchmark circuits for evaluating timing-driven CAD tools. In Proceedings of the International Symposium on Physical Sesign. 60-66.
23. TOFFOLI, T. 1980. Reversible computing. Tech. Memo MIT/LCS/TM-151, MIT Laboratory for Computer Science.
24. YOUNIS, S. AND KNIGHT, T. 1994. Asymptotically zero energy split-level charge recovery logic. In Proceedings of the Workshop on Low Power Design.
25. ZHIRNOV, V. V., CAVIN, R. K., HUTCHBY, J. A., AND BOURIANOFF, G. I. 2003. Limits to binary logic switch scaling - A Gedanken model. In Proc. IEEE 91, 1934-1939.