1. 东南大学计算机科学与工程学院,江苏,南京,210096
2. 河南大学计算机中心,河南,开封,415002
3. 东南大学计算机科学与工程学院,江苏,南京,210096
4. 河南大学计算机中心,河南,开封,415002
纸质出版:2012
移动端阅览
杨忠明, 陈汉武, 王冬. 基于二分法量子可逆逻辑电路综合[J]. 电子学报, 2012,40(5):1045-1049.
YANG Zhong-ming, CHEN Han-wu, WANG Dong. Qubits Reversible Logic Circuits Synthesis Based on Bisection Method[J]. Acta Electronica Sinica, 2012, 40(5): 1045-1049.
杨忠明, 陈汉武, 王冬. 基于二分法量子可逆逻辑电路综合[J]. 电子学报, 2012,40(5):1045-1049. DOI: 10.3969/j.issn.0372-2112.2012.05.030.
YANG Zhong-ming, CHEN Han-wu, WANG Dong. Qubits Reversible Logic Circuits Synthesis Based on Bisection Method[J]. Acta Electronica Sinica, 2012, 40(5): 1045-1049. DOI: 10.3969/j.issn.0372-2112.2012.05.030.
为了能以较小的代价自动高效地构造量子可逆逻辑电路
提出了一种新颖的量子可逆逻辑电路综合方法.该方法通过线拓扑变换和对换演算
利用递归思想
将
n
量子电路综合问题转换成单量子电路综合问题
从而完成电路综合
经过局部优化生成最终电路.该算法综合出全部的3变量可逆函数
未优化时平均需6.41个EGT门
优化后平均只需5.22个EGT门;理论分析表明
综合
n
量子电路最多只需要
n
2
n
-1
个EGT门.与同类算法相比
综合电路所用可逆门的数量大幅减少.同时该算法还避免了时空复杂度太大的问题
便于经典计算机实现.
In order to efficiently automatically construct quantum reversible logic circuits with low cost
a novel method for quantum circuit's synthesis is proposed.Through the line topology transformation and truth table permutation
it converts an
n
-qubit circuit synthesis problem into single quantum circuit synthesis using traditional recursive thought.Then directly generate relevant circuit.After optimization
the quantum reversible logic circuit is synthesized finally.All 3-qubit reversible logic circuits have been synthesized by this method.The average number of EGT gates is only 6.41
and the number is down to 5.22 after optimization.Experimental results show that the number of gates to construct reversible logic circui
ts is less than other methods.For any n-qubit binary logic function
the number of EGT gates is less than
n
2
n
-1
.Meanwhile
it voids the exponential nature of the memory or run-time complexity
and is very simple to implement in classical computer.
0
浏览量
2
下载量
6
CSCD
关联资源
相关文章
相关作者
相关机构
京公网安备11010802024621