NON-UNIVERSAL OPTICAL QUANTUM COMPUTING WITH ARRAY DETECTORS

Mariia Byelova1, Andrii Semenov2

1 Physics Department, Taras Shevchenko National University of Kyiv, Ukraine

2 Bogolyubov Institute for Theoretical Physics, NAS of Ukraine, Kyiv, Ukraine

Non-universal quantum computing is a powerful technique for evaluation of specific computational tasks, which cannot be solved with classical computers. Contrary to universal quantum computers, such devices are designed for dealing with a special problem or with a class of special problems. Boson sampling [1, 2] is a typical example of such a method, which can be implemented with present-available technologies. The computational task, which is resolved with such devices, consists in evaluation of permanents for matrices—a polynomial of matrix entries, similar to determinant, but without minuses. Contrary to determinants, there exist no efficient classical algorithms for calculation of permanents. An optical device, implementing boson sampling, consists of single-photon sources, multi-port linear interferometer, and single-photon detectors. A challenging task in implementation of this scheme is detectors, which can discriminate adjacent photon numbers. The problem is that standard photon diods, nano-wire detectors, etc. may detect single photons without such a discrimination. A possible way to resolve this problem consists in splitting the incoming ray into multiple components and detecting each of them with such an on/off detector. The number of detected clicks is usually associated with the number of photons. However, this statement is not really true [3]. Hence such a device may give wrong values of permanents. We report about our theoretical result, which enables to reconstruct correct values of permanents with such array detectors. The consideration is based on the true photocounting equation for this detection scheme presented in Ref. [3]. We believe that our result will find its application for practical realizations of optical non-universal quantum computers.


[1] S. Scheel, Permanents in linear optical networks, Acta Physica Slovaca 58, 675 (2008).

[2] S. Aaronson, and A. Arkhipov, The computational complexity of linear optics, Theory of Computing, 9, 143-252 (2013).

[3] J. Sperling, W. Vogel, and G. S. Agarwal, True photocounting statistics of multiple on-off detectors, Phys. Rev. A 85, 023820 (2012).