The DOI matches its Crossref record; 24 of the 24 references it cites were found in a registry or an index.
An Algorithm for Synthesis of Reversible Logic Circuits
Abstract
Reversible logic finds many applications, especially in the area of quantum computing. A completely specified n-input, n-output Boolean function is called reversible if it maps each input assignment to a unique output assignment and vice versa. Logic synthesis for reversible functions differs substantially from traditional logic synthesis and is currently an active area of research. The authors present an algorithm and tool for the synthesis of reversible functions. The algorithm uses the positive-polarity Reed-Muller expansion of a reversible function to synthesize the function as a network of Toffoli gates. At each stage, candidate factors, which represent subexpressions common between the Reed-Muller expansions of multiple outputs, are explored in the order of their attractiveness. The algorithm utilizes a priority-based search tree, and heuristics are used to rapidly prune the search space. The synthesis algorithm currently targets the generalized n-bit Toffoli gate library. However, other algorithms exist that can convert an n-bit Toffoli gate into a cascade of smaller Toffoli gates. Experimental results indicate that the authors' algorithm quickly synthesizes circuits when tested on the set of all reversible functions of three variables. Furthermore, it is able to quickly synthesize all four-variable and most five-variable reversible functions that were in the test suite. The authors also present results for some benchmark functions widely discussed in literature and some new benchmarks that the authors have developed. The algorithm is shown to synthesize many, but not all, randomly generated reversible functions of as many as 16 variables with a maximum gate count of 25
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Quantum Computation and Quantum Information
Nielsen, M. A., Chuang, I., & Grover, L. K. (2002) · American Journal of Physics · doi:10.1119/1.1463744 · Cited by 21,895
Quantum computation and quantum information
Law, J. (2001) · ACM SIGSOFT Software Engineering Notes · doi:10.1145/505482.505499 · Cited by 18,842
Irreversibility and heat generation in the computing process
Landauer, R. (1961) · IBM Journal of Research and Development · doi:10.1147/rd.53.0183 · Cited by 4,980
Elementary gates for quantum computation
Barenco, A., Bennett, C. H., Cleve, R., DiVincenzo, D. P., Margolus, N., Shor, P., Sleator, T., Smolin, J. A., & Weinfurter, H. (1995) · Physical Review A · doi:10.1103/physreva.52.3457 · Cited by 4,311
Logical Reversibility of Computation
Bennett, C. H. (1973) · IBM Journal of Research and Development · doi:10.1147/rd.176.0525 · Cited by 3,679
Irreversibility and heat generation in the computing process
Landauer, R. (2000) · IBM Journal of Research and Development · doi:10.1147/rd.441.0261 · Cited by 2,585
Fredkin, E., & Toffoli, T. (1982) · International Journal of Theoretical Physics · doi:10.1007/bf01857727 · Cited by 1,896
Toffoli, T. (1980) · Lecture Notes in Computer Science · doi:10.1007/3-540-10003-2_104 · Cited by 1,523
Fredkin, E., & Toffoli, T. (2001) · Cited by 1,301
Synthesis of reversible logic circuits
Shende, V. V., Prasad, A. K., Markov, I. L., & Hayes, J. P. (2003) · IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems · doi:10.1109/tcad.2003.811448 · Cited by 568
A transformation based algorithm for reversible logic synthesis
Miller, D. M., Maslov, D., & Dueck, G. W. (2003) · Proceedings of the 40th annual Design Automation Conference · doi:10.1145/775832.775915 · Cited by 493
Toffoli network synthesis with templates
Maslov, D., Dueck, G. W., & Miller, D. M. (2005) · IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems · doi:10.1109/tcad.2005.847911 · Cited by 227
Transformation rules for designing CNOT-based quantum circuits
Iwama, K., Kambayashi, Y., & Yamashita, S. (2002) · Proceedings of the 39th conference on Design automation - DAC '02 · doi:10.1145/513918.514026 · Cited by 164
Logic synthesis of reversible wave cascades
Mishchenko, A., & Perkowski, M. A. (2002) · PDXScholar (Portland State University) · Cited by 136
Spectral Techniques for Reversible Logic Synthesis
Miller, D. M., & Dueck, G. W. (2002) · Cited by 97
Al‐Rabadi, A. N. (2004) · Springer eBooks · doi:10.1007/978-3-642-18853-4 · Cited by 90
Babu, H. M. H. (2020) · Wiley eBooks · doi:10.1002/9781119679455.ch1 · Cited by 79
Simplification of Toffoli networks via templates
Maslov, D., Dueck, G. W., & Miller, D. M. (2004) · Symposium on Integrated Circuits and Systems Design · doi:10.1109/sbcci.2003.1232806 · Cited by 49
Simplification of Toffoli networks via templates
Maslov, D., Dueck, G. W., & Miller, D. M. (2003) · doi:10.5555/942808.943941 · Cited by 44
Fredkin/Toffoli Templates for Reversible Logic Synthesis
Maslov, D., Dueck, G. W., & Miller, D. M. (n.d.) · Cited by 43
Fredkin/Toffoli templates for reversible logic synthesis
Maslov, D., Dueck, G. W., & Miller, D. M. (2004) · International Conference on Computer Aided Design · doi:10.1109/iccad.2003.1257667 · Cited by 39
A transformation based algorithm for reversible logic synthesis
Miller, D. M., Maslov, D., & Dueck, G. W. (2004) · ACM/IEEE Design Automation Conference (DAC) · doi:10.1109/dac.2003.1219016 · Cited by 37
Smaller two-qubit circuits for quantum communication and computation
Shende, V., Markov, I. L., & Bullock, S. S. (2004) · Design, Automation, and Test in Europe · doi:10.1109/date.2004.1269020 · Cited by 24
Templates for Toffoli Network Synthesis
Maslov, D., Dueck, G. W., & Miller, D. M. (2003) · Cited by 11
Cited by
RevLib: An Online Resource for Reversible Functions and Reversible Circuits
Wille, R., Gro, D., Teuber, L., Dueck, G. W., & Drechsler, R. (2008) · 38th International Symposium on Multiple Valued Logic (ismvl 2008) · doi:10.1109/ismvl.2008.43 · Cited by 495
BDD-based synthesis of reversible logic for large functions
Wille, R., & Drechsler, R. (2009) · Proceedings of the 46th Annual Design Automation Conference · doi:10.1145/1629911.1629984 · Cited by 323
Synthesis and optimization of reversible circuits—a survey
Saeedi, M., & Markov, I. L. (2013) · ACM Computing Surveys · doi:10.1145/2431211.2431220 · Cited by 298
On security of image ciphers based on logic circuits and chaotic permutations
Annaby, M. H., Ayad, H., & Rushdi, M. A. (2018) · Multimedia Tools and Applications · doi:10.1007/s11042-017-5439-6 · Cited by 6
Metadata
- Authors
- Gupta, P., Agrawal, A., & Jha, N. K.
- Venue
- IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
- Published
- 2006-11
- Volume
- 25
- Issue
- 11
- Pages
- 2317-2330
- ISSN
- 0278-0070 (ISSN-L)
- OpenAlex
- W2150088560
- Cited by
- 379
- References
- 24
- FWCI
- 22.21
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.