arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2304.05960quant-ph
收藏

量子多分辨率测量及其在量子线性求解器中的应用

Quantum Multi-Resolution Measurement with application to Quantum Linear Solver

Yoshiyuki Saito, Xinwei Lee, Dongsheng Cai, Nobuyoshi Asai

AI总结:

本文提出量子多分辨率测量(QMRM)混合算法,将测量复杂度从 $O(n/ε^2)$ 降至 $O(n\log(1/ε))$,并基于 HHL 算法给出 QMRM-QLS 量子线性求解器及数值验证。

摘要:

量子计算由对应于解的一个量子态以及对某些可观测量进行的测量组成。为了获得精度为 $ε$ 的解,需要 $O(n/ε^2)$ 次测量,其中 $n$ 是问题的规模。这些测量的代价意味着要获得高精度解需要大量的计算时间。在本文中,我们提出量子多分辨率测量(QMRM),这是一种混合量子-经典算法,通过使用一对函数,以 $O(n\log(1/ε))$ 次测量给出精度为 $ε$ 的解。QMRM 在精度为 $ε$ 时的计算代价小于 $O(n/ε^2)$。我们还提出一种名为 QMRM-QLS(量子线性求解器)的算法,作为示例之一,利用 Harrow-Hassidim-Lloyd(HHL)算法求解线性方程组。我们进行了一些数值实验,结果表明 QMRM 能够以 $O(n\log(1/ε))$ 次测量给出精度为 $ε$ 的解。

英文摘要:

Quantum computation consists of a quantum state corresponding to a solution, and measurements with some observables. To obtain a solution with an accuracy $ε$, measurements $O(n/ε^2)$ are required, where $n$ is the size of a problem. The cost of these measurements requires a large computing time for an accurate solution. In this paper, we propose a quantum multi-resolution measurement (QMRM), which is a hybrid quantum-classical algorithm that gives a solution with an accuracy $ε$ in $O(n\log(1/ε))$ measurements using a pair of functions. The QMRM computational cost with an accuracy $ε$ is smaller than $O(n/ε^2)$. We also propose an algorithm entitled QMRM-QLS (quantum linear solver) for solving a linear system of equations using the Harrow-Hassidim-Lloyd (HHL) algorithm as one of the examples. We perform some numerical experiments that QMRM gives solutions to with an accuracy $ε$ in $O(n\log(1/ε))$ measurements.

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

↑