Papers › An Algorithm for Reversible Logic Circuit Synthesis Based on Tensor Decomposition

An Algorithm for Reversible Logic Circuit Synthesis Based on Tensor Decomposition

9 Jul 2021arXiv:2107.04298links table onlyarchive 2025-07-28

Hochang Lee, Kyung Chul Jeong, Daewan Han, Panjin Kim

The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.

An algorithm for reversible logic synthesis is proposed. The task is, for a given n-bit substitution map Pₙ: {0,1}ⁿ →{0,1}ⁿ, to find a sequence of reversible logic gates that implements the map. The gate library adopted in this work consists of multiple-controlled Toffoli gates denoted by CᵐX, where m is the number of control bits that ranges from 0 to n-1. Controlled gates with large m (>2) are then further decomposed into C⁰X, C¹X, and C²X gates. A primary concern in designing the algorithm is to reduce the use of C²X gate (also known as Toffoli gate) which is known to be universal. The main idea is to view an n-bit substitution map as a rank-2n tensor and to transform it such that the resulting map can be written as a tensor product of a rank-(2n-2) tensor and the 2×2 identity matrix. Let 𝒫ₙ be a set of all n-bit substitution maps. What we try to find is a size reduction map 𝒜_(red): 𝒫ₙ →{Pₙ: Pₙ = Pₙ₋₁ ⊗I₂}. %, where Iₘ is the m×m identity matrix. One can see that the output Pₙ₋₁ ⊗I₂ acts nontrivially on n-1 bits only, meaning that the map to be synthesized becomes Pₙ₋₁. The size reduction process is iteratively applied until it reaches tensor product of only 2 ×2 matrices.

PaperPDFCode

Code

ReversibleLogicCircuit/SizeReduction officialmentioned in papermentioned on GitHub report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

Not run by Syntology. Nothing on this page verifies that the listed code works.

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections