کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
9657901 | 690385 | 2005 | 16 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Majority-based reversible logic gates
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
نظریه محاسباتی و ریاضیات
پیش نمایش صفحه اول مقاله

چکیده انگلیسی
Reversible logic plays an important role in the synthesis of circuits for quantum computing. In this paper, we introduce families of reversible gates based on the majority Boolean function (MBF) and we prove their properties in reversible circuit synthesis. These gates can be used to synthesize reversible circuits of minimum “scratchpad register width” for arbitrary reversible functions. We show that, given a MBF f with 2k+1 inputs, f can be implemented by a reversible logic gate with 2k+1 inputs and 2k+1 outputs, i.e., without any constant inputs. We also demonstrate new gates from this family with very efficient quantum realizations for majority-based applications. They can be used to synthesize any reversible function of the same width in conjunction with inverters and Feynman (2-qubit controlled-NOT) gates. The gate universality problem is formulated in terms of elementary group theory and solved using the algebraic software GAP.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Theoretical Computer Science - Volume 334, Issues 1â3, 15 April 2005, Pages 259-274
Journal: Theoretical Computer Science - Volume 334, Issues 1â3, 15 April 2005, Pages 259-274
نویسندگان
Guowu Yang, William N.N. Hung, Xiaoyu Song, Marek Perkowski,