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

相干链路辅助的量子本征态广播

Quantum eigenstate broadcasting assisted by a coherent link

Benjamin F. Schiffer, Jordi Tura

AI总结:

本文研究分布式量子计算中利用相干链路和有限纠缠辅助广播哈密顿量本征态,证明在近收敛区域可将非目标振幅的平均相对抑制从单设备的1/e≈0.37改善至1/(2√e)≈0.30,从而降低本征态制备的电路深度。

摘要:

制备局域哈密顿量的基态是理解量子多体系统的关键问题,在多个物理学领域具有应用,并与组合优化存在联系。虽然已有多种量子算法能够从初始近似出发,以高精度和可证明的保证制备基态,但当前设备仍受限于浅层电路。本文考虑分布式量子计算架构中 Alice 和 Bob 希望制备同一哈密顿量本征态的场景。我们证明,当设备之间可以共享有限纠缠时,本征态制备算法的电路深度可以降低。尤其是在其中一方拥有近乎完美的本征态时,该本征态可以更高效地广播给另一方。我们的方法只需要每个设备有一个辅助量子比特与外部纠缠。我们表明,在近收敛区域,协议每次运行对非目标振幅的平均相对抑制改善为 $1/(2\sqrt{e}) \approx 0.30$,优于单一设备单独运行同一协议所达到的平均相对抑制 $1/e\approx 0.37$。

英文摘要:

Preparing the ground state of a local Hamiltonian is a crucial problem in understanding quantum many-body systems, with applications in a variety of physics fields and connections to combinatorial optimization. While various quantum algorithms exist which can prepare the ground state with high precision and provable guarantees from an initial approximation, current devices are limited to shallow circuits. Here we consider the setting where Alice and Bob, in a distributed quantum computing architecture, want to prepare the same Hamiltonian eigenstate. We demonstrate that the circuit depth of the eigenstate preparation algorithm can be reduced when the devices can share limited entanglement. Especially so in the case where one of them has a near-perfect eigenstate, which is more efficiently broadcast to the other device. Our approach requires only a single auxiliary qubit per device to be entangled with the outside. We show that, in the near-convergent regime, the average relative suppression of unwanted amplitudes is improved to $1/(2\sqrt{e}) \approx 0.30$ per run of the protocol, outperforming the average relative suppression of $1/e\approx 0.37$ achieved with a single device alone for the same protocol.

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

↑