Noise in BosonSampling and the threshold of efficient classical simulability

@article{Shchesnovich2019NoiseIB,
  title={Noise in BosonSampling and the threshold of efficient classical simulability},
  author={Valery S. Shchesnovich},
  journal={ArXiv},
  year={2019},
  volume={abs/1902.02258}
}
We study the quantum to classical transition in Boson Sampling by analysing how $N$-boson interference is affected by inevitable noise in an experimental setup. We adopt the Gaussian noise model of Kalai and Kindler for Boson Sampling and show that it appears from some realistic experimental imperfections. We reveal a connection between noise in Boson Sampling and partial distinguishability of bosons, which allows us to prove efficient classical simulatability of noisy no-collision Boson… Expand

Figures, Tables, and Topics from this paper

Classically simulating near-term partially-distinguishable and lossy boson sampling
Boson Sampling is the problem of sampling from the same distribution as indistinguishable single photons at the output of a linear optical interferometer. It is an example of a non-universal quantumExpand
Simulability of partially distinguishable superposition and Gaussian boson sampling
We study the hardness of classically simulating boson sampling with superposition and Gaussian input states at nonzero photon indistinguishability. We find that, similar to regular boson sampling,Expand
Speedup in classical simulation of Gaussian boson sampling
Gaussian boson sampling is a promising model for demonstrating quantum computational supremacy, which eases the experimental challenge of the standard boson-sampling proposal. Here by analyzing theExpand
Physical Unclonable Functions with Boson Sampling
TLDR
A way to turn any boson sampling device for which there are certain fabrication limits into a physically unclonable function which could be used in identification systems and other security protocols. Expand
Signatures of many-particle interference
This Tutorial will introduce the mathematical framework for describing systems of identical particles, and explain the notion of indistinguishability. We will then focus our attention on dynamicalExpand
Distinguishing noisy boson sampling from classical simulations
TLDR
It is shown that one can efficiently distinguish the output distribution of such a noisy boson sampling from any approximation accounting for the low-order quantum multiboson interferences, which includes the mentioned classical algorithms. Expand
Distinguishability theory for time-resolved photodetection and boson sampling
We consider possible experimental realization of boson sampling with single photons when fast detectors, capable of precise resolution of photon arrival time, are employed and investigate if such aExpand
Sample-efficient benchmarking of multiphoton interference on a boson sampler in the sparse regime
TLDR
This work shows how to assess the quality of photonic interference in a linear optical quantum device (boson sampler) by using a maximum likelihood method to measure the strength at which various noise sources are present in the experiment. Expand

References

SHOWING 1-10 OF 86 REFERENCES
BosonSampling with Lost Photons
TLDR
It is shown that, if k out of n photons are lost, then BosonSampling cannot sample classically from a distribution that is 1/n^Theta(k)-close to the ideal distribution, unless a $\text{BPP}^{\text{NP}}$ machine can estimate the permanents of Gaussian matrices in $n^{O(k)}$ time. Expand
Sufficient condition for the mode mismatch of single photons for scalability of the boson-sampling computer
The boson sampler proposed by Aaronson and Arkhipov is a non-universal quantum computer, which can serve as evidence against the extended Church-Turing thesis. It samples the probability distributionExpand
Quantum simulation of partially distinguishable boson sampling
Boson Sampling is the problem of sampling from the same output probability distribution as a collection of indistinguishable single photons input into a linear interferometer. It has been shown that,Expand
Tight bound on trace distance between a realistic device with partially indistinguishable bosons and the ideal Boson-Sampling computer
TLDR
An upper bound on the trace distance to the ideal bosonic network is proven and also a bound is proven on the difference between probabilities of an output configuration. Expand
Experimental scattershot boson sampling
TLDR
The first scattershot boson sampling experiments are reported, where six different photon-pair sources are coupled to integrated photonic circuits, providing strong evidence that the photonic quantum simulator works as expected. Expand
Sufficient Conditions for Efficient Classical Simulation of Quantum Optics
We provide general sufficient conditions for the efficient classical simulation of quantum-optics experiments that involve inputting states to a quantum process and making measurements at the output.Expand
BosonSampling is robust against small errors in the network matrix
We demonstrate the robustness of BosonSampling to imperfections in the linear optical network that cause a small deviation in the matrix it implements. We show that applying a noisy matrixExpand
Decoherence and interferometric sensitivity of boson sampling in superconducting resonator networks
Multiple bosons undergoing coherent evolution in a coupled network of sites constitute a so-called quantum walk system. The simplest example of such a two-particle interference is the celebratedExpand
Toward Scalable Boson Sampling with Photon Loss.
TLDR
This experiment uses a quantum-dot-micropillar single-photon source demultiplexed into up to seven input ports of a 16×16 mode ultralow-loss photonic circuit, and detects three-, four- and fivefold coincidence counts, and demonstrates that boson sampling with a few photons lost can increase the sampling rate. Expand
Scalable implementation of boson sampling with trapped ions.
TLDR
This work proposes a scalable implementation of boson sampling using local transverse phonon modes of trapped ions to encode the bosons, which would outperform the most powerful classical computers and constitute an effective disproof of the famous extended Church-Turing thesis. Expand
...
1
2
3
4
5
...