Complexity Analysis for Garbage-Free Reversible Computation of Boolean Functions with Variable Ancilla
Journal of Engineering and Sustainable Development · 01.11.2026 · 30 (6) · 993-1000
DOI: 10.31272/jeasd.2923 ↗Kurz gefasst
Fachartikel in der Zeitschrift Journal of Engineering and Sustainable Development, online erschienen am 01.11.2026. Verfasst von Zaid Al-Wardi. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).
Abstract (Originalsprache)
Reversible computation is a fundamental concept in quantum circuits and low-power design. As the demand for powerful and energy-efficient computing grows, novel design methods for reversible circuits become critical for achieving high performance with low power consumption. Current reversible circuit synthesis methodologies fall into two classes, each minimizing a different parameter in circuit complexity, but often result in relatively high values in another parameter. Post-synthesis optimizations moderate complexity parameters, basically by trading off between them. However, these optimizations depend on specific gate patterns and may not always meet design constraints effectively. This paper proposes a novel recursive decomposition scheme for large Boolean functions using a single-target gate model in reversible circuit synthesis. The proposed scheme systematically and efficiently manages the trade-off between reversible circuit complexity measures, offering gradually varying parameters at each level in the recursion. The scalability of the proposed approach is presented as a comprehensive complexity analysis for the mathematical model. Rather than providing a globally optimal solution, this approach offers a range of solutions, allowing designers to choose the most suitable option based on specific design constraints.
Zitieren
APA
Al-Wardi, Z. (2026). Complexity Analysis for Garbage-Free Reversible Computation of Boolean Functions with Variable Ancilla. Journal of Engineering and Sustainable Development, 30(6), 993-1000. https://doi.org/10.31272/jeasd.2923
Vancouver
Al-Wardi Z. Complexity Analysis for Garbage-Free Reversible Computation of Boolean Functions with Variable Ancilla. Journal of Engineering and Sustainable Development. 2026;30(6):993-1000. doi:10.31272/jeasd.2923
BibTeX
@article{AlWardi2026,
author = {Al-Wardi, Zaid},
title = {Complexity Analysis for Garbage-Free Reversible Computation of Boolean Functions with Variable Ancilla},
journal = {Journal of Engineering and Sustainable Development},
year = {2026},
volume = {30},
number = {6},
pages = {993--1000},
doi = {10.31272/jeasd.2923}
}
EUVIMED