ITP OpenIR  > 理论物理所1978-2010年知识产出
Quantum algorithms for some well-known NP problems
Guo, H; Long, GL; Li, F; Guo, H , Tsing Hua Univ, Dept Phys, Beijing 100084, Peoples R China.
2002
发表期刊COMMUNICATIONS IN THEORETICAL PHYSICS
ISSN0253-6102
卷号37期号:4页码:424-426
摘要It is known that quantum computer is more powerful than classical computer. In this paper we present quantum algorithms for some famous NP problems in graph theory and combination theory, these quantum algorithms are at least quadratically faster than the classical ones.
部门归属Tsing Hua Univ, Dept Phys, Beijing 100084, Peoples R China; Chinese Acad Sci, Inst Theoret Phys, Beijing 100080, Peoples R China; Chinese Acad Sci, Lanzhou Natl Lab Heavy Ions, Ctr Nucl Theory, Lanzhou 730000, Peoples R China; MOE, Key Lab Quantum Informat & Measurements, Beijing 100084, Peoples R China; Tsing Hua Univ, Ctr Atom & Mol Nanosci, Beijing 100084, Peoples R China; Capital Univ Econ & Business, Basic Educ Sect, Beijing 100070, Peoples R China
学科领域Physics
URL查看原文
收录类别SCI
WOS记录号WOS:000175288100008
引用统计
被引频次:5[WOS]   [WOS记录]     [WOS相关记录]
文献类型期刊论文
条目标识符http://ir.itp.ac.cn/handle/311006/13535
专题理论物理所1978-2010年知识产出
通讯作者Guo, H , Tsing Hua Univ, Dept Phys, Beijing 100084, Peoples R China.
推荐引用方式
GB/T 7714
Guo, H,Long, GL,Li, F,et al. Quantum algorithms for some well-known NP problems[J]. COMMUNICATIONS IN THEORETICAL PHYSICS,2002,37(4):424-426.
APA Guo, H,Long, GL,Li, F,&Guo, H , Tsing Hua Univ, Dept Phys, Beijing 100084, Peoples R China..(2002).Quantum algorithms for some well-known NP problems.COMMUNICATIONS IN THEORETICAL PHYSICS,37(4),424-426.
MLA Guo, H,et al."Quantum algorithms for some well-known NP problems".COMMUNICATIONS IN THEORETICAL PHYSICS 37.4(2002):424-426.
条目包含的文件
文件名称/大小 文献类型 版本类型 开放类型 使用许可
Quantum algorithms f(142KB) 开放获取使用许可请求全文
个性服务
推荐该条目
保存到收藏夹
查看访问统计
导出为Endnote文件
谷歌学术
谷歌学术中相似的文章
[Guo, H]的文章
[Long, GL]的文章
[Li, F]的文章
百度学术
百度学术中相似的文章
[Guo, H]的文章
[Long, GL]的文章
[Li, F]的文章
必应学术
必应学术中相似的文章
[Guo, H]的文章
[Long, GL]的文章
[Li, F]的文章
相关权益政策
暂无数据
收藏/分享
所有评论 (0)
暂无评论
 

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