中国科学院机构知识库网格
Chinese Academy of Sciences Institutional Repositories Grid
Quantum search algorithm based on fuzzy problem

文献类型:会议论文

作者Zhuang, Jiayu (1) ; Zhao, Junsuo (1) ; Xu, Fanjiang (1) ; Zhan, Wenjun (1) ; Li, Dan (1) ; Zhang, Heng (1)
出版日期2014
会议名称2013 3rd International Conference on Advanced Materials and Information Technology Processing, AMITP 2013
会议日期October 1, 2013 - October 2, 2013
会议地点Los Angeles, CA, United states
页码759-764
中文摘要A quantum computation problem of quantum search is discussed in this paper. This paper focused on researching the quantum search problem with an unknown amount of solutions. Grover's search algorithm, the most commonly used quantum search algorithm, is introduced in detail. The flow of quantum search algorithm and the quantum procedure model are shown. And the iteration steps in different quantum search problems are analyzed. The quantum search algorithm is powerless in fuzzy search problems by simulation and mathematical analysis. © 2014 WIT Press.
英文摘要A quantum computation problem of quantum search is discussed in this paper. This paper focused on researching the quantum search problem with an unknown amount of solutions. Grover's search algorithm, the most commonly used quantum search algorithm, is introduced in detail. The flow of quantum search algorithm and the quantum procedure model are shown. And the iteration steps in different quantum search problems are analyzed. The quantum search algorithm is powerless in fuzzy search problems by simulation and mathematical analysis. © 2014 WIT Press.
收录类别EI
会议录出版地WITPress
语种英语
ISSN号17433533
ISBN号9781845648534
源URL[http://ir.iscas.ac.cn/handle/311060/16612]  
专题软件研究所_软件所图书馆_会议论文
推荐引用方式
GB/T 7714
Zhuang, Jiayu ,Zhao, Junsuo ,Xu, Fanjiang ,et al. Quantum search algorithm based on fuzzy problem[C]. 见:2013 3rd International Conference on Advanced Materials and Information Technology Processing, AMITP 2013. Los Angeles, CA, United states. October 1, 2013 - October 2, 2013.

入库方式: OAI收割

来源:软件研究所

浏览0
下载0
收藏0
其他版本

除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。