Detection and Elimination of Non-Trivial Reversible Identities

TL;DR

This paper introduces an efficient algorithm to detect and eliminate Non-Trivial Reversible Identities (NTRIs) in reversible circuits, improving circuit performance by reducing unnecessary gates and quantum cost.

Contribution

The paper presents the first polynomial-time algorithm for detecting and removing NTRIs, addressing a gap in existing optimization methods for reversible circuits.

Findings

NTRIs cause increased gate count and quantum cost.

The proposed algorithm effectively detects and removes NTRIs.

Removing NTRIs improves circuit efficiency and performance.

Abstract

Non-Trivial Reversible Identities (NTRIs) are reversible circuits that have equal inputs and outputs. NTRIs cannot be detected using optimization algorithms in the literature. Existence of NTRIs in a circuit will cause a slow down by increasing the number of gates and the quantum cost. NTRIs might arise due to integration between two or more optimal reversible circuits. In this paper, an algorithm that detects and removes NTRIs in polynomial time will be proposed. Experiments that show the bad effect of NTRIs and the enhancement using the proposed algorithm will be presented.