查詢結果分析
相關文獻
- Reversible Circuit Synthesis Using a New Modified Tabulation Method
- An Exclusive-Sum Form for Reversible Circuit Using Basic Quantum Gates
- 量子計算與密碼學
- 邏輯合成元件庫之特性分析
- An Analysis of Standard Cell Usage in Logic Synthesis
- 接線負載模型的建立和應用
- 深次微米時代之IC設計方法
- 聯結佈局之設計環境
- Reaction Dynamics and Transformation Mechanism of K + DBr/HBr → KBr + D/H within 0.1 ≦ Erel ≦ 0.25∼3.0 eV
- 量子計算與資訊
頁籤選單縮合
題 名 | An Exclusive-Sum Form for Reversible Circuit Using Basic Quantum Gates=使用基本量子邏輯閘表示可逆電路的互斥和格式 |
---|---|
作 者 | 王秀安; 盧勤庸; | 書刊名 | 德霖學報 |
卷 期 | 24 2010.08[民99.08] |
頁 次 | 頁409-422 |
分類號 | 448.532 |
關鍵詞 | 量子計算; 電路最佳化; 可逆電路; 邏輯合成; Quantum computing; Circuit optimization; Reversible circuit; Logic synthesis; |
語 文 | 英文(English) |
中文摘要 | 在最近幾年,對於量子計算的關注是越來越高,這是因為可逆電路可以用量子邏輯閘進行電 路合成,所以這導致大眾又再度注意到可逆電路,應用可逆電路可以減輕功率消耗所帶來的問題, 如果電路是可逆的,它可以降低因為訊息損失所造成的能源消耗,我們需要一個演算法執行合成可 逆電路,但是傳統合成演算法無法直接適用在可逆電路,這是因為除了NOT 閘之外,基本傳統邏輯 閘都不是可逆邏輯閘。在這個論文中,我們提出一種互斥和格式,可以很容易地轉換成為可逆電路, 只要使用基本量子邏輯閘,其中包括NOT、CN 和Toffoli 閘,事實上,由合成演算法所產生以互斥 和格式表示的結果關係式,可以轉換成為更簡化的可逆電路,我們已經表明,一個以互斥和格式表 示的可逆電路比以互斥和-積格式表示的可逆電路,具有更低的量子成本。此外,如果排列電路可 以用以互斥和格式表示,我們就可以把排列電路轉換成為可逆電路,而且這個電路具有較低的量子 成本和沒有不必要的無用量子位元。同樣地,我們也可以合成不可逆電路,只要轉換成為以互斥和 格式表示的關係式,以及增加量子位元,就可以使得電路變成可逆。 |
英文摘要 | The concern with quantum computing has been growing for the last several years. This results in that reversible circuit has been brought to public attention again since a reversible circuit can be synthesized by quantum gates. The most important point of using reversible circuits is to reduce the problem of power dissipation. If a circuit is reversible, it can reduce the energy consumption caused by information loss. We need a algorithm to synthesize a reversible circuit, but the classical synthesis algorithm is not directly applicable to the synthesis of reversible circuits because the basic classical gates, except the NOT gate, are not reversible gates. In this paper, we propose an exclusive-sum form which can be easily transformed into a reversible circuit by using the basic quantum gates including NOT, CN, and Toffoli gates. In fact, the resulting expression in exclusive-sum form generated by synthesis algorithms can be transformed into a more simplified reversible circuit. We have shown that a reversible circuit in exclusive-sum form has lower quantum cost than one in exclusive-sum-of- products form after the combination of terms. Moreover, if permutations are represented as an expression in exclusive-sum form, we can realize permutations to be reversible circuits with lower quantum cost and without unnecessary garbage bits. Similarly, we can also synthesize irreversible circuits by transforming into an expression in exclusive-sum form and adding qubits to make the circuits reversible. |
本系統中英文摘要資訊取自各篇刊載內容。