As a signal recovery algorithm, compressed sensing is particularly useful when the data has low-complexity and samples are rare, which matches perfectly with the task of quantum phase estimation (QPE). In this work we present a new Heisenberg-limited QPE algorithm for early quantum computers based on compressed sensing. More specifically, given many copies of a proper initial state and queries to some unitary operators, our algorithm is able to recover the frequency with a total runtime $\mathcal{O}(\epsilon^{-1}\text{poly}\log(\epsilon^{-1}))$, where $\epsilon$ is the accuracy. Moreover, the maximal runtime satisfies $T_{\max}\epsilon \ll \pi$, which is comparable to the state of art algorithms, and our algorithm is also robust against certain amount of noise from sampling. We also consider the more general quantum eigenvalue estimation problem (QEEP) and show numerically that the off-grid compressed sensing can be a strong candidate for solving the QEEP.

翻译：作为一种信号恢复算法，压缩感知在数据具有低复杂度且样本稀少时尤为有用，这与量子相位估计（QPE）任务完美契合。本文提出一种基于压缩感知的、适用于早期量子计算机的新型海森堡极限QPE算法。具体而言，给定多个合适初始态的副本以及对某些酉算子的查询，该算法能够以总运行时间$\mathcal{O}(\epsilon^{-1}\text{poly}\log(\epsilon^{-1}))$恢复频率，其中$\epsilon$为精度。此外，最大运行时间满足$T_{\max}\epsilon \ll \pi$，与现有最优算法相当，且该算法对采样中的一定噪声具有鲁棒性。我们还考虑了更一般的量子特征值估计问题（QEEP），数值实验表明离网格压缩感知有望成为求解QEEP的有力候选方案。