Universality of Generalized Bunching and Efficient Assessment of Boson Sampling

V. S. Shchesnovich

doi:10.1103/PhysRevLett.116.123601

paper

Universality of Generalized Bunching and Efficient Assessment of Boson Sampling

arXiv:1509.01561 · doi:10.1103/PhysRevLett.116.123601

Abstract

It is found that identical bosons (fermions) show generalized bunching (antibunching) property in linear networks: The absolute maximum (minimum) of probability that all $N$ input particles are detected in a subset of $K$ output modes of any nontrivial linear $M$ -mode network is attained \textit{only} by completely indistinguishable bosons (fermions). For fermions $K$ is arbitrary, for bosons it is either ( $i$ ) arbitrary for only classically correlated bosons or ( $ii$ ) satisfies $K \geq N$ (or $K = 1$ ) for arbitrary input states of $N$ particles. The generalized bunching allows to certify in a \textit{polynomial} in $N$ number of runs that a physical device realizing Boson Sampling with \textit{an arbitrary} network operates in the regime of full quantum coherence compatible \textit{only} with completely indistinguishable bosons. The protocol needs \textit{only polynomial} classical computations for the standard Boson Sampling, whereas an \textit{analytic formula} is available for the scattershot version.

Accepted to Physical Review Letters, 5 pages, with 9 of the supplementing appendix, 2 figures

Universality of Generalized Bunching and Efficient Assessment of Boson Sampling

Abstract

References in corpus (10)

Cited by in corpus (37)