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

改进的特征路径跟踪的界

Improved Bounds for Eigenpath Traversal

Hao-Tien Chiang, Guanglei Xu, Rolando D. Somma

摘要:

我们提出了一个由连续族哈密顿量的基态定义的路径长度的谱隙G的界限。我们使用这个界限,以获得一个显着的改善最近提出的方法的量子绝热态变换和本征路径遍历的成本。特别地,我们证明了基于演化随机化的方法,这是绝热量子计算的一个简单扩展,具有1/G ^2阶的平均代价,而基于定点搜索的方法,具有1/G^(3/2)阶的最大代价。另外,如果哈密尔顿算子满足无挫挫性质,则这样的成本可以分别进一步改进到1/G^(3/2)和1/G阶。当能隙很小时,我们的方法比绝热量子计算具有重要的优势,在绝热量子计算中,成本是1/G^3。

英文摘要:

We present a bound on the length of the path defined by the ground states of a continuous family of Hamiltonians in terms of the spectral gap G. We use this bound to obtain a significant improvement over the cost of recently proposed methods for quantum adiabatic state transformations and eigenpath traversal. In particular, we prove that a method based on evolution randomization, which is a simple extension of adiabatic quantum computation, has an average cost of order 1/G^2, and a method based on fixed-point search, has a maximum cost of order 1/G^(3/2). Additionally, if the Hamiltonians satisfy a frustration-free property, such costs can be further improved to order 1/G^(3/2) and 1/G, respectively. Our methods offer an important advantage over adiabatic quantum computation when the gap is small, where the cost is of order 1/G^3.

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

↑