Demonstration of essentiality of entanglement in a Deutsch-like quantum algorithm  

作　　者：He-Liang Huang Ashutosh K. Goswami Wan-Su Bao Prasanta K. Panigrahi 

机构地区：[1]Chinese Academy Sciences Centre for Excellence and Synergetic Innovation Centre in Quantum Information and Quantum Physics, University of Science and Technology of China, Hefei 230026, China [2]Hefei National Laboratory for Physical Sciences at Microscale, Department of modern Physics, University of Science and Technology of China, Hefei 230026, China [3]Indian Institute of Science Education and Research Kolkata, Mohanpur 741 246, India

出　　处：《Science China(Physics,Mechanics & Astronomy)》2018年第6期1-7,共7页中国科学：物理学、力学、天文学（英文版）

基　　金：supported by the National Basic Research Program of China (Grant No. 2013CB338002);the National Natural Science Foundation of China (Grant Nos. 11504430, and 61502526)

摘　　要：Quantum algorithms can be used to efficiently solve certain classically intractable problems by exploiting quantum parallelism.However, the effectiveness of quantum entanglement in quantum computing remains a question of debate. This study presents a new quantum algorithm that shows entanglement could provide advantages over both classical algorithms and quantum algorithms without entanglement. Experiments are implemented to demonstrate the proposed algorithm using superconducting qubits.Results show the viability of the algorithm and suggest that entanglement is essential in obtaining quantum speedup for certain problems in quantum computing. The study provides reliable and clear guidance for developing useful quantum algorithms.Quantum algorithms can be used to efficiently solve certain classically intractable problems by exploiting quantum parallelism. However, the effectiveness of quantum entanglement in quantum computing remains a question of debate. This study presents a new quantum algorithm that shows entanglement could provide advantages over both classical algorithms and quantum algo- rithms without entanglement. Experiments are implemented to demonstrate the proposed algorithm using superconducting qubits. Results show the viability of the algorithm and suggest that entanglement is essential in obtaining quantum speedup for certain problems in quantum computing. The study provides reliable and clear guidance for developing useful quantum algorithms.

关 键 词：quantum computing quantum entanglement quantum algorithm Deutsch＇s problem 

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