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

分区量子子空间展开

Partitioned Quantum Subspace Expansion

Tom O'Leary, Lewis W. Anderson, Dieter Jaksch, Martin Kiffner

AI总结:

本文提出量子子空间展开算法的迭代推广,通过基于方差的判据选择子空间序列,在有限采样噪声下显著提升数值稳定性,且无需额外参数,适合近期量子硬件。

摘要:

我们提出了一种在Krylov基下使用的量子子空间展开算法的迭代推广。该迭代构造通过一系列子空间的最低能量态将它们连接起来。在给定的Krylov子空间中对哈密顿量进行对角化,在单步和顺序两种情况下所需的量子资源相同。我们提出了一种基于方差的判据来确定良好的迭代序列,并提供数值证据表明,在存在有限采样噪声的情况下,这些良好序列相比单步方法展现出改进的数值稳定性。实现该推广需要额外的经典处理,其开销在子空间维度上是多项式的。通过以量子电路深度换取额外测量,量子子空间展开算法似乎是一种适合近期或早期纠错量子硬件的方法。我们的工作表明,限制该方法精度的数值不稳定性可以通过一种无参数的方式得到显著缓解。

英文摘要:

We present an iterative generalisation of the quantum subspace expansion algorithm used with a Krylov basis. The iterative construction connects a sequence of subspaces via their lowest energy states. Diagonalising a Hamiltonian in a given Krylov subspace requires the same quantum resources in both the single step and sequential cases. We propose a variance-based criterion for determining a good iterative sequence and provide numerical evidence that these good sequences display improved numerical stability over a single step in the presence of finite sampling noise. Implementing the generalisation requires additional classical processing with a polynomial overhead in the subspace dimension. By exchanging quantum circuit depth for additional measurements the quantum subspace expansion algorithm appears to be an approach suited to near term or early error-corrected quantum hardware. Our work suggests that the numerical instability limiting the accuracy of this approach can be substantially alleviated in a parameter-free way.

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

↑