The DOI matches its Crossref record; 41 of the 41 references it cites were found in a registry or an index.
Iterative Quantum-Assisted Multi-User Detection for Multi-Carrier Interleave Division Multiple Access Systems
Abstract
With the proliferation of smart-phones and tablet PCs, the data rates of wireless communications have been soaring. Hence, the need for power-efficient communications relying on low-complexity multiple-stream detectors has become more pressing than ever. As a remedy, in this paper we design low-complexity soft-input soft-output quantum-assisted multi-user detectors (QMUD), which may be conveniently incorporated into state-of-the-art iterative receivers. Our design relies on extrinsic information transfer charts. Our QMUDs are then employed in multi-carrier interleave-division multiple-access (MC-IDMA) systems, which are investigated in the context of different channel code rate and spreading factor pairs, whilst fixing the total bandwidth requirement. One of our QMUDs is found to operate within 0.5 dB of the classical maximum a posteriori probability MUD after three iterations between the MUD and the decoders, while requiring only half its complexity, at a BER of 10-5in the uplink of a rank-deficient MC-IDMA system relying on realistic imperfect channel estimation at the receiver, while supporting 14 users transmitting QPSK symbols.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Citations
Cites
Quantum Computation and Quantum Information
Nielsen, M. A., Chuang, I., & Grover, L. K. (2002) · American Journal of Physics · doi:10.1119/1.1463744 · Cited by 21,895
Quantum computation and quantum information
Law, J. (2001) · ACM SIGSOFT Software Engineering Notes · doi:10.1145/505482.505499 · Cited by 18,842
A fast quantum mechanical algorithm for database search
Grover, L. K. (1996) · Proceedings of the twenty-eighth annual ACM symposium on Theory of computing - STOC '96 · doi:10.1145/237814.237866 · Cited by 8,830 · cited 6×
“6 Since the actual complexity of the Oracle will depend on the particular technology used for creating the circuit, let us proceed by assuming that a single activation of the Oracle gate represents a single CFE [4], [6], [7], [9], [11].”
BackgroundMethodInfluentialQuantum Mechanics Helps in Searching for a Needle in a Haystack
Grover, L. K. (1997) · Physical Review Letters · doi:10.1103/physrevlett.79.325 · Cited by 4,306 · cited 4×
“[5], the BBHT QSA [6] and the DHA [7].”
BackgroundMethodInfluentialLTE - The UMTS Long Term Evolution: From Theory to Practice
Sesia, S., Toufik, I., & Baker, M. (2011) · Cited by 2,457
LTE – The UMTS Long Term Evolution: From Theory to Practice
(2009) · Wiley eBooks · doi:10.1002/9780470742891 · Cited by 1,816
Interleave division multiple-access
Ping, L., Liu, L., Wu, K., & Leung, W. K. (2006) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2006.1618943 · Cited by 912
(1996) · Cited by 824
A Quantum Algorithm for Finding the Minimum
Durr, C., & Hoyer, P. (1996) · arXiv · doi:10.48550/arxiv.quant-ph/9607014 · Cited by 359 · cited 6×
“6 Since the actual complexity of the Oracle will depend on the particular technology used for creating the circuit, let us proceed by assuming that a single activation of the Oracle gate represents a single CFE [4], [6], [7], [9], [11].”
BackgroundMethodInfluentialHanzo, L., Yang, L., Kuan, E., & Yen, K. (2003) · Wiley eBooks · doi:10.1002/0470863110 · Cited by 352
Self-citation
Cited by
Quantum Machine Learning for 6G Communication Networks: State-of-the-Art and Vision for the Future
Nawaz, S. J., Sharma, S. K., Wyne, S., Patwary, M. N., & Asaduzzaman, M. (2019) · IEEE Access · doi:10.1109/access.2019.2909490 · Cited by 658
“IV-A4 IV-A4.b, quantum-assisted multi-user detection/transmission has been studied in various scenairos including direct-sequence spreading SDMA-OFDM, CDMA and SDMA, Multi-Carrier IDMA, and NOMA systems in [163]–[165], and [38], respectively.”
BackgroundMethodThe Evolution of Quantum Secure Direct Communication: On the Road to the Qinternet
Pan, D., Long, G.-L., Yin, L., Sheng, Y.-B., Ruan, D., Ng, S. X., Lu, J., & Hanzo, L. (2024) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2024.3367535 · Cited by 180
“Another well-known algorithm running on a quantum computer is Grover’s search algorithm [16]–[20], which is capable of finding a known entry in unsorted databases [21], [22].”
Self-citationQuantum Search Algorithms for Wireless Communications
Botsinis, P., Alanis, D., Babar, Z., Nguyen, H. V., Chandra, D., Ng, S. X., & Hanzo, L. (2019) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2018.2882385 · Cited by 149
“Therefore, since a SISO MUD or QMUD is always followed by channel decoders, the DH QSA-based QMUD of [81] achieves a near-optimal performance, while imposing a lower complexity than the MAP MUD.”
MethodSelf-citationFifteen Years of Quantum LDPC Coding and Improved Decoding Strategies
Babar, Z., Botsinis, P., Alanis, D., Ng, S. X., & Hanzo, L. (2015) · IEEE Access · doi:10.1109/access.2015.2503267 · Cited by 148
“solving certain complex problems at a substantially lower complexity than its classical counterpart, quantum parallel processing techniques may be invoked [2]–[6].”
BackgroundSelf-citationJawad, A. T., Mâaloul, R., & Chaari, L. (2023) · Computer Networks · doi:10.1016/j.comnet.2023.110085 · Cited by 111
Metadata
- Authors
- Botsinis, P., Alanis, D., Babar, Z., Ng, S. X., & Hanzo, L.
- Affiliations
- University of Southampton (GB)
- Venue
- IEEE Transactions on Communications
- Published
- 2015-10
- Volume
- 63
- Issue
- 10
- Pages
- 3713-3727
- ISSN
- 0090-6778 (ISSN-L)
- OpenAlex
- W1891910822
- Cited by
- 48
- References
- 41
- Citations by year
- 2026: 1 · 2025: 3 · 2024: 6 · 2023: 5 · 2022: 4 · 2021: 5 · 2020: 1 · 2019: 4 · 2018: 7 · 2017: 5 · 2016: 5 · 2015: 2
- FWCI
- 3.05
- Type
- journal article
- Language
- en
- Open access
- closed
- Locations
- IEEE Transactions on Communications (publishedVersion)
- ePrints Soton (University of Southampton) (acceptedVersion)
- Funders
- European Research Council's Advanced Fellow Grant
- Royal Society's Wolfson Reasearch Merit Award
- Topics
- Physical Sciences › Engineering › Electrical and Electronic Engineering › Advanced Wireless Communication Techniques
- Physical Sciences › Computer Science › Computer Networks and Communications › Wireless Communication Networks Research
- Physical Sciences › Engineering › Electrical and Electronic Engineering › Ultra-Wideband Communications Technology
- Keywords
- multiuser detection, extrinsic information transfer, iterative receiver, low-complexity detection, channel estimation error, uplink, QPSK, maximum a posteriori probability, rank-deficient channels
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: Iterative Quantum-Assisted Multi-User Detection for Multi-Carrier Interleave Division Multiple Access Systems. https://app.cochat.ai/papers/10.1109/tcomm.2015.2458857
- The paper
- Botsinis, P., Alanis, D., Babar, Z., Ng, S. X., & Hanzo, L. (2015). Iterative Quantum-Assisted Multi-User Detection for Multi-Carrier Interleave Division Multiple Access Systems. IEEE Transactions on Communications. https://doi.org/10.1109/tcomm.2015.2458857
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.