Indistinguishability between photons is a key requirement for scalable photonic quantum technologies. We experimentally demonstrate that partly distinguishable single photons can be purified to reach near-unity indistinguishability by the process of quantum interference with ancillary photons followed by heralded detection of a subset of them. We report on the indistinguishability of the purified photons by interfering two purified photons and show improvements in the photon indistinguishability of 2.774(3)% in the low-noise regime, and as high as 10.2(5)% in the high-noise regime.
We present a multimode model to describe an arbitrary
N-photon state with a wide spectral range and some arbitrary temporal distribution. In general, some of the
N photons are spread out in time while others may overlap and become indistinguishable. From this model, we find that the temporal (in)distinguishability of photons is related to the exchange symmetry of the multiphoton wave function. We find that simple multiphoton detection scheme gives rise to a more general photon bunching effect with the famous two-photon effect as a special case. We then send this
N-photon state into a recently discovered multiphoton interference scheme. We calculate the visibility of the multiphoton interference scheme and find that it is related to the temporal distinguishability of the
N photons. Maximum visibility of one is achieved for the indistinguishable
N-photon state whereas the visibility degrades when some of the photons are separated and become distinguishable. Thus we can identify an experimentally measurable quantity that may quantitatively define the degree of indistinguishability of an
N-photon state. This presents a quantitative demonstration of the complementary principle of quantum interference.
Several photonic quantum technologies rely on the ability to generate multiple indistinguishable photons. Benchmarking the level of indistinguishability of these photons is essential for scalability. The Hong-Ou-Mandel dip provides a benchmark for the indistinguishability between two photons, and extending this test to the multi-photon setting has so far resulted in a protocol that computes the genuine n-photon indistinguishability (GI). However, this protocol has a sample complexity that increases exponentially with the number of input photons for an estimation of GI up to a given additive error. To address this problem, we introduce new theorems that strengthen our understanding of the relationship between distinguishability and the suppression laws of the quantum Fourier transform interferometer (QFT). Building on this, we propose a protocol using the QFT for benchmarking GI that achieves constant sample complexity for the estimation of GI up to a given additive error for prime photon numbers, and sub-polynomial scaling otherwise, representing an exponential improvement over the state of the art. We prove the optimality of our protocol in many relevant scenarios and validate our approach experimentally on Quandela's reconfigurable photonic quantum processor, where we observe a clear advantage in runtime and precision over the state of the art. We therefore establish the first scalable method for computing multi-photon indistinguishability, which applies naturally to current and near-term photonic quantum hardware.