Optimal photonic indistinguishability tests in multimode networks
Niko Viggianiello, Fulvio Flamini, Marco Bentivegna, Nicolò Spagnolo, Andrea Crespi, Daniel J. Brod, Ernesto F. Galvão, Roberto Osellame, Fabio Sciarrino
Particle indistinguishability is at the heart of quantum statistics that regulates fundamental phenomena such as the electronic band structure of solids, Bose-Einstein condensation and superconductivity. Moreover, it is necessary in practical applications such as linear optical quantum computation and simulation, in particular for Boson Sampling devices. It is thus crucial to develop tools to certify genuine multiphoton interference between multiple sources. Our approach employs the total variation distance to find those transformations that minimize the error probability in discriminating the behaviors of distinguishable and indistinguishable photons. In particular, we show that so-called Sylvester interferometers are near-optimal for this task. By using Bayesian tests and inference, we numerically show that Sylvester transformations largely outperform most Haar-random unitaries in terms of sample size required. Furthermore, we experimentally demonstrate the efficacy of the transformation using an efficient 3D integrated circuits in the single- and multiple-source cases. We then discuss the extension of this approach to a larger number of photons and modes. These results open the way to the application of Sylvester interferometers for optimal assessment of multiphoton interference experiments.
Particle indistinguishability is at the heart of quantum statistics that regulates fundamental phenomena such as the electronic band structure of solids, Bose-Einstein condensation and superconductivity. Moreover, it is necessary in practical applications such as linear optical quantum computation and simulation, in particular for Boson Sampling devices. It is thus crucial to develop tools to certify genuine multiphoton interference between multiple sources. Our approach employs the total variation distance to find those transformations that minimize the error probability in discriminating the behaviors of distinguishable and indistinguishable photons. In particular, we show that so-called Sylvester interferometers are near-optimal for this task. By using Bayesian tests and inference, we numerically show that Sylvester transformations largely outperform most Haar-random unitaries in terms of sample size required. Furthermore, we experimentally demonstrate the efficacy of the transformation using an efficient 3D integrated circuits in the single- and multiple-source cases. We then discuss the extension of this approach to a larger number of photons and modes. These results open the way to the application of Sylvester interferometers for optimal assessment of multiphoton interference experiments.
Summary form only given. Recently, interference of multi-particle states has raised a strong interest in the scientific community, since it is believed to be at the very heart of post-classical computation. In this context, Boson Sampling [1] devices exploit multi-photon interference effects to provide evidence of a superior quantum computational power with current state-of-the-art technology. Thus, the capability to correctly certify the presence of multi-particle interference and find optimal platforms, becomes a crucial task because is expected to find numerous applications in photonic quantum information as a diagnostic tool for quantum optical devices.We investigate different scenarios, namely, when the consider only a fixed set of input modes, but also for the situation where all input sets can be used. We find that, in certain cases, the best choice for this task consist of Hadamard [2,3] interferometers which we implemented with a novel architecture enabled by the 3D capabilities of femtosecond laser writing. We derive and experimentally demonstrate a novel zero-transmission law based on symmetric interferometers (Fig. 1) and we verifyied the optimality of these platforms by performing further Bayesian analysis and by maximizing the total variation distance between the probability distributions corresponding to indistinguishable and distinguishable particles. The results suggest an immediate application for scattershot Boson Sampling experiments [4], where an exponential advantage in terms of generation rate is obtained with respect to the fixed-input problem. The main advantage of this technique consists in the large fraction of input-output suppressed combinations when these trasformations are injected with indistinguishable photons. In summary, this work represents a further step for quantum interference analysis and it is worth noting that Hadamard matrices naturally appear as the optimal designs for identifying genuine photonic indistinguishability in multimode interferometers and a powerful tool to validate Boson Sampling experiments. We aknowledge QUCHIP and 3D-Quest for funding this work.
Abstract We experimentally demonstrate a testing strategy for boson samplers that is based on efficiently computable expressions for the output photon counting distributions binned over multiple optical modes. We apply this method to validate boson sampling experiments with three photons on a reconfigurable photonic chip, which implements a four-mode interferometer, analyzing 50 Haar-random unitary transformations while tuning photon indistinguishability via controlled delays. We show that for (nearly) indistinguishable photons, the experiment accurately reproduces the ideal boson sampling binned-mode distributions, which exhibit variations that depend both on the specific interferometer implemented as well as the choice of bin, confirming the usefulness of the method to diagnose imperfections such as partial distinguishability or imperfect chip control. Finally, we analyze the behavior of Haar-averaged binned-mode distributions in relation to indistinguishability and demonstrate analytically that its variance is proportional to the average of the square of the photons’ indistinguishability parameter. These findings highlight the central role of binning in boson sampling validation, offering a scalable and efficient framework for assessing multiphoton interference and experimental performance.
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.
Photonic interference is a key quantum resource for optical quantum computation, and in particular for so-called boson sampling devices. In interferometers with certain symmetries, genuine multiphoton quantum interference effectively suppresses certain sets of events, as in the original Hong–Ou–Mandel effect. Recently, it was shown that some classical and semi-classical models could be ruled out by identifying such suppressions in Fourier interferometers. Here we propose a suppression law suitable for random-input experiments in multimode Sylvester interferometers, and verify it experimentally using 4- and 8-mode integrated interferometers. The observed suppression occurs for a much larger fraction of input–output combinations than what is observed in Fourier interferometers of the same size, and could be relevant to certification of boson sampling machines and other experiments relying on bosonic interference, such as quantum simulation and quantum metrology.
Multiphoton indistinguishability is a key resource for photonic quantum technologies, yet its characterization typically relies on resource-intensive methods. In this work, we develop two efficient and experimentally friendly protocols to estimate or bound the fidelity Find of an N-photon state to the closest perfectly indistinguishable state. The first protocol applies to sources preparing separable states, uses a single Fourier interferometer together with photon-number-resolving detection, and yields tight two-sided bounds on Find. The second protocol combines randomized implementations of linear-optical interferometers with photon counting, enabling direct estimation of Find for arbitrary N-photon states. Both protocols can certify Find=1−O(ε) using provably optimal O(1/ε) samples, in contrast to previous approaches which required prior assumptions on the model of partial distinguishability. Our methods, based on a multiphoton generalization of the Hong-Ou-Mandel test, bring the rigorous and operationally meaningful certification of multiphoton indistinguishability within reach of current photonic technologies.
Multiphoton interference represents one of the key features in photonic platforms for quantum communication, quantum simulation, quantum computing and quantum sensing. Starting from the first two-photon experiment by Hong-Ou-Mandel [1], it has been shown that multiphoton interference lies at the heart of computational complexity in linear optical interferometers, the most notable example being provided by the Boson Sampling model [2]. This model corresponds to sampling from the evolution of n indistinguishable photons in a multimode linear network, and has been shown to be hard to simulate classicaly thus representing a promising route to experimentally reach the quantum advantage regime. It has been shown, however, that genuine multiparticle interference is necessary for high computational complexity. Hence, appropriate methods for detection of such feature should be developed since the complexity of problem prevents the application of trivial methods.