Boson sampling is fragile to loss
Abstract
Boson sampling experiments aim to demonstrate quantum computational advantage with increasing numbers of interfering photons. A central question is whether their computational hardness survives under photon loss. We show that even an arbitrarily small nonzero uniform loss rate permits efficient classical sampling in the average case when the rate remains fixed as the system grows. We exploit how loss suppresses correlations involving many photons to approximate the full output distribution using low correlation orders. The resulting samplers run in time polynomial in system size and inverse total variation error, with the error averaged over Haar random interferometers. The results apply to Fock state boson sampling with single-photon states in distinct input modes and arbitrary additional vacuum inputs, and to Gaussian boson sampling with equal squeezing of bounded strength in every input mode. Classical sampling is efficient even when the mean detected photon number grows linearly with system size, showing that large photon counts alone do not ensure computational hardness.
Related
- Polynomial-time classical simulation of boson and fermion sampling under thermal loss
- Log-depth entanglement transition in hypercube Gaussian boson sampling
- Uniform Hiding and Two Routes to Relative Accuracy in Gaussian Boson Sampling
- Logarithmic-depth quantum simulation of boson sampling
- Phase-noise induced many-body interference suppression in Gaussian Boson Sampling
BibTeX
@misc{lim2026boson,
title = {{Boson sampling is fragile to loss}},
author = {Youngrong Lim},
howpublished = {arXiv},
year = {2026},
month = nov,
doi = {10.48550/arxiv.2611.01434},
eprint = {2611.01434},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2611.01434},
note = {CC BY 4.0},
}
RIS
TY - UNPB
TI - Boson sampling is fragile to loss
AU - Youngrong Lim
PY - 2026
DA - 2026/11/01
PB - arXiv
DO - 10.48550/arxiv.2611.01434
UR - https://arxiv.org/abs/2611.01434
AB - Boson sampling experiments aim to demonstrate quantum computational advantage with increasing numbers of interfering photons. A central question is whether their computational hardness survives under photon loss. We show that even an arbitrarily small nonzero uniform loss rate permits efficient classical sampling in the average case when the rate remains fixed as the system grows. We exploit how loss suppresses correlations involving many photons to approximate the full output distribution using low correlation orders. The resulting samplers run in time polynomial in system size and inverse total variation error, with the error averaged over Haar random interferometers. The results apply to Fock state boson sampling with single-photon states in distinct input modes and arbitrary additional vacuum inputs, and to Gaussian boson sampling with equal squeezing of bounded strength in every input mode. Classical sampling is efficient even when the mean detected photon number grows linearly with system size, showing that large photon counts alone do not ensure computational hardness.
ER -