English

Distinguishing noisy boson sampling from classical simulations

Quantum Physics 2022-03-08 v9 Computational Complexity

Abstract

Giving a convincing experimental evidence of the quantum supremacy over classical simulations is a challenging goal. Noise is considered to be the main problem in such a demonstration, hence it is urgent to understand the effect of noise. Recently found classical algorithms can efficiently approximate, to any small error, the output of boson sampling with finite-amplitude noise. In this work it is shown analytically and confirmed by numerical simulations that one can efficiently distinguish the output distribution of such a noisy boson sampling from the approximations accounting for low-order quantum multiboson interferences, what includes the mentioned classical algorithms. The number of samples required to tell apart the quantum and classical output distributions is strongly affected by the previously unexplored parameter: density of bosons, i.e., the ratio of total number of interfering bosons to number of input ports of interferometer. Such critical dependence is strikingly reminiscent of the quantum-to-classical transition in systems of identical particles, which sets in when the system size scales up while density of particles vanishes.

Keywords

Cite

@article{arxiv.1905.11458,
  title  = {Distinguishing noisy boson sampling from classical simulations},
  author = {Valery Shchesnovich},
  journal= {arXiv preprint arXiv:1905.11458},
  year   = {2022}
}

Comments

March 4, 2022 : In Appendix C.1 the derivation of the lower bound in Eq. (50) is simplified significantly. However, there is an additional error term in Eq. (13) of the main text

R2 v1 2026-06-23T09:27:35.455Z