Quantum search algorithms, quantum wireless, and a low-complexity maximum likelihood iterative quantum multi-user detector design
Quantum search algorithms, quantum wireless, and a low-complexity maximum likelihood iterative quantum multi-user detector design
The high complexity of numerous optimal classic communication schemes, such as the maximum likelihood (ML) multiuser detector (MUD), often prevents their practical implementation. In this paper, we present an extensive review and tutorial on quantum search algorithms (QSA) and their potential applications, and we employ a QSA that finds the minimum of a function in order to perform optimal hard MUD with a quadratic reduction in the computational complexity when compared to that of the ML MUD. Furthermore, we follow a quantum approach to achieve the same performance as the optimal soft-input soft-output classic detectors by replacing them with a quantum algorithm, which estimates the weighted sum of a function’s evaluations. We propose a soft-input soft-output quantum-assisted MUD (QMUD) scheme, which is the quantum-domain equivalent of the ML MUD. We then demonstrate its application using the design example of a direct-sequence code division multiple access system employing bit-interleaved coded modulation relying on iterative decoding, and compare it with the optimal ML MUD in terms of its performance and complexity. Both our extrinsic information transfer charts and bit error ratio curves show that the performance of the proposed QMUD and that of the optimal classic MUD are equivalent, but the QMUD’s computational complexity is significantly lower.
94-122
Botsinis, Panagiotis
d7927fb0-95ca-4969-9f8c-1c0455524a1f
Ng, Soon Xin
e19a63b0-0f12-4591-ab5f-554820d5f78c
Hanzo, Lajos
66e7266f-3066-4fc0-8391-e000acce71a1
10 May 2013
Botsinis, Panagiotis
d7927fb0-95ca-4969-9f8c-1c0455524a1f
Ng, Soon Xin
e19a63b0-0f12-4591-ab5f-554820d5f78c
Hanzo, Lajos
66e7266f-3066-4fc0-8391-e000acce71a1
Botsinis, Panagiotis, Ng, Soon Xin and Hanzo, Lajos
(2013)
Quantum search algorithms, quantum wireless, and a low-complexity maximum likelihood iterative quantum multi-user detector design.
IEEE Access, 1, .
(doi:10.1109/ACCESS.2013.2259536).
Abstract
The high complexity of numerous optimal classic communication schemes, such as the maximum likelihood (ML) multiuser detector (MUD), often prevents their practical implementation. In this paper, we present an extensive review and tutorial on quantum search algorithms (QSA) and their potential applications, and we employ a QSA that finds the minimum of a function in order to perform optimal hard MUD with a quadratic reduction in the computational complexity when compared to that of the ML MUD. Furthermore, we follow a quantum approach to achieve the same performance as the optimal soft-input soft-output classic detectors by replacing them with a quantum algorithm, which estimates the weighted sum of a function’s evaluations. We propose a soft-input soft-output quantum-assisted MUD (QMUD) scheme, which is the quantum-domain equivalent of the ML MUD. We then demonstrate its application using the design example of a direct-sequence code division multiple access system employing bit-interleaved coded modulation relying on iterative decoding, and compare it with the optimal ML MUD in terms of its performance and complexity. Both our extrinsic information transfer charts and bit error ratio curves show that the performance of the proposed QMUD and that of the optimal classic MUD are equivalent, but the QMUD’s computational complexity is significantly lower.
Text
QSA_QWireless.pdf
- Version of Record
More information
Published date: 10 May 2013
Organisations:
Southampton Wireless Group
Identifiers
Local EPrints ID: 352164
URI: http://eprints.soton.ac.uk/id/eprint/352164
PURE UUID: c7734b1c-ee00-4b2b-af7c-ea65563b9465
Catalogue record
Date deposited: 07 May 2013 13:27
Last modified: 18 Mar 2024 02:48
Export record
Altmetrics
Contributors
Author:
Panagiotis Botsinis
Author:
Soon Xin Ng
Author:
Lajos Hanzo
Download statistics
Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.
View more statistics