arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv quant-ph/9610026quant-phcond-mat
收藏

紧束缚哈密顿量与量子图灵机

Tight Binding Hamiltonians and Quantum Turing Machines

Paul Benioff

摘要:

本文通过将势与不同类型的计算步骤相关联,扩展了迄今为止在量子计算方面所做的工作。量子图灵机哈密顿量,广义包括潜在的,对应的总和紧束缚哈密顿量,每个具有不同的潜在分布。应用哪种分布取决于初始状态。分析了一个将整数连续枚举为二进制串的例子。可以看出,对于某些初始状态的潜在分布有准晶性质,类似于一个替代序列。

英文摘要:

This paper extends work done to date on quantum computation by associating potentials with different types of computation steps. Quantum Turing machine Hamiltonians, generalized to include potentials, correspond to sums over tight binding Hamiltonians each with a different potential distribution. Which distribution applies is determined by the initial state. An example, which enumerates the integers in succession as binary strings, is analyzed. It is seen that for some initial states the potential distributions have quasicrystalline properties and are similar to a substitution sequence.

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

↑