Polynomial-Time Classical Simulation of Noisy IQP Circuits with Constant Depth
<|reference_start|>Polynomial-Time Classical Simulation of Noisy IQP Circuits with Constant Depth: Sampling from the output distributions of quantum computations comprising only commuting gates, known as instantaneous quantum polynomial (IQP) computations, is believed to be intractable for classical computers, and hence this task has become a leading candidate for testing the capabilities of quantum devices. Here we demonstrate that for an arbitrary IQP circuit undergoing dephasing or depolarizing noise, whose depth is greater than a critical $O(1)$ threshold, the output distribution can be efficiently sampled by a classical computer. Unlike other simulation algorithms for quantum supremacy tasks, we do not require assumptions on the circuit's architecture, on anti-concentration properties, nor do we require $\Omega(\log(n))$ circuit depth. We take advantage of the fact that IQP circuits have deep sections of diagonal gates, which allows the noise to build up predictably and induce a large-scale breakdown of entanglement within the circuit. Our results suggest that quantum supremacy experiments based on IQP circuits may be more susceptible to classical simulation than previously thought.<|reference_end|>
@article{rajakumar2024polynomial-time,
    title={Polynomial-Time Classical Simulation of Noisy IQP Circuits with Constant
  Depth},
    author={Joel Rajakumar, James D. Watson, Yi-Kai Liu},
    journal={arXiv preprint arXiv:2403.14607},
    year={2024},
    archivePrefix={arXiv},
    eprint={2403.14607},
    primaryClass={quant-ph cs.CC}
}