arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1806.08863quant-phcond-mat.str-el
收藏

深度为2的量子线路的纠缠谱

Entanglement spectroscopy with a depth-two quantum circuit

Yigit Subasi, Lukasz Cincio, Patrick J. Coles

摘要:

有噪声的中间尺度量子(NISQ)计算机具有门错误和退相干,限制了可以在其上实现的电路的深度。NISQ算法的策略是以增加量子位数为代价来减少电路深度。在这里,我们利用这种权衡的应用程序称为纠缠光谱,其中一个计算的纠缠状态$| ψ\rangle$系统$AB$通过评估的Rényi熵的减少状态$ρ_A = {\rm Tr}_B(| ψ\rangle \langle ψ|)$。对于$k$ -量子比特状态$ρ(k)$,通过${\rm Tr}(ρ(k)^{n})$计算$n$阶的Rényi熵,对于经典计算机,在$k$中复杂度呈指数增长。Johri、Steiger和Troyer [PRB 96,195136(2017)]介绍了一种量子算法,该算法需要$| ψ\rangle$的$n$副本,并且其深度在$k*n$中线性缩放。在这里,我们提出了一个量子算法,需要两倍的量子比特资源($2n$副本的$| ψ\rangle$),但与深度是独立的$k$和$n$。令人惊讶的是,这个深度只有两个门。我们的数值模拟表明,这种短的深度导致增加的鲁棒性噪声。

英文摘要:

Noisy intermediate-scale quantum (NISQ) computers have gate errors and decoherence, limiting the depth of circuits that can be implemented on them. A strategy for NISQ algorithms is to reduce the circuit depth at the expense of increasing the qubit count. Here, we exploit this trade-off for an application called entanglement spectroscopy, where one computes the entanglement of a state $| ψ\rangle$ on systems $AB$ by evaluating the Rényi entropy of the reduced state $ρ_A = {\rm Tr}_B(| ψ\rangle \langle ψ|)$. For a $k$-qubit state $ρ(k)$, the Rényi entropy of order $n$ is computed via ${\rm Tr}(ρ(k)^{n})$, with the complexity growing exponentially in $k$ for classical computers. Johri, Steiger, and Troyer [PRB 96, 195136 (2017)] introduced a quantum algorithm that requires $n$ copies of $| ψ\rangle$ and whose depth scales linearly in $k*n$. Here, we present a quantum algorithm requiring twice the qubit resources ($2n$ copies of $| ψ\rangle$) but with a depth that is independent of both $k$ and $n$. Surprisingly this depth is only two gates. Our numerical simulations show that this short depth leads to an increased robustness to noise.

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

↑