Machine learning allows to extract meaningful patterns hidden within high-dimensional data. Here we combine two such algorithms to investigate and validate multi-photon quantum interference in Boson Sampling experiments.
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.
Machine learning is widely applied in modern society, but has yet to capitalise on the unique benefits offered by quantum resources. Boson sampling -- a quantum-interference based sampling protocol -- is a resource that is classically hard to simulate and can be implemented on current quantum hardware. Here, we present a quantum accelerator for classical machine learning, using boson sampling to provide a high-dimensional quantum fingerprint for reservoir computing. We show robust performance improvements under various conditions: imperfect photon sources down to complete distinguishability; scenarios with severe class imbalances, classifying both handwritten digits and biomedical images; and sparse data, maintaining model accuracy with twenty times less training data. Crucially, we demonstrate the acceleration of our scheme on a photonic quantum processing unit, providing experimental validation that boson-sampling-enhanced learning with Fock states delivers real performance gains on actual quantum hardware.
Classical machine learning algorithms can provide insights on high-dimensional processes that are hardly accessible with conventional approaches. As a notable example, t -distributed Stochastic Neighbor Embedding ( t -SNE) represents the state of the art for visualization of data sets of large dimensionality. An interesting question is then if this algorithm can provide useful information also in quantum experiments with very large Hilbert spaces. Leveraging these considerations, in this work we apply t -SNE to probe the spatial distribution of n -photon events in m -dimensional Hilbert spaces, showing that its findings can be beneficial for validating genuine quantum interference in boson sampling experiments. In particular, we find that nonlinear dimensionality reduction is capable to capture distinctive features in the spatial distribution of data related to multi-photon states with different evolutions. We envisage that this approach will inspire further theoretical investigations, for instance for a reliable assessment of quantum computational advantage.