Conditions for an experimental Boson-sampling computer to disprove the Extended Church-Turing thesis
Abstract
We give a set of sufficient conditions on the experimental Boson-Sampling computer to satisfy Theorem 1.3 of Aaronson & Arkhipov (Theory of Computing \textbf{9}, 143 (2013)) stating a computational problem whose simulation on a classical computer would collapse the polynomial hierarchy of the computational complexity to the third level. This implies that such an experimental device is in conflict with the Extended Church-Turing thesis. In practical terms, we give a set of sufficient conditions for the scalability of the experimental Boson-Sampling computer beyond the power of the classical computers. The derived conditions can be also used for devising efficient verification tests of the Boson-Sampling computer.
Keywords
Cite
@article{arxiv.1403.4459,
title = {Conditions for an experimental Boson-sampling computer to disprove the Extended Church-Turing thesis},
author = {V. S. Shchesnovich},
journal= {arXiv preprint arXiv:1403.4459},
year = {2014}
}
Comments
Fully revised version. 5 pages (in the two-column format) of the main text and 3 pages of appendices; no figures; minor correction in the last sentence of the Appendix