Upper bounds for reversible circuits based on Young subgroups

DOI10.1016/J.IPL.2014.01.003MaRDI QIDQ2446569zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Nabila Abdessaied, Mathias Soeken, Michael Kirkedal Thomsen, Rolf Drechsler

Publication date 17 April 2014

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ipl.2014.01.003

zbMATH Keywords

synthesiscombinatorial problemsupper boundsreversible functions

Mathematics Subject Classification ID

Combinatorics in computer science (68R05)

Recommendations

• Complexity of reversible circuits and their quantum implementations
• Young subgroups for reversible computers.
• Theory and Applications of Models of Computation
• Synthesis of reversible circuits with minimal costs
• Optimal 4-bit reversible mixed-polarity Toffoli circuits

Cites work

• On figures of merit in reversible and quantum logic designs
• Reversible Computing
• White dots do matter: rewriting reversible logic circuits
• Young subgroups for reversible computers.

Cited in

(11)

• Ricercar: a language for describing and rewriting reversible circuits with ancillae and its permutation semantics
• \(T\)-\textit{depth} reduction method for efficient \textit{SHA}-256 quantum circuit construction
• Classifying data using near-term quantum devices
• Complexity of reversible circuits and their quantum implementations
• Technology mapping for single target gate based circuits using Boolean functional decomposition
• Canonical multi-target Toffoli circuits
• Canonical mixed-polarity multi-target Toffoli circuits: shift and removal
• Asymptotically optimal synthesis of reversible circuits
• Ancilla-free synthesis of large reversible functions using binary decision diagrams
• Optimal 4-bit reversible mixed-polarity Toffoli circuits
• Young subgroups for reversible computers.

This page was built for publication: Upper bounds for reversible circuits based on Young subgroups

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2446569)