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

量子计算的一种简化方法

A reductionistic approach to quantum computation

Giuseppe Castagnoli, Dalida Monti

摘要:

在简化方法中,机构被分成以某种标准方式(例如通过机械传动)互连的更简单的部分。我们探讨了在量子运算中移植还原论的可能性。从概念上讲,第一部分通过假设所有“传输”都被移除而彼此独立。因此,整个状态将成为独立部分本征态的张量积的叠加。通过投影所有违反它们的张量积,可以恢复传输。这将通过粒子统计来执行;这个方案的可行性是基于将粒子统计解释为投影。布尔网络的可满足性问题就是这样处理的。这种形式的量子还原论似乎能够驯服量子整体而不削减其丰富性。

英文摘要:

In the reductionistic approach, mechanisms are divided into simpler parts interconnected in some standard way (e.g. by a mechanical transmission). We explore the possibility of porting reductionism in quantum operations. Conceptually, first parts are made independent of each other by assuming that all ``transmissions'' are removed. The overall state would thus become a superposition of tensor products of the eigenstates of the independent parts. Transmissions are restored by projecting off all the tensor products which violate them. This would be performed by particle statistics; the plausibility of this scheme is based on the interpretation of particle statistics as projection. The problem of the satisfiability of a Boolean network is approached in this way. This form of quantum reductionism appears to be able of taming the quantum whole without clipping its richness.

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

↑