NCV門庫量子電路故障檢測與定位研究
發(fā)布時間：2018-12-07 07:09
【摘要】：量子邏輯電路綜合是量子計算機(jī)及量子信息技術(shù)研究的關(guān)鍵問題之一。為確保量子邏輯電路正確實現(xiàn)其函數(shù)功能,需要對量子邏輯電路的故障進(jìn)行檢測與定位。目前,在量子邏輯電路故障的檢測與定位研究方面還有許多問題需要解決。本文在該領(lǐng)域的貢獻(xiàn)主要表現(xiàn)在如下幾個方面:1)提出了量子邏輯電路故障檢測算法。該算法在量子邏輯電路的固定點故障模型下,設(shè)計了故障測試電路,以此生成電路的故障最小測試集。通過benchmark例題實驗表明,該算法生成的完備檢測集和測試向量維數(shù)較小,能有效提高檢測速度。2)給出了量子邏輯電路故障定位算法與黑盒檢測算法來定位丟失門故障。故障定位算法通過對故障電路輸出表的處理生成故障定位樹,再結(jié)合黑盒算法完成對故障電路故障門的定位。通過benchmark例題實驗驗證該算法能高效、準(zhǔn)確地定位出規(guī)模較小的量子邏輯電路的故障門。3)針對電路規(guī)模增大后算法預(yù)處理故障數(shù)據(jù)呈指數(shù)倍增加,到達(dá)一定閥域時原有邏輯程序可能崩潰的問題,提出了基于信息熵的量子邏輯電路故障門快速定位算法。該算法首先對故障輸出表進(jìn)行關(guān)系處理,去掉了大量無用數(shù)據(jù),再根據(jù)相應(yīng)規(guī)則生成故障定位樹。生成的故障定位樹高度和葉節(jié)點數(shù)都較小,有效提高了檢測的速度。4)為了滿足物理實現(xiàn)量子電路時所設(shè)計的量子邏輯電路線性最近鄰(LNN)約束的要求,需要設(shè)計線性最近鄰量子電路。為了確保線性最近鄰量子電路的正確性,使用了兩種故障定位算法進(jìn)行定位,實驗驗證了算法的有效性。
[Abstract]:Quantum logic circuit synthesis is one of the key problems in quantum computer and quantum information technology. In order to realize the function of quantum logic circuit correctly, it is necessary to detect and locate the fault of quantum logic circuit. At present, there are still many problems to be solved in the field of fault detection and localization of quantum logic circuits. The main contributions of this paper are as follows: 1) A fault detection algorithm for quantum logic circuits is proposed. Based on the fixed point fault model of quantum logic circuit, the fault test circuit is designed to generate the minimum fault test set of the circuit. The experimental results of benchmark show that the dimension of complete detection set and test vector generated by the algorithm is small, and the detection speed can be improved effectively. 2) the fault location algorithm of quantum logic circuit and the black box detection algorithm are presented to locate the missing gate fault. The fault location algorithm generates the fault location tree by processing the output table of the fault circuit, and then combines the black box algorithm to locate the fault gate of the fault circuit. The experimental results of benchmark show that the algorithm is efficient and accurate in locating the fault gates of the smaller quantum logic circuits. 3) the preprocessing fault data of the algorithm increases exponentially when the scale of the circuit increases. The problem that the original logic program may collapse when reaching a certain valve domain is discussed. A fast fault gate location algorithm based on information entropy for quantum logic circuits is proposed. The algorithm firstly processes the fault output table, removes a lot of useless data, and then generates the fault location tree according to the corresponding rules. The generated fault location tree height and the number of leaf nodes are small, which effectively improves the speed of detection. 4) in order to meet the requirement of the linear nearest neighbor (LNN) constraint of quantum logic circuits designed for physical realization of quantum circuits, Linear nearest neighbor quantum circuits need to be designed. In order to ensure the correctness of linear nearest neighbor quantum circuits, two fault location algorithms are used, and the effectiveness of the algorithm is verified by experiments.
【學(xué)位授予單位】：南通大學(xué)
【學(xué)位級別】：碩士
【學(xué)位授予年份】：2015
【分類號】：TN791
，
本文編號：2366788
[Abstract]:Quantum logic circuit synthesis is one of the key problems in quantum computer and quantum information technology. In order to realize the function of quantum logic circuit correctly, it is necessary to detect and locate the fault of quantum logic circuit. At present, there are still many problems to be solved in the field of fault detection and localization of quantum logic circuits. The main contributions of this paper are as follows: 1) A fault detection algorithm for quantum logic circuits is proposed. Based on the fixed point fault model of quantum logic circuit, the fault test circuit is designed to generate the minimum fault test set of the circuit. The experimental results of benchmark show that the dimension of complete detection set and test vector generated by the algorithm is small, and the detection speed can be improved effectively. 2) the fault location algorithm of quantum logic circuit and the black box detection algorithm are presented to locate the missing gate fault. The fault location algorithm generates the fault location tree by processing the output table of the fault circuit, and then combines the black box algorithm to locate the fault gate of the fault circuit. The experimental results of benchmark show that the algorithm is efficient and accurate in locating the fault gates of the smaller quantum logic circuits. 3) the preprocessing fault data of the algorithm increases exponentially when the scale of the circuit increases. The problem that the original logic program may collapse when reaching a certain valve domain is discussed. A fast fault gate location algorithm based on information entropy for quantum logic circuits is proposed. The algorithm firstly processes the fault output table, removes a lot of useless data, and then generates the fault location tree according to the corresponding rules. The generated fault location tree height and the number of leaf nodes are small, which effectively improves the speed of detection. 4) in order to meet the requirement of the linear nearest neighbor (LNN) constraint of quantum logic circuits designed for physical realization of quantum circuits, Linear nearest neighbor quantum circuits need to be designed. In order to ensure the correctness of linear nearest neighbor quantum circuits, two fault location algorithms are used, and the effectiveness of the algorithm is verified by experiments.
【學(xué)位授予單位】：南通大學(xué)
【學(xué)位級別】：碩士
【學(xué)位授予年份】：2015
【分類號】：TN791
，
本文編號：2366788
本文鏈接：http://sikaile.net/kejilunwen/dianzigongchenglunwen/2366788.html
最近更新
教材專著
