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

置换量子计算

Permutational Quantum Computing

Stephen P. Jordan

摘要:

在拓扑量子计算中,粒子轨迹的几何细节是无关紧要的;只有拓扑才重要。更进一步,我们考虑一种计算模型,它甚至不考虑粒子轨迹的拓扑结构,而是通过排列粒子来计算。拓扑量子计算需要任意子,而置换量子计算可以用普通的自旋1/2粒子进行,使用Marzuoli和Rasetti的自旋网络方案的变体。我们不知道置换计算是否是普适的。它可能代表BQP中的一个新的复杂性类。然而,置换量子计算机可以在多项式时间内近似对称群的某些不可约表示的矩阵元素,并模拟量子引力的庞扎诺-雷吉自旋泡沫模型中的某些过程。没有多项式时间的经典算法,这些问题是已知的。

英文摘要:

In topological quantum computation the geometric details of a particle trajectory are irrelevant; only the topology matters. Taking this one step further, we consider a model of computation that disregards even the topology of the particle trajectory, and computes by permuting particles. Whereas topological quantum computation requires anyons, permutational quantum computation can be performed with ordinary spin-1/2 particles, using a variant of the spin-network scheme of Marzuoli and Rasetti. We do not know whether permutational computation is universal. It may represent a new complexity class within BQP. Nevertheless, permutational quantum computers can in polynomial time approximate matrix elements of certain irreducible representations of the symmetric group and simulate certain processes in the Ponzano-Regge spin foam model of quantum gravity. No polynomial time classical algorithms for these problems are known.

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

↑