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

在中期量子计算机上实现任意酉线性组合

Implementing any Linear Combination of Unitaries on Intermediate-term Quantum Computers

Shantanav Chakraborty

AI总结:

本文提出三种实现任意酉线性组合(LCU)的新方法,通过减少辅助量子比特和控制操作降低量子资源消耗,并应用于哈密顿量模拟、基态制备等问题,在保持量子优势的同时统一并改进了量子空间搜索算法。

摘要:

我们开发了三种新方法来实现任意酉线性组合(LCU),这是一种具有广泛应用且强大的量子算法工具。标准LCU过程需要多个辅助量子比特和复杂的多量子比特控制操作,而我们的方法消耗的量子资源显著减少。第一种方法(单辅助比特LCU)用于估计相对于由LCU过程制备的任意量子态的可观测量的期望值,仅需单个辅助量子比特,且无需多量子比特控制操作。第二种方法(模拟LCU)是一种简单、基于物理动机的LCU连续时间模拟,专为混合量子比特-量子模系统定制。第三种方法(无辅助比特LCU)完全不需要辅助量子比特,适用于当我们对由LCU过程制备的量子态在某个感兴趣子空间中的投影感兴趣时。我们将前两种技术应用于开发一系列实际问题的量子算法,涵盖哈密顿量模拟、基态制备与性质估计以及量子线性系统。值得注意的是,尽管消耗的量子资源更少,它们仍保持了可证明的量子优势。第三种技术使我们能够将离散和连续时间量子游走与其经典对应物联系起来。它还统一了这两个框架中最近开发的最优量子空间搜索算法,并促成了需要更少辅助量子比特的新算法的开发。总体而言,我们的结果具有通用性,可轻松应用于此处未涉及的其他问题。

英文摘要:

We develop three new methods to implement any Linear Combination of Unitaries (LCU), a powerful quantum algorithmic tool with diverse applications. While the standard LCU procedure requires several ancilla qubits and sophisticated multi-qubit controlled operations, our methods consume significantly fewer quantum resources. The first method (Single-Ancilla LCU) estimates expectation values of observables with respect to any quantum state prepared by an LCU procedure while requiring only a single ancilla qubit, and no multi-qubit controlled operations. The second approach (Analog LCU) is a simple, physically motivated, continuous-time analogue of LCU, tailored to hybrid qubit-qumode systems. The third method (Ancilla-free LCU) requires no ancilla qubit at all and is useful when we are interested in the projection of a quantum state (prepared by the LCU procedure) in some subspace of interest. We apply the first two techniques to develop new quantum algorithms for a wide range of practical problems, ranging from Hamiltonian simulation, ground state preparation and property estimation, and quantum linear systems. Remarkably, despite consuming fewer quantum resources they retain a provable quantum advantage. The third technique allows us to connect discrete and continuous-time quantum walks with their classical counterparts. It also unifies the recently developed optimal quantum spatial search algorithms in both these frameworks, and leads to the development of new ones that require fewer ancilla qubits. Overall, our results are quite generic and can be readily applied to other problems, even beyond those considered here.

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

↑