arXivDaily arXiv每日学术速递 周一至周五更新
arXiv quant-ph/0311017quant-phcond-mathep-th
收藏

纠缠的普遍性与量子计算的复杂性

Universality of Entanglement and Quantum Computation Complexity

Roman Orus, Jose I. Latorre

摘要:

我们研究了NP完全精确覆盖问题和Grover问题中Shor因子分解算法和绝热量子算法中量子相变的纠缠标度的普遍性。Shor算法的分析结果表明,熵与量子比特数成线性比例,因此难以实现有效的经典模拟协议。对量子绝热演化精确覆盖算法也得到了类似的结果,这也表明了系统在附近演化的量子相变的普遍性.另一方面,Grover绝热算法中的纠缠即使在临界点也是有界的。纠缠的标度分类似乎是模拟量子相变的计算复杂性的自然分级。

英文摘要:

We study the universality of scaling of entanglement in Shor's factoring algorithm and in adiabatic quantum algorithms across a quantum phase transition for both the NP-complete Exact Cover problem as well as the Grover's problem. The analytic result for Shor's algorithm shows a linear scaling of the entropy in terms of the number of qubits, therefore difficulting the possibility of an efficient classical simulation protocol. A similar result is obtained numerically for the quantum adiabatic evolution Exact Cover algorithm, which also shows universality of the quantum phase transition the system evolves nearby. On the other hand, entanglement in Grover's adiabatic algorithm remains a bounded quantity even at the critical point. A classification of scaling of entanglement appears as a natural grading of the computational complexity of simulating quantum phase transitions.

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

↑