Open AccessEnhancing the quantum cost of Reed-Muller Based Boolean quantum circuits using genetic algorithms
Author(s) -
Mohamed Samir Shaban,
Ahmed Younes,
Ashraf Elsayed
Publication year - 2020
Publication title -
journal of physics. conference series
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.21
H-Index - 85
eISSN - 1742-6596
pISSN - 1742-6588
DOI - 10.1088/1742-6596/1447/1/012031
Subject(s) - boolean circuit , boolean function , parity function , product term , circuit minimization for boolean functions , boolean expression , and inverter graph , mathematics , boolean network , maximum satisfiability problem , discrete mathematics , quantum circuit , quantum algorithm , algorithm , computer science , quantum , quantum error correction , two element boolean algebra , algebra over a field , pure mathematics , quantum mechanics , physics , filtered algebra
There is a direct equivalence between Boolean functions represented in Reed-Muller logic and Boolean Quantum Circuits. Different polarity Reed-Muller expansions will give different Boolean quantum circuits with different cost for the same Boolean function. For a given Boolean function with n variables there are 2 n possible expansions. Searching for the expansion that gives a Boolean quantum circuit with minimum quantum cost within the search space is a hard problem for large n. This paper will use genetic algorithms to find the fixed/mixed polarity Reed-Muller expansion that gives a Boolean quantum circuit with minimum quantum cost to optimize the circuit realization of a given Boolean function.