A Tight Bound for Probability of Error for Quantum Counting Based Multiuser Detection

Abstract

Future wired and wireless communication systems will employ pure or combined Code Division Multiple Access (CDMA) technique, such as in the European 3G mobile UMTS or Power Line Telecommunication system, but also several 4G proposal includes e.g. multi carrier (MC) CDMA. Former examinations carried out the drawbacks of single user detectors (SUD), which are widely employed in narrowband IS-95 CDMA systems, and forced to develop suitable multiuser detection schemes to increase the efficiency against interference. However, at this moment there are only suboptimal solutions available because of the rather high complexity of optimal detectors. One of the possible receiver technologies can be the quantum assisted computing devices which allows high level parallelism in computation. The first commercial devices are estimated for the next years, which meets the advert of 3G and 4G systems. In this paper we analyze the error probability and give tight bounds in a static and dynamically changing environment for a novel quantum computation based Quantum Multiuser detection (QMUD) algorithm, employing quantum counting algorithm, which provides optimal solution.