arXivDaily arXiv每日学术速递 周一至周五更新
arXiv quant-ph/0601030quant-phcond-mat.other
收藏

Efficient solvability of Hamiltonians and limits on the power of some quantum computational models

Rolando Somma, Howard Barnum, Gerardo Ortiz, Emanuel Knill

英文摘要:

We consider quantum computational models defined via a Lie-algebraic theory. In these models, specified initial states are acted on by Lie-algebraic quantum gates and the expectation values of Lie algebra elements are measured at the end. We show that these models can be efficiently simulated on a classical computer in time polynomial in the dimension of the algebra, regardless of the dimension of the Hilbert space where the algebra acts. Similar results hold for the computation of the expectation value of operators implemented by a gate-sequence. We introduce a Lie-algebraic notion of generalized mean-field Hamiltonians and show that they are efficiently ("exactly") solvable by means of a Jacobi-like diagonalization method. Our results generalize earlier ones on fermionic linear optics computation and provide insight into the source of the power of the conventional model of quantum computation.

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

↑