Simulability of Imperfect Gaussian and Superposition Boson Sampling

Abstract

We study the hardness of classically simulating Gaussian boson sampling at nonzero photon distinguishability. We find that similar to regular boson sampling, distinguishability causes exponential attenuation of the many-photon interference terms in Gaussian boson sampling. Barring an open problem in the theory of matrix permanents, this leads to an efficient classical algorithm to simulate Gaussian boson sampling in the presence of distinguishability. We also study a new form of boson sampling based on photon number superposition states, for which we also show noise sensivity. The fact that such superposition boson sampling is not simulable with out method at zero distinguishability is the first evidence for the computational hardness of this problem.

References in corpus (10)

• Supplementary information for "Quantum supremacy using a programmable superconducting processor"
• Photonic Boson Sampling in a Tunable Circuit
• Boson sampling with 20 input photons in 60-mode interferometers at $10^{14}$ state spaces
• Experimental Scattershot Boson Sampling
• Sampling of partially distinguishable bosons and the relation to the multidimensional permanent
• Partial indistinguishability theory for multi-photon experiments in multiport devices
• Multiboson Correlation Interferometry with arbitrary single-photon pure states
• Gaussian Noise Sensitivity and BosonSampling
• Tight bound on trace distance between a realistic device with partially indistinguishable bosons and the ideal Boson Sampling
• Partial distinguishability and photon counting probabilities in linear multiport devices

Cited by in corpus (23)

• Phase-Programmable Gaussian Boson Sampling Using Stimulated Squeezed Light
• Gaussian Boson Sampling with Pseudo-Photon-Number Resolving Detectors and Quantum Computational Advantage
• Computational advantage of quantum random sampling
• Resources for bosonic quantum computational advantage
• Teleportation of a genuine single-rail vacuum-one-photon qubit generated via a quantum dot source
• Certification of Gaussian Boson Sampling via graph theory
• Quantum supremacy of the many-body fluctuations in the occupations of the excited particle states in a Bose-Einstein-condensed gas
• Sample-efficient benchmarking of multi-photon interference on a boson sampler in the sparse regime
• Gaussian boson sampling with partial distinguishability
• Classical simulability of constant-depth linear-optical circuits with noise
• Quantum interferences and gates with emitter-based coherent photon sources
• Towards Photon-Number-Encoded High-dimensional Entanglement from a Sequentially Excited Quantum Three-Level System
• Boson sampling with random numbers of photons
• Quantum memristor with vacuum--one-photon qubits
• Gaussian boson sampling at finite temperature
• Efficient approximation of experimental Gaussian boson sampling
• Validation of a noisy Gaussian boson sampler via graph theory
• On computational complexity and average-case hardness of shallow-depth boson sampling
• Quantum computational advantage of noisy boson sampling with partially distinguishable photons
• Resourcefulness of non-classical continuous-variable quantum gates
• Optical Quantum Computing
• Polynomial speedup in Torontonian calculation by a scalable recursive algorithm
• Realistic photon-number resolution in Gaussian boson sampling