{
  "abstract": "Gaussian boson sampling (GBS) seeks quantum advantage by sampling photon-number patterns generated with squeezed inputs and passive linear optics. Many proposed GBS applications instead target function computation by applying functions to mode-resolved photon-number outcomes---a natural form of experimental postprocessing that produces classical outputs. Sampling hardness alone, however, does not determine the complexity of these tasks. By analyzing the irreducible decomposition of fixed-photon-number operator spaces, we prove that the expectation value of every such function in the average case over passive linear-optical networks can be classically evaluated for inputs with finite squeezing strength. We also provide a classical algorithm that estimates this value to inverse-polynomial additive error. The result provides new theoretical tools for analyzing linear-optical quantum systems, helps clarify the origin of current GBS hardness evidence, and inspires new applications of GBS with genuine quantum advantages.",
  "abstract_shown": true,
  "affiliations": [],
  "article_type": null,
  "arxiv": "2609.38882",
  "author_total": 5,
  "authors": [
    {
      "name": "Ruoting Dou"
    },
    {
      "name": "Hao Zhan"
    },
    {
      "name": "Shengjun Wu"
    },
    {
      "name": "Lijian Zhang"
    },
    {
      "name": "Penghui Yao"
    }
  ],
  "bibtex": "https://research.draconitic.com/paper/8b3zjwawewk4m.bib",
  "cited_by": 0,
  "doi": "10.48550/arxiv.2609.38882",
  "fulltext_url": null,
  "id": "8b3zjwawewk4m",
  "issns": [],
  "landing_url": "https://arxiv.org/abs/2609.38882",
  "language": null,
  "licence": "CC-BY-4.0",
  "licence_label": "CC BY 4.0",
  "licence_source": "article",
  "licence_url": "http://creativecommons.org/licenses/by/4.0/",
  "metadata_licence": "CC0-1.0",
  "native_subjects": [
    [
      "arxiv",
      "quant-ph"
    ],
    [
      "openalex",
      "1702|Quantum Computing Algorithms and Architecture"
    ]
  ],
  "openalex": "W7215078970",
  "pdf_url": "https://arxiv.org/pdf/2609.38882",
  "pmcid": null,
  "pmid": null,
  "published": "2026-09-30",
  "publisher": null,
  "ris": "https://research.draconitic.com/paper/8b3zjwawewk4m.ris",
  "sources": [
    {
      "first_seen": "2026-10-30T12:25:49Z",
      "native_id": "2609.38882",
      "source": "arxiv",
      "url": "https://arxiv.org/abs/2609.38882"
    }
  ],
  "subjects": [
    {
      "field": "physics",
      "origin": "arxiv:quant-ph",
      "subfield": "quantum"
    }
  ],
  "title": "Classical Algorithms for Function Computation in Gaussian Boson Sampling",
  "title_text": "Classical Algorithms for Function Computation in Gaussian Boson Sampling",
  "type": "preprint",
  "updated_at": "2026-10-30T12:25:49Z",
  "url": "https://research.draconitic.com/paper/8b3zjwawewk4m",
  "venue": "arXiv",
  "versions": []
}