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

• 来源期刊: 中国科学:物理学 力学 天文学（英文版）
• 年，卷（期）: 2018,（6）
• 页码范围: 1-7
• 页数: 7页
• 语种: 英文

摘要

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.