基于量子衍生算法的8-puzzle问题分析  

Analysis on quantum-inspired algorithm for 8-puzzle

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

机构地区：[1]安徽工业大学计算机科学与技术学院,安徽马鞍山243002 [2]东南大学计算科学与工程学院,江苏南京210096

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

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

摘　　要：阐述了量子编码形式的多样性,概述了8-puzzle启发式搜索问题的量子衍生算法与计算策略。通过设置扩展深度界限,运用量子计数器和酉变换操作进行8-puzzle问题的量子计算,比较了量子衍生算法与经典算法,对启发式智能搜索在量子计算机上的实现方式作了进一步的讨论。The diversity of quantum coding was expounded.Heuristic function in quantum-inspired computation for 8-puzzle was analyzed.A quantum-inspired algorithm and computing strategies based on heuristic function were presented.Quantum counter and unitary transformation operation were used to complete quantum computing for 8-puzzle problem,and quantum counter was set to maximum extension depth value.Quantum-inspired algorithm was compared with the classical algorithm.Finally,how to implement a quantum computer for the heuristic intelligent search was discussed further.

关 键 词：量子信息 8-puzzle 量子衍生算法 启发函数 智能搜索 

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