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

量子行走的 Krylov 扩展复杂度

Krylov Spread Complexity of Quantum-Walks

Bhilahari Jeevanesan

AI总结:

本文研究图上连续时间量子行走的 Krylov 扩展复杂度,建立其与极限分布的关系,并通过图优化构造极端复杂度图,给出经验上界与精确下界。

摘要:

鉴于量子技术的最新进展,量子态的复杂性是一个重要概念。Krylov 扩展复杂度的思想近来受到关注,其目标是以定量方式刻画这一性质。本文通过在图上连续时间量子行走的背景下考察该测度,为 Krylov 复杂度测度提供了新的认识。文中建立了 Krylov 扩展复杂度与量子行走极限分布概念之间的密切关系。此外,利用一种图优化算法,构造了具有最小和最大长时间平均 Krylov $\ar C$ 复杂度的量子行走图。这揭示了作为 Hilbert 空间维数函数的 $\ar C$ 复杂度的经验上界,以及一个精确下界。

英文摘要:

Given the recent advances in quantum technology, the complexity of quantum states is an important notion. The idea of the Krylov spread complexity has come into focus recently with the goal of capturing this in a quantitative way. The present paper sheds new light on the Krylov complexity measure by exploring it in the context of continuous-time quantum-walks on graphs. A close relationship between Krylov spread complexity and the concept of limiting-distributions for quantum-walks is established. Moreover, using a graph optimization algorithm, quantum-walk graphs are constructed that have minimal and maximal long-time average Krylov $\bar C$-complexity. This reveals an empirical upper bound for the $\bar C$-complexity as a function of Hilbert space dimension and an exact lower bound.

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

↑