基于位运算的量子可逆逻辑电路快速综合算法  

Speedy Algorithm for Synthesis of Quantum Reversible Logic Circuits Based on Bit Operation

作　　者：李志强[1] 陈汉武[1] 李文骞[1] 

机构地区：[1]东南大学计算机科学与工程学院

出　　处：《计算机科学》2008年第3期13-17,共5页Computer Science

基　　金：国家自然科学基金(60572071);国家自然科学基金会重大研究计划(90412014);江苏省自然科学基金(BK2005053)(BM2006504);江苏省高校自然科学基金资助项目(06KJB520137)

摘　　要：量子可逆逻辑电路是构建量子计算机的基本单元。本文结合可逆逻辑电路综合的多种算法,根据可逆逻辑电路综合的本质是置换问题,巧妙应用位运算构造高效完备的Hash函数,提出了基于Hash表的新颖高效的量子可逆逻辑电路综合算法,可使用多种量子门,以极高的效率生成最优的量子可逆逻辑电路,从理论上实现制造量子电路的成本最低。按照国际同行认可的3变量可逆函数测试标准,该算法不仅能够生成全部最优电路,而且运行速度远远超过其它算法。实验结果表明,该算法按最小长度标准综合电路的平均速度是目前最好结果的69.8倍。Quantum reversible logic circuits are basic elements of constructing quantum computer. This paper absorbs all kinds of ideas of synthesis of reversible logic circuits. Given that the essence of synthesizing reversible logic circuits is permutation, we use bit operation to construct the novel and perfect Hash function and present an efficient algorithm which can construct optimal quantum reversible logic circuits with various types of gates by using the Hash table and produce quantum circuits with minimal cost in theory. Judging by the internationally recognized reversible functions of three variables, the algorithm not only synthesizes all optimal reversible logic circuits, but also runs extremely faster than other ones. The experimental results show that the average speed of the algorithm which synthesizes circuit with minimum length is 69.8 times that of currently best result.

关 键 词：量子电路优化 位运算 完备Hash函数 可逆逻辑电路 

分 类 号：TP38[自动化与计算机技术—计算机系统结构] TN791[自动化与计算机技术—计算机科学与技术]