Please use this identifier to cite or link to this item: http://hdl.handle.net/11455/7352
標題: 合成組合量子布林電路之啟發式演算法
A Heuristic Algorithm for Synthesizing Combinatorial QuantumBoolean Circuits
作者: 黃勇益
huang, yungyi
關鍵字: 組合量子布林電路;combinatorial quantum Boolean circuits;電路合成;啟發式演算法;里德馬勒展;circuit synthesis;heuristic algorithms;Reed-Muller expressions;Toffoli gates.;computer
出版社: 電機工程學系
摘要: 
對於量子電腦而言,量子布林電路的合成是一個基本目標。此外,
使用n 3 的n位元「托佛利」閘建構一個量子電路似乎是不切實際也不
符合經濟效益的。於此論文中,我們介紹一個使用僅含「非」、「控
制非」和「托佛利」等閘之閘元件庫來合成任何組合量子布林電路的
啟發式演算法。
我們的演算法主要是採用基本連結規則與次要連結規則來簡化電
路。此外,在簡化過程中,我們也提出一選擇成本較低路徑的方法。
最後,我們再提出一方法,其分析化簡後之電路並找出共同項,以進
一步地降低電路成本。於本文中,我們使用一些例子並配合卡諾夫圖
呈現來說明我們的演算法。

For a quantum computer, the synthesis of quantum Boolean circuits is
an essential aim. In addition, it seems that constructing a circuit with an
n-bit Toffoli gatewith n 3 is neither practical nor economical. In this
paper, we introduce a heuristic algorithm for synthesizing any
combinational quantum Boolean circuit with a gate library containing only
Not, CNot and Toffoli gates.
Our algorithm mainly adopts the primary linking rule and secondary
linking rule to simplify a circuit. Moreover, we propose a method for
selecting a path with lower cost during the simplification process. Finally,
we propose another method, which analyzes the simplified circuit and finds
out common terms, to further reduce the circuit cost. In the context, we
employ some examples, in company with the Karnaugh map presentation,
to explain our algorithm.
URI: http://hdl.handle.net/11455/7352
Appears in Collections:電機工程學系所

Show full item record
 

Google ScholarTM

Check


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.