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

静态门量子基态计算

Quantum ground-state computation with static gates

Giuseppe Castagnoli, David Ritz Finkelstein

摘要:

我们开发了一个求解布尔网络的计算模型,该模型通过量子基态计算实现了连线,并通过角动量代数和统计学的恒等式实现了门。门是静态的,因为它们贡献哈密顿量0,并保持为运动常数;只有电线是动态的。正如自旋1/2构成理想的1位存储元件,自旋1构成理想的3位门。这样的门不需要计算时间:仅仅放松导线就能解决网络问题。我们比较计算时间与一个更容易的布尔网络,其中所有的门的约束被简单地删除。这种计算模型是强大的退相干,并产生一个广义的量子加速所有NP问题。

英文摘要:

We develop a computation model for solving Boolean networks that implements wires through quantum ground-state computation and implements gates through identities following from angular momentum algebra and statistics. The gates are static in the sense that they contribute Hamiltonian 0 and hold as constants of the motion; only the wires are dynamic. Just as a spin 1/2 makes an ideal 1-bit memory element, a spin 1 makes an ideal 3-bit gate. Such gates cost no computation time: relaxing the wires alone solves the network. We compare computation time with that of an easier Boolean network where all the gate constraints are simply removed. This computation model is robust with respect to decoherence and yields a generalized quantum speed-up for all NP problems.

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

↑