The Complexity of Bipartite Gaussian Boson Sampling

by   Daniel Grier, et al.

Gaussian boson sampling is a model of photonic quantum computing that has attracted attention as a platform for building quantum devices capable of performing tasks that are out of reach for classical devices. There is therefore significant interest, from the perspective of computational complexity theory, in solidifying the mathematical foundation for the hardness of simulating these devices. We show that, under the standard Anti-Concentration and Permanent-of-Gaussians conjectures, there is no efficient classical algorithm to sample from ideal Gaussian boson sampling distributions (even approximately) unless the polynomial hierarchy collapses. The hardness proof holds in the regime where the number of modes scales quadratically with the number of photons, a setting in which hardness was widely believed to hold but that nevertheless had no definitive proof. Crucial to the proof is a new method for programming a Gaussian boson sampling device so that the output probabilities are proportional to the permanents of submatrices of an arbitrary matrix. This technique is a generalization of Scattershot BosonSampling that we call BipartiteGBS. We also make progress towards the goal of proving hardness in the regime where there are fewer than quadratically more modes than photons (i.e., the high-collision regime) by showing that the ability to approximate permanents of matrices with repeated rows/columns confers the ability to approximate permanents of matrices with no repetitions. The reduction suffices to prove that GBS is hard in the constant-collision regime.


page 1

page 2

page 3

page 4


Quantum Supremacy and the Complexity of Random Circuit Sampling

A critical milestone on the path to useful quantum computers is quantum ...

Noise and the frontier of quantum supremacy

Noise is the defining feature of the NISQ era, but it remains unclear if...

Faster classical Boson Sampling

Since its introduction Boson Sampling has been the subject of intense st...

Noise in BosonSampling and the threshold of efficient classical simulability

We study the quantum to classical transition in BosonSampling by analysi...

Continuous LWE is as Hard as LWE Applications to Learning Gaussian Mixtures

We show direct and conceptually simple reductions between the classical ...

The Computational Complexity of Quantum Determinants

In this work, we study the computational complexity of quantum determina...

Please sign up or login with your details

Forgot password? Click here to reset