Moving forward: A non-search based synthesis method toward efficient CNOT-based quantum circuit synthesis algorithms

Saeedi, Mehdi; Zamani, Morteza Saheb; Sedighi, Mehdi

doi:10.1109/aspdac.2008.4484066

Cited by 16 publications

(8 citation statements)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Example 3: Suppose the canonical cycle form of the input permutation is P= (3,5,6,7,9,10,11) The first six 3-cycles are disjoint and the last two 3-cycles are non-disjoint over the other cycles. Note that the process leads to only one cycle with length less than three.…”

Section: Fig 3 the Cycle-based Synthesis Algorithmmentioning

confidence: 99%

“…The synthesis of reversible circuits composed of generalized Toffoli gates has been studied extensively [5], [10]- [13]. On the other hand, there are a few papers [6], [14] published which use NCT gate library containing NOT (N), CNOT (C) and Toffoli (T) gates.…”

Section: Previous Workmentioning

confidence: 99%

“…If several Toffoli gates with the same control bits are applied consecutively, the target bits are shown in "[]" notation to save space. For example, four successive Toffoli gates T(1, 2, 3), T(1, 2, 4), T(1, 2, 5) and T(1, 2, 6) are represented as T(1, 2, [3,4,5,6]). For each k-cycle implementation, the π, κ 0 and π -1 circuits are created, respectively (πκ 0 π -1 ).…”

Section: Cycle-based Synthesis Algorithmmentioning

confidence: 99%

“…For example, as loops and fan-outs are not allowed in reversible circuits, and each gate must have the same number of inputs and outputs with unique input/output assignments in the transition function [4], matured irreversible synthesis algorithms cannot be directly applied to reversible circuits [5].…”

Section: Introductionmentioning

confidence: 99%

“…Synthesis of reversible circuits is significantly more complex than that of traditional irreversible logic circuits due to various constraints imposed by the reversibility [5]. For example, as loops and fan-outs are not allowed in reversible circuits, and each gate must have the same number of inputs and outputs with unique input/output assignments in the transition function [4], matured irreversible synthesis algorithms cannot be directly applied to reversible circuits [5].…”

Section: Introductionmentioning

confidence: 99%

See 4 more Smart Citations

A cycle-based synthesis algorithm for reversible logic

Sasanian¹,

Saeedi²,

Sedighi³

et al. 2009

2009 Asia and South Pacific Design Automation Conference

Self Cite

View full text Add to dashboard Cite

Several algorithms have been proposed for the synthesis of reversible circuits. In this paper, a cycle-based synthesis algorithm for reversible logic, based on the NCT library, has been proposed. In other words, direct implementation of a single 3-cycle, a pair of 3-cycles and a pair of 2-cycles have been explored and used to propose an efficient Toffoli-based synthesis algorithm for reversible circuits. The synthesis algorithm decomposes a given large cycle into a set of single 3-cycles, pairs of 3-cycles and pair of 2-cycles and synthesizes the resulted cycles directly. Our experimental results show that the proposed synthesis algorithm can outperform the available 2-cycle-based approach about 34% on average. In addition, several discussions for the generalization of the proposed method to the 2 m -cycles are given.

show abstract