论文标题
通用量子计算机的最佳模拟
More Optimal Simulation of Universal Quantum Computers
论文作者
论文摘要
验证量子设备是否赋予计算优势通常需要对其结果进行经典模拟。 The worst-case sampling cost of $L_1$-norm based simulation has plateaued at $\le(2+\sqrt{2})ξ_t δ^{-1}$ in the limit that $t \rightarrow \infty$, where $δ$ is the additive error and $ξ_t$ is the stabilizer extent of a $t$-qubit magic state.通过相关抽样减少$ t $,我们通过减少$ t $的前阶降低减少了这一预位剂。该结果甚至超过了先前的最新模拟器和当前模拟器的平均案例准确地误差。数值演示支持我们的证明。该技术可以广泛应用,以降低$ L_1 $最小化的成本。
Validating whether a quantum device confers a computational advantage often requires classical simulation of its outcomes. The worst-case sampling cost of $L_1$-norm based simulation has plateaued at $\le(2+\sqrt{2})ξ_t δ^{-1}$ in the limit that $t \rightarrow \infty$, where $δ$ is the additive error and $ξ_t$ is the stabilizer extent of a $t$-qubit magic state. We reduce this prefactor 68-fold by a leading-order reduction in $t$ through correlated sampling. The result exceeds even the average-case of the prior state-of-the-art and current simulators accurate to multiplicative error. Numerical demonstrations support our proofs. The technique can be applied broadly to reduce the cost of $L_1$ minimization.