Data structures and algorithms for simplifying reversible circuits

Reversible logic is motivated by low-power design, quantum circuits, and nanotechnology. We develop a compact representation of small reversible circuits to generate and store optimal circuits for all 40,320 three-input reversible functions, and millions of four-input circuits. This allows implementing a function optimally in constant time for use in the peephole optimization of larger circuits produced by existing techniques, and guarantees that every three-bit subcircuit is optimal. To generate subcircuits, we use a graph-based data structure and algorithms for circuit restructuring. Finally, we demonstrate a suboptimal circuit for which peephole optimization fails.

[1]  Barenco,et al.  Elementary gates for quantum computation. , 1995, Physical review. A, Atomic, molecular, and optical physics.

[2]  Clifford Stein,et al.  Introduction to Algorithms, 2nd edition. , 2001 .

[3]  Louise Trevillyan,et al.  LSS: A system for production logic synthesis , 1984, IBM J. Res. Dev..

[4]  Birger Raa,et al.  INSTITUTE OF PHYSICS PUBLISHING JOURNAL OF PHYSICS A: MATHEMATICAL AND GENERAL J. Phys. A: Math. Gen. 35 (2002) 7063–7078 PII: S0305-4470(02)34943-6 Generating the group of reversible logic gates , 2022 .

[5]  Gerhard W. Dueck,et al.  A transformation based algorithm for reversible logic synthesis , 2003, Proceedings 2003. Design Automation Conference (IEEE Cat. No.03CH37451).

[6]  Pawel Kerntopf,et al.  A new heuristic algorithm for reversible logic synthesis , 2004, Proceedings. 41st Design Automation Conference, 2004..

[7]  W. M. McKeeman,et al.  Peephole optimization , 1965, CACM.

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

[9]  Alexis De Vos,et al.  A reversible carry-look-ahead adder using control gates , 2002, Integr..

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

[11]  Jason Cong,et al.  Optimality, scalability and stability study of partitioning and placement algorithms , 2003, ISPD '03.

[12]  Louise Trevillyan,et al.  LSS: A system for production logic synthesis , 1984, IBM Journal of Research and Development.

[13]  John P. Hayes,et al.  Synthesis of reversible logic circuits , 2003, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

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

[15]  Thomas H. Cormen,et al.  Introduction to algorithms [2nd ed.] , 2001 .

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

[17]  Ruby B. Lee,et al.  Architectural enhancements for fast subword permutations with repetitions in cryptographic applications , 2001, Proceedings 2001 IEEE International Conference on Computer Design: VLSI in Computers and Processors. ICCD 2001.

[18]  S. Lloyd.  Quantum-Mechanical Computers , 1995 .

[19]  Gerhard W. Dueck,et al.  Fredkin/Toffoli Templates for Reversible Logic Synthesis , 2003, ICCAD 2003.

[20]  James A. Hutchby,et al.  Limits to binary logic switch scaling - a gedanken model , 2003, Proc. IEEE.

[21]  F. MacWilliams,et al.  The Theory of Error-Correcting Codes , 1977 .

[22]  Gerhard W. Dueck,et al.  Simplification of Toffoli networks via templates , 2003, 16th Symposium on Integrated Circuits and Systems Design, 2003. SBCCI 2003. Proceedings..

[23]  Wayne Wei-Ming Dai,et al.  A Method for Generation Random Circuits and Its Application to Routability Measurement , 1996, Fourth International ACM Symposium on Field-Programmable Gate Arrays.

[24]  Jan M. Van Campenhout,et al.  Towards synthetic benchmark circuits for evaluating timing-driven CAD tools , 1999, ISPD '99.

[25]  O. Antoine,et al.  Theory of Error-correcting Codes , 2022 .

[26]  Yahiko Kambayashi,et al.  Transformation rules for designing CNOT-based quantum circuits , 2002, DAC '02.

[27]  Thomas F. Knight,et al.  Asymptotically Zero Energy Split-Level Charge Recovery Logic , 1994 .

[28]  Lov K. Grover.  A framework for fast quantum mechanical algorithms , 1997, STOC '98.