| Review on the study of entanglement in quantum computation speedup |
| |
| 作者姓名： | DING ShengChao JIN Zhi |
| |
| 作者单位： | [1]Institute of Computing Technology, Chinese Academy of Sciences, Beijing 100080, China [2]Academy of Mathematics and Systems Science, Chinese Academy of Sciences, Beijing 100080, China [3]Graduate University of Chinese Academy of Sciences, Beijing 100080, China |
| |
| 基金项目： | Supported by the National Natural Science Foundation for Distinguished Young Scholars of China （Grant No. 60625204）, the Key Project of the National Natural Science Foundation of China （Gram No. 60496324）, the National 973 Fundamental Research and Development Program of China （Grant No. 2002CB312004）, the National 863 High-Tech Project of China （Gram No. 2006AA01Z155）, and the Knowledge Innovation Program of the Chinese Academy of Sciences and MADIS |
| |
| 摘 要： | The role the quantum entanglement plays in quantum computation speedup has been widely disputed. Some believe that quantum computation's speedup over classical computation is impossible if entan-glement is absent,while others claim that the presence of entanglement is not a necessary condition for some quantum algorithms. This paper discusses this problem systematically. Simulating quantum computation with classical resources is analyzed and entanglement in known algorithms is reviewed. It is concluded that the presence of entanglement is a necessary but not sufficient condition in the pure state or pseudo-pure state quantum computation speedup. The case with the mixed state remains open. Further work on quantum computation will benefit from the presented results.
|
| 关 键 词： | 量子论 量子纠缠 量子计算 加速 模拟 |
| 收稿时间： | 2007-02-12 |
| 修稿时间： | 2007-02-12 |
Review on the study of entanglement in quantum computation speedup |
| |
| DING ShengChao JIN Zhi.Review on the study of entanglement in quantum computation speedup[J].Chinese Science Bulletin,2007,52(16):2161-2166. |
| |
| Authors: | Ding ShengChao Jin Zhi |
| |
| Institution: | (1) Institute of Computing Technology, Chinese Academy of Sciences, Beijing, 100080, China;(2) Academy of Mathematics and Systems Science, Chinese Academy of Sciences, Beijing, 100080, China;(3) Graduate University of Chinese Academy of Sciences, Beijing, 100080, China |
| |
| Abstract: | The role the quantum entanglement plays in quantum computation speedup has been widely disputed. Some believe that quantum computation's speedup over classical computation is impossible if entan-glement is absent,while others claim that the presence of entanglement is not a necessary condition for some quantum algorithms. This paper discusses this problem systematically. Simulating quantum computation with classical resources is analyzed and entanglement in known algorithms is reviewed. It is concluded that the presence of entanglement is a necessary but not sufficient condition in the pure state or pseudo-pure state quantum computation speedup. The case with the mixed state remains open. Further work on quantum computation will benefit from the presented results. |
| |
| Keywords: | entanglement quantum computation speedup simulation |
| 本文献已被 维普 万方数据 SpringerLink 等数据库收录！ |
| 点击此处可从《中国科学通报(英文版)》浏览原始摘要信息 |
| 点击此处可从《中国科学通报(英文版)》下载免费的PDF全文 |
