Polynomial-time additive-error estimation of output probabilities for shallow quantum circuits

We give a deterministic classical algorithm that estimates $|\langle x|U|0^n\rangle|^2$ to additive error $\varepsilon$ in $\mathrm{poly}(n, 1/\varepsilon)$ time, where $U$ is a constant-depth quantum circuit comprised of gates with bounded fan-in and arbitrary connectivity, and $x$ is an arbitrary $n$-bit output string. This improves over prior state-of-the-art algorithms that takes $n^{O(log(n))}$ time for the same task, $n^{O(log(log(n))}$ when $U$ is geometrically local, and $n^{O(1)}$ for 2D geometrically-local circuits.

Source: arXiv:2610.02146v1 - http://arxiv.org/abs/2610.02146v1 PDF: https://arxiv.org/pdf/2610.02146v1 Original Link: http://arxiv.org/abs/2610.02146v1