稀疏对称矩阵对角元幂的估计是BQP-完全的
Estimating diagonal entries of powers of sparse symmetric matrices is BQP-complete
摘要:
设A是大小为N的实对称矩阵,使得每行中的非零元素的数量是N中的多对数,并且这些元素的位置和值由有效可计算函数指定。考虑估计矩阵A^m的任意对角元(A^m)_jj的问题,误差为εb^m,其中b是A的范数的先验上界,m和ε分别是N中的多对数和反多对数.我们证明了这个问题是BQP-完全的。它可以在量子计算机上有效地解决,方法是重复地将A的测量值应用于第j个基向量,并将结果提高到m次幂。相反,解决BQP中的问题的每个量子线路可以被编码成稀疏矩阵,使得一些基向量|j>对应于输入的两个不同的频谱测量取决于输入是否被接受。这些测量可以通过估计某个适当选择的m的第m个统计矩来区分,即,由A^m的第j个对角线项。当推广到非对角元素时,这个问题仍然存在于BQP中,并且如果A只有-1,0和1作为元素,它仍然是BQP困难的。
英文摘要:
Let A be a real symmetric matrix of size N such that the number of the non-zero entries in each row is polylogarithmic in N and the positions and the values of these entries are specified by an efficiently computable function. We consider the problem of estimating an arbitrary diagonal entry (A^m)_jj of the matrix A^m up to an error of εb^m, where b is an a priori given upper bound on the norm of A, m and εare polylogarithmic and inverse polylogarithmic in N, respectively. We show that this problem is BQP-complete. It can be solved efficiently on a quantum computer by repeatedly applying measurements of A to the jth basis vector and raising the outcome to the mth power. Conversely, every quantum circuit that solves a problem in BQP can be encoded into a sparse matrix such that some basis vector |j> corresponding to the input induces two different spectral measures depending on whether the input is accepted or not. These measures can be distinguished by estimating the mth statistical moment for some appropriately chosen m, i.e., by the jth diagonal entry of A^m. The problem is still in BQP when generalized to off-diagonal entries and it remains BQP-hard if A has only -1, 0, and 1 as entries.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。