arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1602.04145quant-phcs.CC
收藏

两量子比特可换哈密顿量的复杂性分类

Complexity classification of two-qubit commuting hamiltonians

Adam Bouland, Laura Mančinska, Xue Zhang

摘要:

我们根据计算复杂度对两量子比特交换哈密顿算子进行了分类。假设一个人有一个两量子比特的可交换哈密顿量H,可以应用于任何一对量子比特,从计算基态开始。我们证明了一个二分法定理:或者该模型是有效的经典可模拟的,或者它允许从概率分布中采样,除非多项式层次崩溃,否则不能从经典中采样。此外,唯一可模拟的哈密顿量是那些不能产生纠缠的哈密顿量。这表明,通用的两量子比特交换哈密顿算子可以用于执行在合理假设下经典计算机难以处理的计算任务。我们的证明利用了新的后选择工具和Lie理论。

英文摘要:

We classify two-qubit commuting Hamiltonians in terms of their computational complexity. Suppose one has a two-qubit commuting Hamiltonian H which one can apply to any pair of qubits, starting in a computational basis state. We prove a dichotomy theorem: either this model is efficiently classically simulable or it allows one to sample from probability distributions which cannot be sampled from classically unless the polynomial hierarchy collapses. Furthermore, the only simulable Hamiltonians are those which fail to generate entanglement. This shows that generic two-qubit commuting Hamiltonians can be used to perform computational tasks which are intractable for classical computers under plausible assumptions. Our proof makes use of new postselection gadgets and Lie theory.

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

↑