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

低稳定器复杂度的量子态不是伪随机的

Low-Stabilizer-Complexity Quantum States Are Not Pseudorandom

The University of Texas at Austin(德克萨斯大学奥斯汀分校)

Sabee Grewal, Vishnu Iyer, William Kretschmer, Daniel Liang

AI总结:

本文提出一种高效算法,能将低稳定器复杂度的量子态与Haar随机态区分开,并据此证明Clifford+$T$电路制备计算伪随机量子态需要$ω(\log(n))$个$T$门,得出首个此类下界。

摘要:

我们证明具有“低稳定器复杂度”的量子态可以与Haar随机态高效区分。具体而言,给定一个$n$比特纯态$|ψ\rangle$,我们给出一种高效算法,在承诺$|ψ\rangle$属于以下情况之一时,区分它是(i) Haar随机态,还是(ii) 稳定器保真度至少为$\frac{1}{k}$的态(即与某个稳定器态的保真度至少为$\frac{1}{k}$)。在对$|ψ\rangle$进行黑盒访问的情况下,我们的算法使用$O\\!\left( k^{12} \log(1/δ)\right)$份$|ψ\rangle$副本,耗时$O\\!\left(n k^{12} \log(1/δ)\right)$,以至少$1-δ$的概率成功;若能访问$|ψ\rangle$的状态制备酉(及其逆),则$O\\!\left( k^{3} \log(1/δ)\right)$次查询和$O\\!\left(n k^{3} \log(1/δ)\right)$时间便已足够。作为推论,我们证明任何Clifford+$T$电路都需要$ω(\log(n))$个$T$门来制备计算伪随机量子态,这是首个此类下界。

英文摘要:

We show that quantum states with "low stabilizer complexity" can be efficiently distinguished from Haar-random. Specifically, given an $n$-qubit pure state $|ψ\rangle$, we give an efficient algorithm that distinguishes whether $|ψ\rangle$ is (i) Haar-random or (ii) a state with stabilizer fidelity at least $\frac{1}{k}$ (i.e., has fidelity at least $\frac{1}{k}$ with some stabilizer state), promised that one of these is the case. With black-box access to $|ψ\rangle$, our algorithm uses $O\!\left( k^{12} \log(1/δ)\right)$ copies of $|ψ\rangle$ and $O\!\left(n k^{12} \log(1/δ)\right)$ time to succeed with probability at least $1-δ$, and, with access to a state preparation unitary for $|ψ\rangle$ (and its inverse), $O\!\left( k^{3} \log(1/δ)\right)$ queries and $O\!\left(n k^{3} \log(1/δ)\right)$ time suffice. As a corollary, we prove that $ω(\log(n))$ $T$-gates are necessary for any Clifford+$T$ circuit to prepare computationally pseudorandom quantum states, a first-of-its-kind lower bound.

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

↑