Fast Track Communication The following article is Open access

Statistical benchmark for BosonSampling

, , , , , and

Published 3 March 2016 © 2016 IOP Publishing Ltd and Deutsche Physikalische Gesellschaft
, , Citation Mattia Walschaers et al 2016 New J. Phys. 18 032001 DOI 10.1088/1367-2630/18/3/032001

1367-2630/18/3/032001

Abstract

Boson samplers—set-ups that generate complex many-particle output states through the transmission of elementary many-particle input states across a multitude of mutually coupled modes—promise the efficient quantum simulation of a classically intractable computational task, and challenge the extended Church–Turing thesis, one of the fundamental dogmas of computer science. However, as in all experimental quantum simulations of truly complex systems, one crucial problem remains: how to certify that a given experimental measurement record unambiguously results from enforcing the claimed dynamics, on bosons, fermions or distinguishable particles? Here we offer a statistical solution to the certification problem, identifying an unambiguous statistical signature of many-body quantum interference upon transmission across a multimode, random scattering device. We show that statistical analysis of only partial information on the output state allows to characterise the imparted dynamics through particle type-specific features of the emerging interference patterns. The relevant statistical quantifiers are classically computable, define a falsifiable benchmark for BosonSampling, and reveal distinctive features of many-particle quantum dynamics, which go much beyond mere bunching or anti-bunching effects.

Export citation and abstract BibTeX RIS

Original content from this work may be used under the terms of the Creative Commons Attribution 3.0 licence. Any further distribution of this work must maintain attribution to the author(s) and the title of the work, journal citation and DOI.

Footnotes

  • To be precise: it was shown [2] that the realisation of an efficient classical algorithm that simulates BosonSampling implies a collapse of the polynomial hierarchy [5] to the third order. As it is not our goal to enter the mathematical subtleties related to the theory of computational complexity, let us stress that this is simply the complexity theorist's way of saying that it is highly unlikely to be true.

Please wait… references are loading.