Review on the study of entanglement in quantum computation speedup  

作　　者：DING ShengChao1,3 & JIN Zhi1,2,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 

出　　处：《Chinese Science Bulletin》2007年第16期2161-2166,共6页

基　　金：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 (Grant No. 60496324);the National 973 Fundamental Research and Development Program of China (Grant No. 2002CB312004);the National 863 High-Tech Project of China (Grant No. 2006AA01Z155);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.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 entanglement 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.

关 键 词：量子论 量子纠缠 量子计算 加速 模拟 

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