A Novel Method for Optimal Synthesis of Reversible Circuits using Metaheuristic Algorithms

<p class="MsoNormal" style="margin-bottom: .0001pt; text-align: justify; line-height: normal;">A reversible logic circuit is a circuit that consists of reversible gates, and there is a one-to-one correspondence between its inputs and outputs. These circuits have a unique input corresponding to each output, and information loss does not occur as a result. So far, many attempts have been made in the field of automatic synthesis of reversible circuits, especially with the help of knowledge engineering methods. In this research, the problem of automatic synthesis of reversible circuits was innovatively modeled into a multi-criteria optimization problem, and then a new combination of genetic and bat metaheuristic algorithms was presented to solve this optimization problem. The architecture of the proposed method encodes reversible circuits as chromosomes in the genetic algorithm and as positions in the bat algorithm. By automatically sharing populations between the two algorithms, the method exploits the global exploration ability of GA and the local exploitation capability of BA in a complementary manner. The proposed method outperforms each algorithm individually, especially in quantum cost and delay. For example, in the 2&rsquo;s complement circuit, the quantum cost drops from 25 and 22 to 19, with the delay reduced to 12. In the full adder, garbage outputs decrease from 18 to 9, indicating significant improvement.

Institutions

Publication Details

Journal
SHILAP Revista de lepidopterología
Published
2025-10-01
Primary Topic
Quantum Computing Algorithms and Architecture
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

A Novel Method for Optimal Synthesis of Reversible Circuits using Metaheuristic Algorithms

SHILAP Revista de lepidopterología
Quantum Computing Algorithms and Architecture
article

A Novel Method for Optimal Synthesis of Reversible Circuits using Metaheuristic Algorithms

article en

Abstract

<p class="MsoNormal" style="margin-bottom: .0001pt; text-align: justify; line-height: normal;">A reversible logic circuit is a circuit that consists of reversible gates, and there is a one-to-one correspondence between its inputs and outputs. These circuits have a unique input corresponding to each output, and information loss does not occur as a result. So far, many attempts have been made in the field of automatic synthesis of reversible circuits, especially with the help of knowledge engineering methods. In this research, the problem of automatic synthesis of reversible circuits was innovatively modeled into a multi-criteria optimization problem, and then a new combination of genetic and bat metaheuristic algorithms was presented to solve this optimization problem. The architecture of the proposed method encodes reversible circuits as chromosomes in the genetic algorithm and as positions in the bat algorithm. By automatically sharing populations between the two algorithms, the method exploits the global exploration ability of GA and the local exploitation capability of BA in a complementary manner. The proposed method outperforms each algorithm individually, especially in quantum cost and delay. For example, in the 2&rsquo;s complement circuit, the quantum cost drops from 25 and 22 to 19, with the delay reduced to 12. In the full adder, garbage outputs decrease from 18 to 9, indicating significant improvement.

SHILAP Revista de lepidopterología
Islamic Azad University Mehriz (IR)
Openalex Percentile: Top 24%
Quantum Computing Algorithms and Architecture
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.