Improving the quantum cost of reversible Boolean functions using reorder algorithm

DOI10.1007/S11128-018-1874-1zbMath1395.81080DBLPjournals/qip/AhmedYE18OpenAlexW2791843314WikidataQ62040661 ScholiaQ62040661MaRDI QIDQ1654122

Ashraf Elsayed, Taghreed Ahmed, Ahmed Younes

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

factorization algorithmBoolean functionquantum costreorder algorithmreversible Boolean circuits

Mathematics Subject Classification ID

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

Related Items (1)

A fault-tolerant and scalable column-wise reversible quantum multiplier with a reduced size

Uses Software

• RevLib

Cites Work

• Unnamed Item
• Synthesis of reversible circuits with minimal costs
• Conservative logic
• Quantum computation and quantum information†
• Optimal 4-bit Reversible Mixed-Polarity Toffoli Circuits
• Logical Reversibility of Computation

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