Technology mapping for single target gate based circuits using Boolean functional decomposition

DOI10.1007/978-3-319-20860-2_14MaRDI QIDQ2822513zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Nabila Abdessaied, Mathias Soeken, Rolf Drechsler

Publication date 30 September 2016

Published in Reversible Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-20860-2_14

Mathematics Subject Classification ID

Networks and circuits as models of computation; circuit complexity (68Q06) Quantum gates (81P65) Quantum computation (81P68)

Recommendations

• Synthesis of Quantum Circuits for Dedicated Physical Machine Descriptions
• Hybrid GF(2) -- Boolean expressions for quantum computing circuits
• Constructive reversible logic synthesis for Boolean functions with special properties
• A quantum algorithm for finding minimal exclusive-or expressions for incompletely specified Boolean functions
• Transforming MCT circuits to NCVW circuits

Cites work

• Ancilla-free synthesis of large reversible functions using binary decision diagrams
• Factoring logic functions
• scientific article; zbMATH DE number 1579275 (Why is no real title available?)
• scientific article; zbMATH DE number 3319969 (Why is no real title available?)
• Implementing an arbitrary reversible logic gate
• Upper bounds for reversible circuits based on Young subgroups
• Young subgroups for reversible computers.

Cited in

(2)

• Hybrid GF(2) -- Boolean expressions for quantum computing circuits
• Boolean satisfiability in quantum compilation

Describes a project that uses

Uses Software

• RevKit

This page was built for publication: Technology mapping for single target gate based circuits using Boolean functional decomposition

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