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

静态门量子基模计算

Quantum ground-mode computation with static gates

Giuseppe Castagnoli, David Ritz Finkelstein

摘要:

我们开发了一个计算模型来解决布尔网络,通过量子基态计算实现线和门,通过身份以下从角动量代数和统计。门由三维(三重态)对称性表示,由于粒子的不可逆性,并且在整个计算过程中作为运动的常数而同样满足。线的松弛产生网络解。这样的门不花费计算时间,这与更容易的布尔网络的计算时间相当,在布尔网络中,所有作为运动常数实现的门约束被移除。该模型计算在退相干方面具有鲁棒性,并对所有NP问题产生了广义量子加速。

英文摘要:

We develop a computation model for solving Boolean networks by implementing wires through quantum ground-mode computation and gates through identities following from angular momentum algebra and statistics. Gates are represented by three-dimensional (triplet) symmetries due to particle indistinguishability and are identically satisfied throughout computation being constants of the motion. The relaxation of the wires yields the network solutions. Such gates cost no computation time, which is comparable with that of an easier Boolean network where all the gate constraints implemented as constants of the motion are removed. This model computation is robust with respect to decoherence and yields a generalized quantum speed-up for all NP problems.

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

↑