The scaling of boson sampling experiments

Abstract

Boson sampling is the problem of generating a quantum bit stream whose average is the permanent of a $n\times n$ matrix. The bitstream is created as the output of a prototype quantum computing device with $n$ input photons. It is a fundamental challenge to verify boson sampling, and the question of how output count rates scale with matrix size $n$ is crucial. Here we apply results from random matrix theory to establish scaling laws for average count rates in boson sampling experiments with arbitrary inputs and losses. The results show that, even with losses included, verification of nonclassical behaviour at large $n$ values is indeed possible.

References in corpus (5)

• Photonic quantum technologies
• Photonic Boson Sampling in a Tunable Circuit
• Experimental Scattershot Boson Sampling
• Linear Optical Quantum Metrology with Single Photons: Exploiting Spontaneously Generated Entanglement to Beat the Shot-Noise Limit
• From Many-Particle Interference to Correlation Spectroscopy

Cited by in corpus (12)

• Simulating complex networks in phase space: Gaussian boson sampling
• Quantum computational supremacy in the sampling of bosonic random walkers on a one-dimensional lattice
• Quantum software for linear photonic simulations
• Simulating and assessing boson sampling experiments with phase-space representations
• Robustness of quantum Fourier transform interferometry
• Initial states and apodisation for quantum field simulations in phase-space
• Multi-time correlations in the positive-P, Q, and doubled phase-space representations
• Photonic quantum data locking
• Experimental linear optical computing of the matrix permanent
• On the immanants of blocks from random matrices in some unitary ensembles
• Photonic Simulation of Localization Phenomena Using Boson Sampling
• Matrix phase-space representations for gaussian boson sampling