Answers are grounded in this paper and cite their sources.
We pose a randomized boson-sampling problem. Strong evidence exists that such a problem becomes intractable on a classical computer as a function of the number of bosons. We describe a quantum optical processor that can solve this problem efficiently based on a Gaussian input state, a linear optical network, and nonadaptive photon counting measurements. All the elements required to build such a processor currently exist. The demonstration of such a device would provide empirical evidence that quantum computers can, indeed, outperform classical computers and could lead to applications.
No takes yet. Share an insight, caveat, or question.
Lund et al. (2014) studied this question.
Synapse has enriched 5 related papers. Consider them for comparative context: