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

量子动态规划

Quantum Dynamic Programming

Jeongrak Son, Marek Gluza, Ryuji Takagi, Nelly H. Y. Ng

AI总结:

本文提出量子动态规划,利用存储的中间量子态相干生成递归步骤酉算子,在定点量子递归中以增加电路宽度为代价实现电路深度的指数级缩减,并展示了其在Grover搜索变体、量子虚时演化及Schmidt基量子态制备中的应用。

摘要:

我们引入动态规划的量子扩展,动态规划是一种利用记忆高效求解递归问题的基本计算方法。我们的创新之处在于展示如何利用存储的中间量子态相干地生成递归步骤酉算子。量子动态规划在广泛的定点量子递归类中实现了电路深度的指数级缩减,尽管这是以增加电路宽度为代价的。有趣的是,当初态为纯态时,这种权衡变得更加有利。通过将我们的方法与传统的无记忆方法混合,我们可以灵活地平衡电路深度和宽度,以在具有固定硬件约束的量子设备上优化性能。最后,我们展示了量子动态规划在若干量子递归中的应用,包括Grover搜索的一个变体、量子虚时演化,以及一种在其Schmidt基中不经意地制备量子态的新协议。

英文摘要:

We introduce a quantum extension of dynamic programming, a fundamental computational method that efficiently solves recursive problems using memory. Our innovation lies in showing how to coherently generate recursion step unitaries by using memorized intermediate quantum states. Quantum dynamic programming achieves an exponential reduction in circuit depth for a broad class of fixed-point quantum recursions, though this comes at the cost of increased circuit width. Interestingly, the trade-off becomes more favourable when the initial state is pure. By hybridizing our approach with a conventional memoryless one, we can flexibly balance circuit depth and width to optimize performance on quantum devices with fixed hardware constraints. Finally, we showcase applications of quantum dynamic programming to several quantum recursions, including a variant of Grover's search, quantum imaginary-time evolution, and a new protocol for obliviously preparing a quantum state in its Schmidt basis.

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

↑