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 applic...

Full description

Bibliographic Details
Main Authors: Panagiotis Botsinis, Soon Xin Ng, Lajos Hanzo
Format: Article
Language:English
Published: IEEE 2013-01-01
Series:IEEE Access
Subjects:
Bit-interleaved coded modulation
BBHT quantum search algorithm
computational complexity
Dürr–Høyer algorithm
EXIT chart
Grover's quantum search algorithm
Online Access:https://ieeexplore.ieee.org/document/6515077/

Internet

https://ieeexplore.ieee.org/document/6515077/

Similar Items