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

厄米矩阵光滑函数的量子计算机实现

Implementing smooth functions of a Hermitian matrix on a quantum computer

Sathyawageeswar Subramanian, Steve Brierley, Richard Jozsa

摘要:

我们回顾了在量子计算机上实现稀疏厄米矩阵A的光滑函数f(A)的现有方法,并分析了这些技术的进一步组合,这些技术在某些情况下具有简单和资源消耗的优点。我们的构造使用酉方法与切比雪夫多项式近似的线性组合。我们得到的查询复杂度是O(log C/eps),其中eps是近似精度,C>0是函数f在感兴趣的域上的导数的幅度的上界。成功概率取决于f的泰勒级数系数的1-范数、矩阵的稀疏性d,并且与目标矩阵f(A)的最小奇异值成反比。

英文摘要:

We review existing methods for implementing smooth functions f(A) of a sparse Hermitian matrix A on a quantum computer, and analyse a further combination of these techniques which has some advantages of simplicity and resource consumption in some cases. Our construction uses the linear combination of unitaries method with Chebyshev polynomial approximations. The query complexity we obtain is O(log C/eps) where eps is the approximation precision, and C>0 is an upper bound on the magnitudes of the derivatives of the function f over the domain of interest. The success probability depends on the 1-norm of the Taylor series coefficients of f, the sparsity d of the matrix, and inversely on the smallest singular value of the target matrix f(A).

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

↑