Classical modelling of a bosonic sampler with photon collisions

Abstract

When the problem of boson sampling was first proposed, it was assumed that little or no photon collisions occur. However, modern experimental realizations rely on setups where collisions are quite common, i.e. the number of photons $M$ injected into the circuit is close to the number of detectors $N$. Here we present a classical algorithm that simulates a bosonic sampler: it calculates the probability of a given photon distribution at the interferometer outputs for a given distribution at the inputs. This algorithm is most effective in cases with multiple photon collisions, and in those cases it outperforms known algorithms.

References in corpus (19)

• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• Quantum computational advantage using photons
• Gaussian Boson Sampling
• Boson Sampling for Molecular Vibronic Spectra
• Boson Sampling from Gaussian States
• Experimental Scattershot Boson Sampling
• Molecular Docking with Gaussian Boson Sampling
• Simulating boson sampling in lossy architectures
• Gaussian Boson Sampling for perfect matchings of arbitrary graphs
• The Boundary for Quantum Advantage in Gaussian Boson Sampling
• A quantum hardware-induced graph kernel based on Gaussian Boson Sampling
• Regimes of classical simulability for noisy Gaussian boson sampling
• BosonSampling with Lost Photons
• Experimental Gaussian Boson Sampling
• Vibronic Boson Sampling: Generalized Gaussian Boson Sampling for Molecular Vibronic Spectra at Finite Temperature
• Classical simulation of lossy boson sampling using matrix product operators
• Point Processes with Gaussian Boson Sampling
• Training Gaussian Boson Sampling Distributions
• Generalized concurrence in boson sampling