CoChat

Quantum Search Algorithms, Quantum Wireless, and a Low-Complexity Maximum Likelihood Iterative Quantum Multi-User Detector Design

Open access

The DOI matches its Crossref record; 115 of the 115 references it cites were found in a registry or an index.

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.

Overview

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1109/access.2013.2259536

Cites

115 of 115 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Show all 115 references

Research works printed but not linked: 3

  1. verdu, 1998, Multiuser Detection
  2. zhang, 2013, Differential space-time shift keying aided successive relaying assisted cooperative multi-user CDMA, IEEE Trans Veh Technol, pp, 1
  3. einstein, 1971, Born-Einstein Letters, 1916

Cited by

See all 83

Metadata

Authors
Botsinis, P., Ng, S. X., & Hanzo, L.
Affiliations
University of Southampton (GB)
Venue
IEEE Access
Published
2013
Volume
1
Pages
94-122
ISSN
2169-3536 (ISSN-L)
OpenAlex
W2122727488
Cited by
64
References
112
Citations by year
2025: 1 · 2024: 5 · 2023: 7 · 2022: 6 · 2021: 3 · 2020: 2 · 2019: 3 · 2018: 6 · 2017: 7 · 2016: 4 · 2015: 10 · 2014: 9 · 2013: 1
FWCI
8.83
Type
journal article
Language
en
Open access
Locations
  • IEEE Access (publishedVersion, cc-by)
  • ePrints Soton (University of Southampton) (acceptedVersion)
  • DOAJ (DOAJ: Directory of Open Access Journals) (submittedVersion, cc-by-sa)
Funders
Engineering and Physical Sciences Research Council (EP/J016640/1)
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
  • Physical Sciences › Computer Science › Computer Networks and Communications › Wireless Communication Networks Research
  • Physical Sciences › Engineering › Electrical and Electronic Engineering › Advanced Wireless Communication Techniques
Keywords
quantum search, soft-input soft-output detection, iterative decoding, CDMA, bit-interleaved coded modulation, extrinsic information transfer, computational complexity reduction, function minimization

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Quantum Search Algorithms, Quantum Wireless, and a Low-Complexity Maximum Likelihood Iterative Quantum Multi-User Detector Design. https://app.cochat.ai/papers/10.1109/access.2013.2259536
The paper
Botsinis, P., Ng, S. X., & Hanzo, L. (2013). Quantum Search Algorithms, Quantum Wireless, and a Low-Complexity Maximum Likelihood Iterative Quantum Multi-User Detector Design. IEEE Access. https://doi.org/10.1109/access.2013.2259536

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.