pith. sign in

arxiv: 1409.3093 · v2 · pith:F5Y7O7UDnew · submitted 2014-09-10 · 🪐 quant-ph · cs.CC

Gaussian Noise Sensitivity and BosonSampling

classification 🪐 quant-ph cs.CC
keywords noisebosonsamplingnoisygaussianpermanentsensitivitywhenamount
0
0 comments X
read the original abstract

We study the sensitivity to noise of |permanent(X)|^2 for random real and complex n x n Gaussian matrices X, and show that asymptotically the correlation between the noisy and noiseless outcomes tends to zero when the noise level is {\omega}(1)/n. This suggests that, under certain reasonable noise models, the probability distributions produced by noisy BosonSampling are very sensitive to noise. We also show that when the amount of noise is constant the noisy value of |permanent(X)|^2 can be approximated efficiently on a classical computer. These results seem to weaken the possibility of demonstrating quantum-speedup via BosonSampling without quantum fault-tolerance.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Efficient simulation of low-entanglement bosonic Gaussian states in polynomial time

    quant-ph 2025-12 unverdicted novelty 7.0

    A new algorithm converts low-entanglement bosonic Gaussian states to matrix product states in polynomial time without hafnian calculations, yielding speedups on experimental boson sampling data.