Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Spot the Difference: Distinguishing Boson Sampling Experiments from Classical Simulations

Alexandra E. Moylett

Published Apr 28, 2021• 0 citations
Publisher
DOI
10.22331/qv-2021-04-28-53

Related papers

Efficient classical algorithm for simulating boson sampling with heterogeneous partial distinguishability

Anonymous

Physical Review A•May 12, 2025•0 citations

Efficient classical algorithm for simulating boson sampling with inhomogeneous partial distinguishability

S. N. van den Hoven, Edwin Kanis, Jelmer Jan Renema

•Jun 25, 2024•0 citations

Classically simulating near-term partially-distinguishable and lossy boson sampling

Alexandra E. Moylett, Raúl García−Patrón, Jelmer J Renema +1 more

Abstract Boson sampling is the problem of sampling from the same distribution as indistinguishable single photons at the output of a linear optical interferometer. It is an example of a non-universal quantum computation which is believed to be feasible in the near term and cannot be simulated on a classical machine. Like all purported demonstrations of ‘quantum computational supremacy’, this motivates optimising classical simulation schemes for a realistic model of the problem, in this case boson sampling when the implementations experience lost or distinguishable photons. Although current simulation schemes for sufficiently imperfect boson sampling are classically efficient, in principle the polynomial runtime can be infeasibly large. In this work, we develop a scheme for classical simulation of boson sampling under uniform distinguishability and loss, based on the idea of sampling from distributions where at most k photons are indistinguishable. We show that asymptotically this scheme can provide a polynomial improvement in the runtime compared to classically simulating idealised boson sampling. More significantly, we show that in the regime considered experimentally relevant, our approach gives an substantial improvement in runtime over other classical simulation approaches.

arXiv:1907.00022•Quantum Science and Technology•Nov 7, 2019•32 citations

Towards an experimental verification of boson sampling

Youri Cherif, Verena Yacoub, Ulysse Chabaud +2 more

•Jul 6, 2026•0 citations

Experimental boson sampling

Max Tillmann, Borivoje Dakić, René Heilmann +3 more

arXiv:1212.2240•Nature Photonics•May 10, 2013•707 citations

Efficient classical algorithm for simulating boson sampling with heterogeneous partial distinguishability

S. N. van den Hoven, E. Kanis, Jelmer J. Renema

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.

Physical Review A•May 28, 2025•4 citations
Abstract Boson sampling is the problem of sampling from the same distribution as indistinguishable single photons at the output of a linear optical interferometer. It is an example of a non-universal quantum computation which is believed to be feasible in the near term and cannot be simulated on a classical machine. Like all purported demonstrations of ‘quantum computational supremacy’, this motivates optimising classical simulation schemes for a realistic model of the problem, in this case boson sampling when the implementations experience lost or distinguishable photons. Although current simulation schemes for sufficiently imperfect boson sampling are classically efficient, in principle the polynomial runtime can be infeasibly large. In this work, we develop a scheme for classical simulation of boson sampling under uniform distinguishability and loss, based on the idea of sampling from distributions where at most k photons are indistinguishable. We show that asymptotically this scheme can provide a polynomial improvement in the runtime compared to classically simulating idealised boson sampling. More significantly, we show that in the regime considered experimentally relevant, our approach gives an substantial improvement in runtime over other classical simulation approaches.