Efficient algorithm for boson sampling with partially distinguishable photons
Quantum Physics
2018-06-06 v1
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.
Cite
@article{arxiv.1707.02793,
title = {Efficient algorithm for boson sampling with partially distinguishable photons},
author = {Jelmer J. Renema and Adrian Menssen and William R. Clements and Gil Triginer and William S. Kolthammer and Ian A. Walmsley},
journal= {arXiv preprint arXiv:1707.02793},
year = {2018}
}