arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2406.08064quant-ph

具有复杂度保证的基于门的反绝热驱动

Gate-based counterdiabatic driving with complexity guarantees

Dyon van Vreumingen

AI总结:

本文提出一种完全基于门且不依赖启发式的反绝热驱动量子算法,通过正则化绝热规范势抑制非目标跃迁,并给出以最小能隙和保真度误差表示的严格量子门复杂度上界。

摘要:

我们提出一种通用的、完全基于门的反绝热驱动量子算法。该算法不依赖以往变分方法中的启发式策略,而是利用绝热规范势的正则化,仅抑制来自目标本征态的跃迁。这使得能够以该本征态附近最小能隙 $Δ$ 为参数,给出严格的量子门复杂度上界。我们发现,在最坏情况下,该算法最多需要 $\ ilde O(Δ^{-(3 + o(1))} ε^{-(1 + o(1))})$ 个量子门,即可达到至少 $1 - ε^2$ 的目标态保真度,其中 $Δ$ 是最小谱隙。在某些情况下,对能隙的依赖可以改进为二次方。

英文摘要:

We propose a general, fully gate-based quantum algorithm for counterdiabatic driving. The algorithm does not depend on heuristics as in previous variational methods, and exploits regularisation of the adiabatic gauge potential to suppress only the transitions from the eigenstate of interest. This allows for a rigorous quantum gate complexity upper bound in terms of the minimum gap $Δ$ around this eigenstate. We find that, in the worst case, the algorithm requires at most $\tilde O(Δ^{-(3 + o(1))} ε^{-(1 + o(1))})$ quantum gates to achieve a target state fidelity of at least $1 - ε^2$, where $Δ$ is the minimum spectral gap. In certain cases, the gap dependence can be improved to quadratic.

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

↑