Algebraic characterization of reversible logic gates

DOI10.1007/S00224-004-1166-2zbMath1101.68032OpenAlexW1969690324MaRDI QIDQ2432537

Yuke Wang, Xiaoyu Song, Guo-wu Yang, Marek A. Perkowski

Publication date: 25 October 2006

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00224-004-1166-2

zbMATH Keywords

Boolean reversible gates

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Quantum computation (81P68)

Related Items (5)

Efficient algorithms for optimal 4-bit reversible logic system synthesis ⋮ Realization of a new permutative gate library using controlled-kth-root-of-NOT quantum gates for exact minimization of quantum circuits ⋮ Realization and synthesis of reversible functions ⋮ Minimal universal library for \(n\times n\) reversible circuits ⋮ Synthesis of reversible circuits with minimal costs

This page was built for publication: Algebraic characterization of reversible logic gates