2015/07/31 by Simon Laibacher, Vincenzo Tamma · 49 citations
Computer Science · Physics and Astronomy · #Algorithm #Boson #Computational complexity theory #Computer science #Degrees of freedom (physics and chemistry) #Interference (communication) #Neural Networks and Reservoir Computing #Photon #Physics #Polarization (electrochemistry) #Quantum Information and Cryptography #Quantum Mechanics and Applications #Quantum mechanics #Statistical physics #Telecommunications #quant-ph
paper · pdf · doi:10.1103/physrevlett.115.243605
published in Physical Review Letters 115(24), 243605 (American Physical Society) · v6: fixed missing equation numbers
openalex publication_date 2015/12/11 · arxiv created 2016/04/15 · arxiv updated 2016/04/18 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/05
We demonstrate how the physics of multiboson correlation interference leads to the computational complexity of linear optical interferometers based on correlation measurements in the degrees of freedom of the input bosons. In particular, we address the task of multiboson correlation sampling (MBCS) from the probability distribution associated with polarization- and time-resolved detections at the output of random linear optical networks. We show that the MBCS problem is fundamentally hard to solve classically even for nonidentical input photons, regardless of the color of the photons, making it also very appealing from an experimental point of view. These results fully manifest the quantum computational supremacy inherent to the fundamental nature of quantum interference.