Synthesis of reversible logic circuits

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems

Volumn 22, Issue 6, 2003, Pages 710-722

  Shende, Vivek V ^a   Prasad, Aditya K ^a,b   Markov, Igor L ^a   Hayes, John P ^a  

^a UNIVERSITY OF MICHIGAN   (United States)

^b Cerner Corporation   (United States)

Author keywords

Circuit optimization; Combinational logic circuits; Logic synthesis; Quantum computing; Reversible circuits

Indexed keywords

ALGORITHMS; COMBINATORIAL CIRCUITS; COMPUTATIONAL METHODS; OPTIMIZATION;

QUANTUM COMPUTING;

COMPUTER AIDED LOGIC DESIGN;

EID: 0038718548     PISSN: 02780070     EISSN: None     Source Type: Journal    
DOI: 10.1109/TCAD.2003.811448     Document Type: Conference Paper

References (22)

1. A. Barenco et al., "Elementary gates for quantum computation," Phys. Rev. A, vol. 52, pp. 3457-3467, 1995.
2. C. Bennett, "Logical reversibility of computation," IBM J. Res. Develop., vol. 17, pp. 525-532, 1973.
3. T. Beth and M. Rötteler, "Quantum algorithms: applicable algebra and quantum physics," Springer Tracts Mod. Physics, vol. 173, pp. 50-96, 2001.
4. S. Bettelli, L. Serafini, and T. Calarco. (2001, Nov.) Toward an architecture for quantum programming. [Online] Available: http://arxiv.org/abs/cs.PL/0 103 009
5. A. De Vos et al., "Generating the group of reversible logic gates," J. Physics A: Math. Gen., vol. 35, pp. 7063-7078, 2002.
6. K. Grover, "A framework for fast quantum mechanical algorithms," in Proc. Symp. Theory Comput., 1998.
7. R. Feynman, "Quantum mechanical computers," Optics News, vol. 11, pp. 11-20, 1985.
8. K. Iwama et al., "Transformation rules for designing CNOT-based quantum circuits," in Proc. Design Automation Conf., 2002, pp. 419-425.
9. P. Kerntopf, "A comparison of logical efficiency of reversible and conventional gates," Int. Workshop Logic Synthesis, pp. 261-269, 2000.
10. R. Korf, "Artificial intelligence search algorithms," in Algorithms Theory Computation Handbook. Boca Raton, FL: CRC Press, 1999.
11. E. Lawler, "An approach to multilevel Boolean minimization," J. Assoc. Comput. Mach., vol. 11, pp. 283-295, 1964.
12. J. Lawler et al.. A practical method of constructing quantum combinational logic circuits. [Online] Available: http://arxiv.org/abs/cs.PL/9 911 053
13. J. P. McGregor and R. B. Lee, "Architectural enhancements for fast subword permutations with repetitions in cryptographic applications," in Proc. Int. Conf. Comput. Design, 2001, pp. 453-461.
14. M. Nielsen and I. Chuang, Quantum Computation Quantum Information. Cambridge, U.K.: Cambridge Univ. Press, 2000.
15. M. Perkowski et al., "A general decomposition for reversible logic," in Proc. Reed-Muller Workshop, Aug. 2001.
16. T. Sasao and K. Kinoshita, "Conservative logic elements and their universality," IEEE Trans. Comput., vol. 28, pp. 682-685, 1979.
17. T. Silke. (1995, Dec.) PROBLEM: Register swap, [Online] Available: http://www.mathematik.uni-bielefeld.de
18. Z. Shi and R. Lee, "Bit permutation instructions for accelerating software cryptography," in Proc. IEEE Int. Conf. Applic.-Spec. Syst. Architectures, Process., 2000, pp. 138-148.
19. L. Storme et al., "Group theoretical aspects of reversible logic gates," J. Universal Comput. Sci., vol. 5, pp. 307-321, 1999.
20. T. Toffoli, "Reversible Computing," Lab. for Computer Science, Mass. Inst. of Technol., Cambridge, MA, Tech. Memo. MIT/LCS/TM-151, 1980.
21. B.C. Travaglione, M.A. Nielsen, H.M. Wiseman, and A. Ambainis. (2001) ROM-based computation: Quantum versus classical. Phys. Rev. A [Online] Available: http://xxx.lan1.gov/abs/quant-ph/0109016
22. S. Younis and T. Knight, "Asymptotically zero energy split-level charge recovery logic," in Proc. Workshop Low-Power Design, 1994.