## P.: ‘Data structures and algorithms for simplifying reversible circuits

Venue: | ACM Journal on Emerging Technologies in Computing Systems |

Citations: | 1 - 0 self |

### BibTeX

@ARTICLE{Prasad_p.:‘data,

author = {Aditya K. Prasad and Vivek V. Shende and Ketan N. Patel and Igor L. Markov and John P. Hayes},

title = {P.: ‘Data structures and algorithms for simplifying reversible circuits},

journal = {ACM Journal on Emerging Technologies in Computing Systems},

year = {}

}

### OpenURL

### Abstract

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 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.

### Citations

1941 | The theory of error-correcting codes - MacWilliams, Sloane - 1977 |

453 |
Logical reversibility of computation
- Bennett
- 1973
(Show Context)
Citation Context ...such problems arise include cryptography, digital signal processing, and communications [14, 20]. Irreversible circuits necessarily dissipate heat to compensate for the loss of information they incur =-=[3]-=-. Recent work from Intel [25] derives physical limits for irreversible computation by systems that use electrons and energy barriers to store and manipulate binary values. ∗ This work was supported by... |

220 |
Quantum mechanical computers
- Feynman
- 1986
(Show Context)
Citation Context ... is universal [22], and these gates appear often in quantum computation [19]. We draw NCT-circuits as arrays of horizontal lines representing wires, in which gates are represented by standard symbols =-=[9]-=-. The ⊕ symbols represent inverters and the • symbols represent controls. A vertical line connecting controls to an inverter means that an inversion is applied iff all control lines carry 1s. A sample... |

113 |
Physics and computation
- Toffoli
(Show Context)
Citation Context ...lementation of Grover’s quantum search algorithm uses many NCT (NOT, CNOT, and TOFFOLI) gates [19]. Hence, efficient synthesis with such gates is an important step toward quantum computation. Toffoli =-=[22]-=- showed that the NCT gate library is universal for the synthesis of reversible Boolean circuits. This has been recently extended to show that all even permutations can be synthesized with no temporary... |

84 | A framework for fast quantum mechanical algorithms. To appear - Grover - 1998 |

57 |
W.: ‘A Transformation Based Algorithm for Reversible Logic Synthesis
- Miller, Maslov, et al.
- 2003
(Show Context)
Citation Context ...eral minutes by dynamic programming [20]. This algorithm also synthesizes optimal fourbit circuits reasonably quickly, but does not scale much further. More scalable constructive synthesis algorithms =-=[18, 1, 12]-=- tend to produce suboptimal circuits even on three bits, which suggests iterative optimization based on local search. The work in [11] describes a small set of local transformation rules for NCT-circu... |

50 | Asymptotically zero energy split-level charge recovery logic
- Younis, Knight
- 1994
(Show Context)
Citation Context ...for all major circuit types and technologies by 2021. A potential solution is to recycle information and energy. To this end, reversible and asymptotically energy-lossless circuits have been proposed =-=[24]-=-, but their delay can be arbitrarily large. Independently, De Vos et al. have built several reversible circuits of up to 384 transistors, powered only by their input signals. Figure 1 shows one of the... |

44 | A Method for Generating Random CIrcuits and Its Application to Routability Measurement - Darnauer, Dai - 1996 |

32 |
Peephole optimization
- McKeeman
- 1965
(Show Context)
Citation Context ...data structures, this technique is very fast in practice. Unlike previous work, it does not leave out any suboptimal three-bit subcircuits. Analogy can be made with peephole optimization in compilers =-=[17]-=-, where only a few lines of code are optimized at a time. While such methods are well-known for simplifying irreversible circuits (e.g., the LSS system from IBM [7]), our approach can restructure a re... |

22 |
LSS: A system for production logic synthesis
- Darringer, Brand, et al.
- 1984
(Show Context)
Citation Context ...peephole optimization in compilers [17], where only a few lines of code are optimized at a time. While such methods are well-known for simplifying irreversible circuits (e.g., the LSS system from IBM =-=[7]-=-), our approach can restructure a reversible circuit on the fly in order to find larger reducible subcircuits. The remainder of the paper is structured as follows. The necessary background is given in... |

22 |
A new heuristic algorithm for reversible logic synthesis
- Kerntopf
- 2004
(Show Context)
Citation Context ...eral minutes by dynamic programming [20]. This algorithm also synthesizes optimal fourbit circuits reasonably quickly, but does not scale much further. More scalable constructive synthesis algorithms =-=[18, 1, 12]-=- tend to produce suboptimal circuits even on three bits, which suggests iterative optimization based on local search. The work in [11] describes a small set of local transformation rules for NCT-circu... |

21 | Architectural enhancements for fast subword permutations with repetitions in cryptographic applications
- McGregor, Lee
- 2001
(Show Context)
Citation Context ...present in the input must be conserved by the computation and be recoverable from the output. Some fields where such problems arise include cryptography, digital signal processing, and communications =-=[14, 20]-=-. Irreversible circuits necessarily dissipate heat to compensate for the loss of information they incur [3]. Recent work from Intel [25] derives physical limits for irreversible computation by systems... |

14 |
Generating the group of reversible logic gates
- Vos, Raa, et al.
- 2002
(Show Context)
Citation Context ...sible Boolean circuits. This has been recently extended to show that all even permutations can be synthesized with no temporary storage lines, and that odd permutations require exactly one extra line =-=[20, 23]-=-. Optimal circuits for all three-bit reversible functions can be found in several minutes by dynamic programming [20]. This algorithm also synthesizes optimal fourbit circuits reasonably quickly, but ... |

10 |
et al., Elementary Gates for Quantum
- Barenco
- 1995
(Show Context)
Citation Context ...l benefits in terms of asymptotic runtime. While purely quantum gates are necessary to achieve quantum speed-up, variants of conventional reversible gates are also commonly used in quantum algorithms =-=[2]-=-. For example, the textbook implementation of Grover’s quantum search algorithm uses many NCT (NOT, CNOT, and TOFFOLI) gates [19]. Hence, efficient synthesis with such gates is an important step towar... |

10 | Simplification of Toffoli networks via templates
- Maslov, Dueck, et al.
- 2003
(Show Context)
Citation Context ...describes a small set of local transformation rules for NCT-circuits, but focuses on transforming circuits into a canonical form rather than on reducing circuit size. A circuit simplifier proposed in =-=[15, 16]-=- tries to match a small set of pre-computed reducible circuit templates to subcircuits. Even with such simplification techniques, the only work to report optimal circuits for all three-bit functions s... |

8 | Fredkin/Toffoli templates for reversible logic synthesis
- Maslov, Dueck, et al.
- 2003
(Show Context)
Citation Context ...describes a small set of local transformation rules for NCT-circuits, but focuses on transforming circuits into a canonical form rather than on reducing circuit size. A circuit simplifier proposed in =-=[15, 16]-=- tries to match a small set of pre-computed reducible circuit templates to subcircuits. Even with such simplification techniques, the only work to report optimal circuits for all three-bit functions s... |

7 | Towards synthetic benchmark circuits for evaluating timing-driven CAD tools - Stroobandt, Verplaetse, et al. - 1999 |

6 | et al., Introduction to Algorithms, 2nd Ed - Cormen - 2001 |

6 |
et al. Transformation rules for designing CNOT-based quantum circuits
- Iwama
- 2002
(Show Context)
Citation Context ...h further. More scalable constructive synthesis algorithms [18, 1, 12] tend to produce suboptimal circuits even on three bits, which suggests iterative optimization based on local search. The work in =-=[11]-=- describes a small set of local transformation rules for NCT-circuits, but focuses on transforming circuits into a canonical form rather than on reducing circuit size. A circuit simplifier proposed in... |

5 | Optimality, Scalability and Stability - Cong, Romesis, et al. |

3 |
A Reversible Carry-Look-Ahead Adder Using
- Desoete, Vos
- 2002
(Show Context)
Citation Context ...De Vos et al. have built several reversible circuits of up to 384 transistors, powered only by their input signals. Figure 1 shows one of their circuits as seen through a scanning electron microscope =-=[8]-=-. Another novel computing technology that circumvents physical limits cited in [25] — quantum circuits, — also requires complete reversibility. Quantum circuits and algorithms offer additional benefit... |

3 |
Shende et al., “Synthesis of Reversible Logic Circuits
- V
- 2003
(Show Context)
Citation Context ...present in the input must be conserved by the computation and be recoverable from the output. Some fields where such problems arise include cryptography, digital signal processing, and communications =-=[14, 20]-=-. Irreversible circuits necessarily dissipate heat to compensate for the loss of information they incur [3]. Recent work from Intel [25] derives physical limits for irreversible computation by systems... |

2 |
et al., “Limits to Binary Logic Switch Scaling — A Gedanken Model
- Zhirnov
- 2003
(Show Context)
Citation Context ...cryptography, digital signal processing, and communications [14, 20]. Irreversible circuits necessarily dissipate heat to compensate for the loss of information they incur [3]. Recent work from Intel =-=[25]-=- derives physical limits for irreversible computation by systems that use electrons and energy barriers to store and manipulate binary values. ∗ This work was supported by the Undergraduate Summer Res... |