Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Emergence, complexity and computation

Using Reed-Muller Expansions in the Synthesis and Optimization of Boolean Quantum Circuits

Ahmed Younes

Published Oct 26, 2017• 2 citations
Publisher
DOI
10.1007/978-3-319-67997-6_5

Related papers

A Method to Synthesize Boolean Quantum Circuit Based on Reed-Muller Expansions

Ding, Jin Jin, Yang Yang

International Conference on Communications, Circuits and Systems•Jan 1, 2007•0 citations

Automated Generation of Quantum Circuit Specifications Based on Reed — Muller Expressions

В. А. Калмычков, I. V. Matveeva

PROGRAMMNAYA INGENERIA•Jun 29, 2020•0 citations

Representation of Boolean quantum circuits as reed–Muller expansions

Ahmed Younes, Julian F. Miller

In this paper we show that there is a direct correspondence between Boolean quantum operations and certain forms of classical (non-quantum) logic known as Reed–Muller expansions. This allows us to readily convert Boolean circuits into their quantum equivalents. A direct result of this is that the problem of synthesis and optimization of Boolean quantum circuits can be tackled within the field of Reed–Muller logic.

International Journal of Electronics•Jul 1, 2004•37 citations

Representation of Boolean Quantum Circuits as Reed-Muller Expansions

Ahmed Younes, Julian Francis Miller

In this paper we show that there is a direct correspondence between quantum Boolean operations and certain forms of classical (non-quantum) logic known as Reed-Muller expansions. This allows us to readily convert Boolean circuits into their quantum equivalents. A direct result of this is that the problem of synthesis and optimization of quantum Boolean logic can be tackled within the field of Reed-Muller logic.

arXiv:quant-ph/0305134•May 22, 2003•0 citations

Enhancing the quantum cost of Reed-Muller Based Boolean quantum circuits using genetic algorithms

Mohamed Samir Shaban, Ahmed Younes, Ashraf Elsayed

Abstract 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 2n 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.

Journal of Physics Conference Series•Jan 1, 2020•1 citation

Synthesis and Optimization of Quantum Boolean Circuit Using the Truth Table Method

Fatma Hamzaoui, Roselyne Chotin-Avot, Patricia Renault +3 more

•Apr 26, 2012•0 citations
Abstract 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 2n 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.