Efficient classical algorithm for simulating boson sampling with heterogeneous partial distinguishability

E. Kanis; J. J. Renema; S.N. van den Hoven

Efficient classical algorithm for simulating boson sampling with heterogeneous partial distinguishability

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2406.17682 v2 pith:IHRIVW3S submitted 2024-06-25 quant-ph physics.optics

S.N. van den Hoven , E. Kanis , J. J. Renema This is my paper · ORCID

classification quant-phphysics.optics

keywords bosonsamplingclassicaldifferentdistinguishabilitypairspartialtheory

verification ladder T0 review T1 audit T2 compute T3 formal

0 comments

read the original abstract

Boson sampling is one of the leading protocols for demonstrating a quantum advantage, but the theory of how this protocol responds to noise is still incomplete. We extend the theory of classical simulation of boson sampling with partial distinguishability to the case where the degree of indistinguishability between photon pairs is different between different pairs.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

Incoherent behavior of partially distinguishable photons
quant-ph 2025-02 conditional novelty 7.0 of 10

A multi-photon state behaves like a stochastic mixture of distinguishability patterns exactly when its interference parameters depend only on permutation cycle structure, enabling a compact partition representation an...

Pith tools