ﻻ يوجد ملخص باللغة العربية
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.
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
Quantum metrology promises high-precision measurements beyond the capability of any classical techniques, and has the potential to be integral to investigative techniques. However, all sensors must tolerate imperfections if they are to be practical.
The collective interference of partially distinguishable bosons in multi-mode networks is studied via double-sided Feynman diagrams. The probability for many-body scattering events becomes a multi-dimensional tensor-permanent, which interpolates betw
Boson-Sampling holds the potential to experimentally falsify the Extended Church Turing thesis. The computational hardness of Boson-Sampling, however, complicates the certification that an experimental device yields correct results in the regime in w
We study the necessary conditions for bosons composed of two distinguishable fermions to exhibit bosonic-like behaviour. We base our analysis on tools of quantum information theory such as entanglement and the majorization criterion for probability d