Gaussian Noise Sensitivity and BosonSampling
arXiv:1409.3093
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 ω(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.
Version 2: A few corrections and additions
References in corpus (7)
- Boson Sampling on a Photonic Chip
- Experimental Boson Sampling
- Photonic Boson Sampling in a Tunable Circuit
- Generation and Confirmation of a (100x100)-dimensional entangled Quantum System
- Efficient experimental validation of photonic boson sampling against the uniform distribution
- How Quantum Computers Fail: Quantum Codes, Correlations in Physical Systems, and Noise Accumulation
- Lectures on noise sensitivity and percolation
Cited by in corpus (24)
- Quantum Computational Supremacy
- Achieving quantum supremacy with sparse and noisy commuting quantum computations
- No imminent quantum supremacy by boson sampling
- A flexible high-performance simulator for verifying and benchmarking quantum circuits implemented on real hardware
- Efficient classical simulation of random shallow 2D quantum circuits
- Quantum Computational Advantage via High-Dimensional Gaussian Boson Sampling
- BosonSampling with Lost Photons
- Perceval: A Software Platform for Discrete Variable Photonic Quantum Computing
- Boson sampling with Gaussian measurements
- Classical algorithm for simulating experimental Gaussian boson sampling
- Quantum Computing: An Overview Across the System Stack
- Classical simulation of linear optics subject to nonuniform losses
- Simulability of Imperfect Gaussian and Superposition Boson Sampling
- Distinguishing noisy boson sampling from classical simulations
- A robust W-state encoding for linear quantum optics
- The Quantum Computer Puzzle (Expanded Version)
- Efficient validation of Boson Sampling from binned photon-number distributions
- Approximating permanents and hafnians
- Marginal probabilities in boson samplers with arbitrary input states
- The Argument against Quantum Computers, the Quantum Laws of Nature, and Google's Supremacy Claims
- Efficient approximation of experimental Gaussian boson sampling
- Global estimates of errors in quantum computation by the Feynman-Vernon formalism
- Mitigating quantum operation infidelity through engineering the distribution of photon losses
- Physical Unclonable Functions with Boson Sampling