arXivDaily arXiv每日学术速递 周一至周五更新
arXiv quant-ph/0511272quant-phcs.CC
收藏

Quantum Advantage without Entanglement

Dan Kenigsberg, Tal Mor, Gil Ratsaby

英文摘要:

We study the advantage of pure-state quantum computation without entanglement over classical computation. For the Deutsch-Jozsa algorithm we present the maximal subproblem that can be solved without entanglement, and show that the algorithm still has an advantage over the classical ones. We further show that this subproblem is of greater significance, by proving that it contains all the Boolean functions whose quantum phase-oracle is non-entangling. For Simon's and Grover's algorithms we provide simple proofs that no non-trivial subproblems can be solved by these algorithms without entanglement.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑