Answers are grounded in this paper and cite their sources.
Reversible logic circuits can be synthesized hierarchically by dividing them into smaller, more manageable blocks. As all reversible circuits of a certain width w form a group, this problem relates to the partitioning of a group into (double) cosets. In this article, we propose three different strategies for the synthesis of reversible circuits, all based on group theory. We will compare these different methods and will determine which is the most efficient.
No takes yet. Share an insight, caveat, or question.
Vos et al. (2007) studied this question.
Synapse has enriched 5 related papers. Consider them for comparative context: