{
  "abstract": "Understanding how photon loss changes the classical complexity of BosonSampling is central to assessing the robustness of near-term photonic quantum advantage. In this work, we present a polynomial-time classical simulation algorithm for lossy BosonSampling that applies whenever a constant fraction of the input photons survives. We consider the standard fixed-loss model, where $N$ input photons propagate through an $M$-mode interferometer and exactly $N-n$ photons are lost uniformly at random, leaving $n$ surviving photons at the output. For any constant surviving fraction $n/N\\in(0,1)$, the algorithm samples from a distribution within total variation distance $\\varepsilon$ of the fixed-loss BosonSampling distribution with probability at least $1-δ$ over Haar-random interferometers, in time $\\operatorname{poly}(M,N,\\varepsilon^{-1},δ^{-1})$. We further extend the fixed-loss analysis to the uniform-transmission-loss model and obtain analogous polynomial-time simulability for any fixed transmission rate $η\\in(0,1)$. These results substantially extend the known provably simulable regime of $n=O(\\sqrt{\\varepsilon N})$ surviving photons or $η=O(\\sqrt{\\varepsilon/N})$ transmission rate, and demonstrate that even the experimentally relevant linear-survival regime can admit efficient classical simulation under the conditions considered here.",
  "abstract_shown": true,
  "affiliations": [],
  "article_type": null,
  "arxiv": "2610.27065",
  "author_total": 2,
  "authors": [
    {
      "name": "Byeongseon Go"
    },
    {
      "name": "Hyunseok Jeong"
    }
  ],
  "bibtex": "https://research.draconitic.com/paper/0jwzewm4p1a6j.bib",
  "cited_by": 0,
  "doi": "10.48550/arxiv.2610.27065",
  "fulltext_url": null,
  "id": "0jwzewm4p1a6j",
  "issns": [],
  "landing_url": "https://arxiv.org/abs/2610.27065",
  "language": null,
  "licence": "LicenseRef-arXiv-nonexclusive-1.0",
  "licence_label": "arXiv licence",
  "licence_source": "article",
  "licence_url": "http://arxiv.org/licenses/nonexclusive-distrib/1.0/",
  "metadata_licence": "CC0-1.0",
  "native_subjects": [
    [
      "arxiv",
      "quant-ph"
    ],
    [
      "openalex",
      "1702|Quantum Computing Algorithms and Architecture"
    ]
  ],
  "openalex": "W7223135416",
  "pdf_url": "https://arxiv.org/pdf/2610.27065",
  "pmcid": null,
  "pmid": null,
  "published": "2026-10-19",
  "publisher": null,
  "ris": "https://research.draconitic.com/paper/0jwzewm4p1a6j.ris",
  "sources": [
    {
      "first_seen": "2026-10-30T12:34:04Z",
      "native_id": "2610.27065",
      "source": "arxiv",
      "url": "https://arxiv.org/abs/2610.27065"
    }
  ],
  "subjects": [
    {
      "field": "physics",
      "origin": "arxiv:quant-ph",
      "subfield": "quantum"
    }
  ],
  "title": "Polynomial-Time Classical Simulation of BosonSampling under Any Constant-Fraction Photon Loss",
  "title_text": "Polynomial-Time Classical Simulation of BosonSampling under Any Constant-Fraction Photon Loss",
  "type": "preprint",
  "updated_at": "2026-10-30T12:34:04Z",
  "url": "https://research.draconitic.com/paper/0jwzewm4p1a6j",
  "venue": "arXiv",
  "versions": []
}