欢迎您！东篱公司
退出
-
申报数据库
-
立项数据库
-
成果数据库
-
项目获奖数据库
中文摘要：
许多量子电路综合算法由于指数级时间与空间复杂度，只能用可逆逻辑门综合3量子逻辑电路，仅有少数算法实现用量子非门，控制非门，控制V门与控制V＋门（NCV）综合3量子逻辑电路，主要方法是将电路综合问题简化为四值逻辑综合问题．本文提出用NCV门构造新型量子逻辑门库，该库与NCV门库在综合最优3量子逻辑电路上等价，因此又可将四值逻辑综合问题进一步简化为更易求解的二值逻辑综合问题，使用基于完备Hash函数的3量子电路快速综合算法，快速生成全部最优的3量子逻辑电路，以最小代价综合电路的平均速度是目前最好结果Maslov2007的近127倍．
英文摘要：
Owing to the exponential nature of the memory or run-lLrne complexity,many existing methods can only synthe- size 3-qubit logic circuits using quantum logic gate library, however, a few can optimally synthesize 3-qubit logic circuits for quan- tum NOT, CNOT, Controlled-V and Controlled-V ＋ （NCV）gates, the key approach reduces the NCV quantum circuit synthesis problem to four-valued logic synthesis. This paper proposes using NCV gates to create a new quantum logic gate library, which is exactly the same as NCV gate library in the synthesis of all optimal 3-qubit circuits,thus it also reduces the four-valued logic syn- thesis to easily solved two-valued logic synthesis. We present a 3-qubit efficient synthesis algorithms based on perfect hash function, which can quickly construct all optimal 3-qubit circuits--the average speed that synthesizes circuits with minimum cost is nearly 127 times faster than that of the best result of Maslov 2007.
同期刊论文项目
同项目期刊论文
REALIZATION OF A NEW PERMUTATIVE GATE LIBRARY USING CONTROLLED-KTH-ROOT-OF-NOT QUANTUM GATES FOR EXA
Deterministic secure quantum communication without unitary operation based on high-dimensional entan
期刊信息
位置：