Efficient algorithm for boson sampling with partially distinguishable photons

TL;DR

This paper presents an efficient classical algorithm to simulate boson sampling with partially distinguishable photons, establishing conditions under which quantum advantage can be demonstrated based on photon indistinguishability.

Contribution

It introduces a novel approach to simulate boson sampling with partial distinguishability and identifies thresholds for quantum advantage based on photon indistinguishability.

Findings

Classical simulation efficiency depends on photon distinguishability

Adding more photons increases simulation complexity polynomially under certain conditions

Provides lower bounds on photon indistinguishability for quantum advantage

Abstract

We demonstrate how boson sampling with photons of partial distinguishability can be expressed in terms of interference of fewer photons. We use this observation to propose a classical algorithm to simulate the output of a boson sampler fed with photons of partial distinguishability. We find conditions for which this algorithm is efficient, which gives a lower limit on the required indistinguishability to demonstrate a quantum advantage. Under these conditions, adding more photons only polynomially increases the computational cost to simulate a boson sampling experiment.