Computing the number of the equivalence classes for reversible logic functions

DOI10.1007/s10773-020-04508-yzbMath1447.81079OpenAlexW3036558755MaRDI QIDQ2197037

Jinzhao Wu, Chen Lin, Qing-Bin Luo, Guo-wu Yang

Publication date: 4 September 2020

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

Full work available at URL: https://doi.org/10.1007/s10773-020-04508-y

zbMATH Keywords

quantum computationpermutation groupequivalence classreversible function

Mathematics Subject Classification ID

Combinatorial identities, bijective combinatorics (05A19) Quantum computation (81P68) Symmetric groups (20B30) Quantum gates (81P65)

Uses Software

• OEIS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Realization and synthesis of reversible functions
• Quantum Computation and Quantum Information
• Enumeration of Reversible Functions and Its Application to Circuit Complexity
• Equivalence classes of invertible Boolean functions
• Conjugacy classes in finite permutation groups via homomorphic images
• On the number of equivalence classes of invertible Boolean functions under action of permutation of variables on domain and range
• The Number of Classes of Invertible Boolean Functions
• On the Classification of Boolean Functions by the General Linear and Affine Groups
• Invertible Boolean Functions
• Logical Reversibility of Computation
• Theory and Applications of Models of Computation

This page was built for publication: Computing the number of the equivalence classes for reversible logic functions