用类Deutsch量子算法证明纠缠的连续性
Demonstration of the Essentiality of Entanglement in a Deutsch-like Quantum Algorithm
摘要：
量子算法可以有效地解决一些经典的棘手问题，利用量子并行。迄今为止，量子纠缠是否适用于量子计算仍是一个有争议的问题。在这里，我们提出了一个新的量子算法，表明纠缠可以帮助获得优于经典算法，甚至量子算法没有纠缠。此外，我们使用超导量子比特实现实验来证明我们提出的算法。我们的结果表明了该算法的可行性，并表明纠缠对于量子计算中某些问题的量子加速是必不可少的，这为将来开发有用的量子算法提供了可靠和明确的指导。
英文摘要：
Quantum algorithms could efficiently solve certain classically intractable problems by exploiting quantum parallelism. To date, whether the quantum entanglement is useful or not for quantum computing is still a question of debate. Here, we present a new quantum algorithm to show that entanglement could help to gain advantage over classical algorithm and even the quantum algorithm without entanglement. Furthermore, we implement experiments to demonstrate our proposed algorithm using superconducting qubits. Our results show the viability of the algorithm and suggest that entanglement is essential in getting quantum speedup for certain problems in quantum computing, which provide a reliable and clear guidance for developing useful quantum algorithms in future.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
