Abstract
The goal of universal quantum computing that challenges classical computation is still far from being reached. However, Aaronson and Arkhipov recently proposed a nonuniversal quantum computer [1] to solve sampling problems of identical bosons in linear-optical networks which are intractable for classical computers. Once outperforming the classically computable limit of such a boson-sampling device, the very hardness of boson sampling excludes any straightforward efficient verification of the results. A computationally accessible while physically non-trivial instance of the problem was proposed to prove many-particle interference and thereby benchmark the functionality of a candidate device [2]. However, the Fourier matrix proposed in [2] is a highly artificial singular case that remains challenging to implement experimentally.
© 2015 IEEE
PDF ArticleMore Like This
N. Spagnolo, C. Vitelli, M. Bentivegna, D. J. Brod, A. Crespi, F. Flamini, R. Ramponi, P. Mataloni, R. Osellame, E. F. Galvao, and F. Sciarrino
EB_5_2 European Quantum Electronics Conference (EQEC) 2015
Fabio Sciarrino
FF1C.1 Frontiers in Optics (FiO) 2016
M. Bentivegna, N. Spagnolo, C. Vitelli, F. Flamini, N. Viggianiello, L. Latmiral, P. Mataloni, D. Brod, E. Galvão, A. Crespi, R. Ramponi, R. Osellame, and F. Sciarrino
JSV_3_4 European Quantum Electronics Conference (EQEC) 2015