A reversible logical circuit synthesis algorithm based on decomposition of cycle representations of permutations

DOI10.1007/s10773-018-3768-5zbMath1447.81086OpenAlexW2804305837MaRDI QIDQ1616470

Gaoman Zhang, Wei Zhu, Wei Zhang, Suhan Pan, Zhi-Qiang Li

Publication date: 6 November 2018

Published in: International Journal of Theoretical Physics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10773-018-3768-5

zbMATH Keywords

reversible logiccircuit synthesisreversible computingcycle representations of permutations

Mathematics Subject Classification ID

Quantum computation (81P68) Foundations of classical theories (including reverse mathematics) (03B30) General theory for finite permutation groups (20B05) Quantum gates (81P65)

Cites Work

• A new reversible circuit synthesis algorithm based on cycle representations of permutations
• Synthesis and optimization of reversible circuits—a survey
• Logical Reversibility of Computation

This page was built for publication: A reversible logical circuit synthesis algorithm based on decomposition of cycle representations of permutations