3-puzzle量子计算的酉变换矩阵及逻辑线路  

Unitary transformation matrix and logic circuits of 3-puzzle quantum computing

作　　者：许精明[1] 阮越[1] 

机构地区：[1]安徽工业大学计算机科学与技术学院,安徽马鞍山243002

出　　处：《量子电子学报》2016年第4期469-475,共7页Chinese Journal of Quantum Electronics

基　　金：国家自然科学基金;61003311;安徽省自然科学基金;1308085QF113~~

摘　　要：针对3-puzzle问题,运用量子计算方法分析了节点扩展的酉变换矩阵。对一个3-puzzle问题实例进行了元素编码和节点状态编码,描述了具体的节点扩展酉变换矩阵,并运用量子受控非门逻辑线路实现了酉变换矩阵。讨论了N-puzzle量子计算的线路模型,对量子位的基态和最佳基态的制备作了分析,阐述了N-puzzle启发式搜索量子计算框架。The unitary transformation matrices of nodes expansion are analyzed by using quantum com- puting method for 3-puzzle problem. Element coding and node state coding are performed on a 3-puzzle problem instance. The specific node expansion unitary transformation matrices are described, and the uni- tary transformation matrices are realized by using the quantum controlled-NOT gate logic circuits. A logic circuit model of N-puzzle quantum computing is discussed. The preparation of ground state and optimum ground state of quabits is analyzed, and the N-puzzle heuristic search quantum computing framework is discussed.

关 键 词：量子信息 N-puzzle 受控非门 酉变换矩阵 量子计算 启发式搜索 

分 类 号：O413.1[理学—理论物理]