|
|||||
|
|
Minimal universal library for reversible circuits |
|
| Authors: | Guowu Yang Xiaoyu Song Marek A Perkowski William NN Hung Chang-Jun Seo |
| Affiliation: | aUniversity of Electronic Science and Technology of China, Sichuan, China bDepartment ECE, Portland State University, OR, USA cDepartment of EIRE, Inje University, Republic of Korea |
| Abstract: | Reversible logic plays an important role in quantum computing. Several papers have been recently published on universality of sets of reversible gates. However, a fundamental unsolved problem remains: “what is the minimum set of gates that are universal for n-qubit circuits without ancillae bits”. We present a library of 2 gates which is sufficient to realize all reversible circuits of n variables. It is a minimal library of gates for binary reversible logic circuits. We also analyze the complexity of the syntheses. |
| Keywords: | Reversible logic Syntheses Permutation |
| 本文献已被 ScienceDirect 等数据库收录！ | |