Marginal probabilities in boson samplers with arbitrary input states

Abstract

With the recent claim of a quantum advantage demonstration in photonics by Zhong et al, the question of the computation of lower-order approximations of boson sampling with arbitrary quantum states at arbitrary distinguishability has come to the fore. In this work, we present results in this direction, building on the results of Clifford and Clifford. In particular, we show: 1) How to compute marginal detection probabilities (i.e. probabilities of the detection of some but not all photons) for arbitrary quantum states. 2) Using the first result, how to generalize the sampling algorithm of Clifford and Clifford to arbitrary photon distinguishabilities and arbitrary input quantum states. 3) How to incorporate truncations of the quantum interference into a sampling algorithm. 4) A remark considering maximum likelihood verification of the recent photonic quantum advantage experiment.

References in corpus (9)

• Simulating boson sampling in lossy architectures
• Regimes of classical simulability for noisy Gaussian boson sampling
• Gaussian Noise Sensitivity and BosonSampling
• Classical simulability of noisy boson sampling
• Distinguishing noisy boson sampling from classical simulations
• Optimizing spontaneous parametric down-conversion sources for boson sampling
• Fourier analysis of sampling from noisy chaotic quantum circuits
• Sample-efficient benchmarking of multi-photon interference on a boson sampler in the sparse regime
• Partial distinguishability and photon counting probabilities in linear multiport devices

Cited by in corpus (4)

• Phase-Programmable Gaussian Boson Sampling Using Stimulated Squeezed Light
• The Argument against Quantum Computers, the Quantum Laws of Nature, and Google's Supremacy Claims
• Efficient approximation of experimental Gaussian boson sampling
• Polynomial speedup in Torontonian calculation by a scalable recursive algorithm