一种改进的量子线性回归算法
An improved quantum-inspired algorithm for linear regression
摘要:
当输入矩阵$A$存储在适用于基于QRAM的状态准备的数据结构中时,我们给出了一个用于线性回归的经典算法,该算法类似于用于低秩矩阵[Wossnig,Zhao和Prakash,Physical Review Letters'18,arXiv:1704.06174]的量子矩阵求逆算法[Harrow,Hassidim和Lloyd,Physical Review Letters'09,arXiv:0811.3171]。也就是说,假设我们给出了一个具有最小非零奇异值$σ$的$A \in \mathbb{C}^{m\times n}$,它支持某些有效的$\ell_2$ -范数重要性抽样查询,以及一个$b \in \mathbb{C}^m$。然后,对于一些满足$\|x - A^+b\| \leq \varepsilon\|A^+b\|$的$x \in \mathbb{C}^n$,我们可以输出计算基中的$|x\rangle$的测量,并输出分别在$\tilde{\mathcal{O}}\big(\frac{\|A\|_{\mathrm{F}}^6\|A\|^6}{σ^{12}\varepsilon^4}\big)$和$\tilde{\mathcal{O}}\big(\frac{\|A\|_{\mathrm{F}}^6\|A\|^2}{σ^8\varepsilon^4}\big)$时间内运行的经典算法的$x$的条目。这对以前的“量子启发”算法进行了改进,至少是$\frac{\|A\|^{16}}{σ^{16}\varepsilon^2}$的一个因素[Chia,Gilyén,Li,Lin,Tang和Wang,STOC'20,arXiv:1910.06151]。因此,我们表明量子计算机在这种QRAM数据结构设置和相关设置中最多可以实现线性回归的12倍加速。我们的工作应用了从草图算法和优化到量子启发文献的技术。与早期的工作不同,这是一个有希望的途径,可以在量子启发的环境中实现经典回归,与未来的量子计算机进行比较。
英文摘要:
We give a classical algorithm for linear regression analogous to the quantum matrix inversion algorithm [Harrow, Hassidim, and Lloyd, Physical Review Letters'09, arXiv:0811.3171] for low-rank matrices [Wossnig, Zhao, and Prakash, Physical Review Letters'18, arXiv:1704.06174], when the input matrix $A$ is stored in a data structure applicable for QRAM-based state preparation. Namely, suppose we are given an $A \in \mathbb{C}^{m\times n}$ with minimum non-zero singular value $σ$ which supports certain efficient $\ell_2$-norm importance sampling queries, along with a $b \in \mathbb{C}^m$. Then, for some $x \in \mathbb{C}^n$ satisfying $\|x - A^+b\| \leq \varepsilon\|A^+b\|$, we can output a measurement of $|x\rangle$ in the computational basis and output an entry of $x$ with classical algorithms that run in $\tilde{\mathcal{O}}\big(\frac{\|A\|_{\mathrm{F}}^6\|A\|^6}{σ^{12}\varepsilon^4}\big)$ and $\tilde{\mathcal{O}}\big(\frac{\|A\|_{\mathrm{F}}^6\|A\|^2}{σ^8\varepsilon^4}\big)$ time, respectively. This improves on previous "quantum-inspired" algorithms in this line of research by at least a factor of $\frac{\|A\|^{16}}{σ^{16}\varepsilon^2}$ [Chia, Gilyén, Li, Lin, Tang, and Wang, STOC'20, arXiv:1910.06151]. As a consequence, we show that quantum computers can achieve at most a factor-of-12 speedup for linear regression in this QRAM data structure setting and related settings. Our work applies techniques from sketching algorithms and optimization to the quantum-inspired literature. Unlike earlier works, this is a promising avenue that could lead to feasible implementations of classical regression in a quantum-inspired settings, for comparison against future quantum computers.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。