含噪量子算法的傅里叶谱
Fourier Spectrum of Noisy Quantum Algorithms
AI总结:
通过傅里叶增长区分量子与经典算法,研究噪声对量子算法的影响,并建立DQC_k、1/2BQP和BQP模型之间的预言机分离。
摘要:
量子计算有望为某些问题提供指数级加速,但完全通用的量子计算机仍遥不可及,且近期设备固有噪声。受此启发,我们研究含噪量子算法以及$\mathsf{BQP}$和$\mathsf{BPP}$之间的景观。我们基于一种称为level-$\ell$傅里叶增长(大小为$\ell$的集合的傅里叶系数绝对值之和)的强大技术来区分量子与经典算法,并表明它也可用于根据所用资源类型区分量子算法。我们表明,作用于量子算法的噪声会以与噪声类型复杂相关的方式抑制其傅里叶增长。具体地,我们研究高度混合态普遍存在的量子计算含噪模型,即:$\mathsf{DQC}_k$算法,其中$k$个量子比特是干净的,其余是最大混合的;以及$\frac{1}{2}\mathsf {BQP}$算法,其中初始状态是最大混合的,但算法在计算结束时获知初始状态。我们建立了$\mathsf{DQC}_k$、$\frac{1}{2}\mathsf{BQP}$和$\mathsf{BQP}$算法傅里叶增长的上界,并利用这些界之间的差异推导出这些模型之间的预言机分离。特别地,我们表明2-Forrelation和3-Forrelation分别在$\mathsf{DQC}_1$和$\frac{1}{2}\mathsf{BQP}$模型中需要$N^{\Omega(1)}$次查询。我们的结果通过一个可能独立感兴趣的新矩阵分解引理证明。
英文摘要:
Quantum computing promises exponential speedups for certain problems, yet fully universal quantum computers remain out of reach and near-term devices are inherently noisy. Motivated by this, we study noisy quantum algorithms and the landscape between $\mathsf{BQP}$ and $\mathsf{BPP}$. We build on a powerful technique to differentiate quantum and classical algorithms called the level-$\ell$ Fourier growth (the sum of absolute values of Fourier coefficients of sets of size $\ell$) and show that it can also be used to differentiate quantum algorithms based on the types of resources used. We show that noise acting on a quantum algorithm dampens its Fourier growth in ways intricately linked to the type of noise. Concretely, we study noisy models of quantum computation where highly mixed states are prevalent, namely: $\mathsf{DQC}_k$ algorithms, where $k$ qubits are clean and the rest are maximally mixed, and $\frac{1}{2}\mathsf {BQP}$ algorithms, where the initial state is maximally mixed, but the algorithm is given knowledge of the initial state at the end of the computation. We establish upper bounds on the Fourier growth of $\mathsf{DQC}_k$, $\frac{1}{2}\mathsf{BQP}$ and $\mathsf{BQP}$ algorithms and leverage the differences between these bounds to derive oracle separations between these models. In particular, we show that 2-Forrelation and 3-Forrelation require $N^{Ω(1)}$ queries in the $\mathsf{DQC}_1$ and $\frac{1}{2}\mathsf{BQP}$ models respectively. Our results are proved using a new matrix decomposition lemma that might be of independent interest.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。