Improving the quantum cost of reversible Boolean functions using reorder algorithm
- Resource Type
- Authors
- Taghreed Ahmed; Ahmed Younes; Ashraf Elsayed
- Source
- Quantum Information Processing. 17
- Subject
- 010302 applied physics
Work (thermodynamics)
Computer science
Polarity symbols
Statistical and Nonlinear Physics
02 engineering and technology
Quantum cost
Function (mathematics)
01 natural sciences
020202 computer hardware & architecture
Theoretical Computer Science
Electronic, Optical and Magnetic Materials
Computer Science::Emerging Technologies
Modeling and Simulation
0103 physical sciences
Signal Processing
0202 electrical engineering, electronic engineering, information engineering
Reversible circuits
Electrical and Electronic Engineering
Boolean function
Algorithm
Hardware_LOGICDESIGN
Quantum computer
- Language
- ISSN
- 1573-1332
1570-0755
This paper introduces a novel algorithm to synthesize a low-cost reversible circuits for any Boolean function with n inputs represented as a Positive Polarity Reed–Muller expansion. The proposed algorithm applies a predefined rules to reorder the terms in the function to minimize the multi-calculation of common parts of the Boolean function to decrease the quantum cost of the reversible circuit. The paper achieves a decrease in the quantum cost and/or the circuit length, on average, when compared with relevant work in the literature.