The University of Southampton
University of Southampton Institutional Repository

Quantum algorithms for wireless communications

Quantum algorithms for wireless communications
Quantum algorithms for wireless communications
Faster, ultra-reliable, low-power and secure communications has always been high on the wireless evolutionary agenda. However, the appetite for faster, more reliable, greener and more secure communications continues to grow. The state-of-the-art methods conceived for achieving the performance targets of the associated processes may be accompanied by an increase in computational complexity. Alternatively, a degraded performance may have to be accepted due to the lack of jointly optimized system components. In this survey we investigate the employment of quantum computing for solving problems in wireless communication systems. By exploiting the inherent parallelism of quantum computing, quantum algorithms may be invoked for approaching the optimal performance of classical wireless processes, despite their reduced number of cost-function evaluations. In this contribution we discuss the basics of quantum computing using linear algebra, before presenting the operation of the major quantum algorithms, which have been proposed in the literature for improving wireless communications systems. Furthermore, we investigate a number of optimization problems encountered both in the physical and network layer of wireless communications, while comparing their classical and quantum-assisted solutions. Finally, we state a number of open problems in wireless communications that may benefit from quantum computing.
1553-877X
Botsinis, Panagiotis
d7927fb0-95ca-4969-9f8c-1c0455524a1f
Alanis, Dimitrios
8ae8ead6-3974-4886-8e17-1b4bff1d94e0
Babar, Zunaira
23ede793-1796-449d-b5aa-93a297e5677a
Nguyen, Hung Viet
6f5a71ef-ea98-49e0-9be7-7f5bb9880f52
Chandra, Daryus
a2f091a8-9772-4633-8e3b-d3220b10a2ec
Ng, Soon
e19a63b0-0f12-4591-ab5f-554820d5f78c
Hanzo, Lajos
66e7266f-3066-4fc0-8391-e000acce71a1
Botsinis, Panagiotis
d7927fb0-95ca-4969-9f8c-1c0455524a1f
Alanis, Dimitrios
8ae8ead6-3974-4886-8e17-1b4bff1d94e0
Babar, Zunaira
23ede793-1796-449d-b5aa-93a297e5677a
Nguyen, Hung Viet
6f5a71ef-ea98-49e0-9be7-7f5bb9880f52
Chandra, Daryus
a2f091a8-9772-4633-8e3b-d3220b10a2ec
Ng, Soon
e19a63b0-0f12-4591-ab5f-554820d5f78c
Hanzo, Lajos
66e7266f-3066-4fc0-8391-e000acce71a1

Botsinis, Panagiotis, Alanis, Dimitrios, Babar, Zunaira, Nguyen, Hung Viet, Chandra, Daryus, Ng, Soon and Hanzo, Lajos (2018) Quantum algorithms for wireless communications. IEEE Communications Surveys & Tutorials. (doi:10.1109/COMST.2018.2882385).

Record type: Article

Abstract

Faster, ultra-reliable, low-power and secure communications has always been high on the wireless evolutionary agenda. However, the appetite for faster, more reliable, greener and more secure communications continues to grow. The state-of-the-art methods conceived for achieving the performance targets of the associated processes may be accompanied by an increase in computational complexity. Alternatively, a degraded performance may have to be accepted due to the lack of jointly optimized system components. In this survey we investigate the employment of quantum computing for solving problems in wireless communication systems. By exploiting the inherent parallelism of quantum computing, quantum algorithms may be invoked for approaching the optimal performance of classical wireless processes, despite their reduced number of cost-function evaluations. In this contribution we discuss the basics of quantum computing using linear algebra, before presenting the operation of the major quantum algorithms, which have been proposed in the literature for improving wireless communications systems. Furthermore, we investigate a number of optimization problems encountered both in the physical and network layer of wireless communications, while comparing their classical and quantum-assisted solutions. Finally, we state a number of open problems in wireless communications that may benefit from quantum computing.

Text
2col-CST-QSAs - Accepted Manuscript
Download (1MB)

More information

Accepted/In Press date: 16 November 2018
e-pub ahead of print date: 20 November 2018

Identifiers

Local EPrints ID: 426321
URI: http://eprints.soton.ac.uk/id/eprint/426321
ISSN: 1553-877X
PURE UUID: 01cd230f-ad1b-4532-aed7-b97f9ace95f6
ORCID for Dimitrios Alanis: ORCID iD orcid.org/0000-0002-6654-1702
ORCID for Zunaira Babar: ORCID iD orcid.org/0000-0002-7498-4474
ORCID for Hung Viet Nguyen: ORCID iD orcid.org/0000-0001-6349-1044
ORCID for Daryus Chandra: ORCID iD orcid.org/0000-0003-2406-7229
ORCID for Soon Ng: ORCID iD orcid.org/0000-0002-0930-7194
ORCID for Lajos Hanzo: ORCID iD orcid.org/0000-0002-2636-5214

Catalogue record

Date deposited: 22 Nov 2018 17:30
Last modified: 07 Oct 2020 08:00

Export record

Altmetrics

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

Atom RSS 1.0 RSS 2.0

Contact ePrints Soton: eprints@soton.ac.uk

ePrints Soton supports OAI 2.0 with a base URL of http://eprints.soton.ac.uk/cgi/oai2

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.

×