Recently, reversible circuit synthesis has been intensively studied. One of the problems that
has not been solved for a long time was exact minimization of gate count (GC) in 4-bit …

Abstract Since Controlled-Square-Root-of-NOT (CV, CV‡) gates are not permutative
quantum gates, many existing methods cannot effectively synthesize optimal 3-qubit circuits …

Recently, one of the main criteria used to evaluate reversible circuit designs is quantum cost.
In this paper, an approach to reducing quantum cost of small-width reversible circuits is …

A variable-length chromosome evolutionary algorithm for reversible circuit synthesis (VLEA
RC) is presented to improve the quality of solutions in terms of quantum cost. The synthesis …

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 …

Visual programming languages use graphics to visualize and aid in the understanding of
programs. We describe the graphical techniques used in the MAP environment to visualize …

This article presents an algorithm which can quickly find the exact minimum solution to
almost all of 4-bit reversible functions. We assume minimization of quantum cost (MQC). This …

Even limited to 4-bits reversible functions, the synthesis of optimal reversible circuits
becomes an arduous task owing to the extremely large problem space. The current paper …

In this paper, we propose a hybrid algorithm aimed at optimally synthesizing reversible
Toffoli circuits in terms of the quantum cost for 4-bit and 5-bit reversible benchmarks. The …

Reversible circuits synthesis has been extensively studied, but most of which focused on
minimizing the gate count. This paper presents a clone selection algorithm which aims at …