Improving the quantum cost of reversible Boolean functions using reorder algorithm

DOI10.1007/S11128-018-1874-1MaRDI QIDQ1654122zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Taghreed Ahmed, Ahmed Younes, Ashraf Elsayed

Publication date 7 August 2018

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

Full work available at URL https://doi.org/10.1007/s11128-018-1874-1

zbMATH Keywords

Boolean functionquantum costfactorization algorithmreorder algorithmreversible Boolean circuits

Mathematics Subject Classification ID

Resource and cost allocation (including fair division, apportionment, etc.) (91B32) Searching and sorting (68P10) Quantum algorithms and complexity in the theory of computing (68Q12) Quantum computation (81P68) Factorization (11Y05)

Recommendations

• Reversible circuit synthesis of symmetric functions using a simple regular structure
• A quantum algorithm for finding minimal exclusive-or expressions for incompletely specified Boolean functions
• Realization and synthesis of reversible functions
• Constructive reversible logic synthesis for Boolean functions with special properties
• Optimization of reversible circuits using reconfigured templates

Cites work

• Conservative logic
• Cryptographic Boolean functions and applications.
• Logical Reversibility of Computation
• Optimal 4-bit reversible mixed-polarity Toffoli circuits
• Quantum computation and quantum information†
• Synthesis of reversible circuits with minimal costs

Cited in

(12)

• Improving the quantum cost of NCT-based reversible circuit
• Reordering method and hierarchies for quantum and classical ordered binary decision diagrams
• Constructive reversible logic synthesis for Boolean functions with special properties
• Reversible circuit synthesis of symmetric functions using a simple regular structure
• A quantum algorithm for finding minimal exclusive-or expressions for incompletely specified Boolean functions
• Finding the redundant gates in reversible circuits
• Optimization of reversible circuits using reconfigured templates
• A fault-tolerant and scalable column-wise reversible quantum multiplier with a reduced size
• Exact global reordering for nearest neighbor quantum circuits using \({\mathrm {A}}^{*}\)
• Hybrid GF(2) -- Boolean expressions for quantum computing circuits
• Minimization of quantum multiple-valued decision diagrams using data structure metrics
• Utilization of variable reordering in quantum ESCT minimization

Describes a project that uses

Uses Software

• RevLib

This page was built for publication: Improving the quantum cost of reversible Boolean functions using reorder algorithm

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