Quantum Search 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 targ...
Saved in:
| Published in | IEEE Communications surveys and tutorials Vol. 21; no. 2; pp. 1209 - 1242 |
|---|---|
| Main Authors | , , , , , , |
| Format | Journal Article |
| Language | English |
| Published |
IEEE
01.01.2019
|
| Subjects | |
| Online Access | Get full text |
| ISSN | 1553-877X 2373-745X 2373-745X |
| DOI | 10.1109/COMST.2018.2882385 |
Cover
| 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. |
|---|---|
| AbstractList | 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. |
| Author | Nguyen, Hung Viet Botsinis, Panagiotis Ng, Soon Xin Chandra, Daryus Hanzo, Lajos Alanis, Dimitrios Babar, Zunaira |
| Author_xml | – sequence: 1 givenname: Panagiotis surname: Botsinis fullname: Botsinis, Panagiotis email: pb1y14@ecs.soton.ac.uk organization: School of Electronics and Computer Science, University of Southampton, Southampton, U.K – sequence: 2 givenname: Dimitrios orcidid: 0000-0002-6654-1702 surname: Alanis fullname: Alanis, Dimitrios email: da1d16@ecs.soton.ac.uk organization: School of Electronics and Computer Science, University of Southampton, Southampton, U.K – sequence: 3 givenname: Zunaira surname: Babar fullname: Babar, Zunaira email: zb2g10@ecs.soton.ac.uk organization: School of Electronics and Computer Science, University of Southampton, Southampton, U.K – sequence: 4 givenname: Hung Viet orcidid: 0000-0001-6349-1044 surname: Nguyen fullname: Nguyen, Hung Viet email: hvn08r@ecs.soton.ac.uk organization: School of Electronics and Computer Science, University of Southampton, Southampton, U.K – sequence: 5 givenname: Daryus orcidid: 0000-0003-2406-7229 surname: Chandra fullname: Chandra, Daryus email: dc2n14@ecs.soton.ac.uk organization: School of Electronics and Computer Science, University of Southampton, Southampton, U.K – sequence: 6 givenname: Soon Xin orcidid: 0000-0002-0930-7194 surname: Ng fullname: Ng, Soon Xin email: sxn@ecs.soton.ac.uk organization: School of Electronics and Computer Science, University of Southampton, Southampton, U.K – sequence: 7 givenname: Lajos orcidid: 0000-0002-2636-5214 surname: Hanzo fullname: Hanzo, Lajos email: lh@ecs.soton.ac.uk organization: School of Electronics and Computer Science, University of Southampton, Southampton, U.K |
| BookMark | eNo9j81Kw0AUhQepYFp9Ad3kBVJn5s5fliWoFSpFWrG7MBlvbCSTlEyC9O1NaXF1Vt8555uSSdM2SMg9o3PGaPqYrd822zmnzMy5MRyMvCIRBw2JFnI3IRGTEhKj9e6GTEP4oVRwkdKIyPfBNv3g4w3azu3jRf3ddlW_9yEu2y7-rDqsMYQ4a70fmsrZvmqbcEuuS1sHvLvkjHw8P22zZbJav7xmi1XiBJV9UoJzmguFUoEYb1mKxmilJTDHLdOlkUIB54o7lioqrCzAoPtCXbjCIYcZgXPv0Bzs8dfWdX7oKm-7Y85ofjLPXetDn5_M84v5SD2cqQoR_4FxixpI4Q-drFd6 |
| CitedBy_id | crossref_primary_10_1109_MWC_003_2200382 crossref_primary_10_1109_MVT_2019_2921208 crossref_primary_10_1109_JSAC_2024_3443759 crossref_primary_10_37005_2071_9612_2020_1_126_151 crossref_primary_10_1109_MNET_012_2000770 crossref_primary_10_1109_OJVT_2020_3044569 crossref_primary_10_1109_TETC_2023_3292355 crossref_primary_10_1111_exsy_12880 crossref_primary_10_1109_ACCESS_2021_3061499 crossref_primary_10_1109_TWC_2024_3442091 crossref_primary_10_1002_pc_29432 crossref_primary_10_1007_s44214_024_00069_x crossref_primary_10_1109_ACCESS_2023_3301811 crossref_primary_10_3390_fi15030094 crossref_primary_10_1109_ACCESS_2022_3164071 crossref_primary_10_1109_OJCOMS_2021_3081166 crossref_primary_10_1016_j_aej_2022_08_017 crossref_primary_10_1109_LWC_2021_3077311 crossref_primary_10_1109_OJCOMS_2024_3380508 crossref_primary_10_1109_TQE_2023_3293452 crossref_primary_10_1109_COMST_2021_3109944 crossref_primary_10_1109_OJCOMS_2024_3472094 crossref_primary_10_1109_ACCESS_2021_3103207 crossref_primary_10_1109_ACCESS_2019_2909490 crossref_primary_10_37005_2071_9612_2020_1_85_125 crossref_primary_10_1109_ACCESS_2020_3045016 crossref_primary_10_1016_j_comcom_2024_02_019 crossref_primary_10_1109_MCOM_001_2200362 crossref_primary_10_1109_ACCESS_2024_3366527 crossref_primary_10_1109_ACCESS_2023_3237997 crossref_primary_10_1016_j_sigpro_2019_107441 crossref_primary_10_1109_TQE_2023_3264638 crossref_primary_10_1109_JPROC_2022_3173031 crossref_primary_10_1109_ACCESS_2023_3322446 crossref_primary_10_1109_MVT_2021_3085511 crossref_primary_10_1109_OJCOMS_2024_3461334 crossref_primary_10_1109_TCOMM_2023_3244924 crossref_primary_10_3390_su142315901 crossref_primary_10_1109_ACCESS_2020_3010896 crossref_primary_10_1109_TWC_2024_3516077 crossref_primary_10_3390_app11178117 crossref_primary_10_1109_ACCESS_2021_3124812 crossref_primary_10_1109_ACCESS_2024_3411307 crossref_primary_10_1109_COMST_2024_3367535 crossref_primary_10_1103_PhysRevResearch_7_L012017 crossref_primary_10_3390_math11153423 crossref_primary_10_1109_MWC_006_00340 crossref_primary_10_1109_ACCESS_2019_2910776 crossref_primary_10_1109_OJCOMS_2023_3309268 crossref_primary_10_1109_ACCESS_2025_3528443 crossref_primary_10_1016_j_asoc_2023_110458 crossref_primary_10_3390_fi17020050 crossref_primary_10_1109_OJCOMS_2021_3103735 crossref_primary_10_1109_TNNLS_2022_3190042 crossref_primary_10_1109_OJCOMS_2021_3112486 crossref_primary_10_1109_ACCESS_2020_3006136 crossref_primary_10_1109_ACCESS_2022_3198656 crossref_primary_10_1109_TCOMM_2022_3220692 crossref_primary_10_1109_TCOMM_2020_2978071 crossref_primary_10_1109_TCOMM_2024_3420768 crossref_primary_10_1016_j_imu_2024_101606 crossref_primary_10_1109_TVT_2021_3055537 crossref_primary_10_1109_OJCOMS_2024_3382225 crossref_primary_10_1109_ACCESS_2020_2994494 crossref_primary_10_1109_MCOM_009_2300856 crossref_primary_10_3390_su14106356 crossref_primary_10_1007_s12243_020_00803_1 crossref_primary_10_1016_j_icte_2022_01_014 crossref_primary_10_1002_cpe_6943 crossref_primary_10_3390_su16167039 crossref_primary_10_1002_qute_202300262 crossref_primary_10_1016_j_sysarc_2021_102180 crossref_primary_10_1109_JIOT_2023_3285968 |
| ContentType | Journal Article |
| DBID | 97E ESBDL RIA RIE ADTOC UNPAY |
| DOI | 10.1109/COMST.2018.2882385 |
| DatabaseName | IEEE All-Society Periodicals Package (ASPP) 2005–Present IEEE Xplore Open Access Journals IEEE All-Society Periodicals Package (ASPP) 1998–Present IEEE Electronic Library (IEL) Unpaywall for CDI: Periodical Content Unpaywall |
| DatabaseTitleList | |
| Database_xml | – sequence: 1 dbid: RIE name: IEEE Electronic Library (IEL) url: https://proxy.k.utb.cz/login?url=https://ieeexplore.ieee.org/ sourceTypes: Publisher – sequence: 2 dbid: UNPAY name: Unpaywall url: https://proxy.k.utb.cz/login?url=https://unpaywall.org/ sourceTypes: Open Access Repository |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering |
| EISSN | 2373-745X |
| EndPage | 1242 |
| ExternalDocumentID | 10.1109/comst.2018.2882385 8540839 |
| Genre | orig-research |
| GrantInformation_xml | – fundername: Engineering and Physical Sciences Research Council grantid: EP/L018659/1 funderid: 10.13039/501100000266 |
| GroupedDBID | 0R~ 29I 2WC 4.4 5GY 5VS 6IK 97E AAJGR AARMG AASAJ AAWTH ABAZT ABQJQ ABVLG ACGFO ACIWK AENEX AETIX AGQYO AGSQL AHBIQ AIBXA AKJIK AKQYR ALLEH ALMA_UNASSIGNED_HOLDINGS ATWAV AZLTO BEFXN BFFAM BGNUA BKEBE BPEOZ CS3 EBS EJD ESBDL HZ~ IES IFIPE IFJZH IPLJI JAVBF LAI O9- OCL P2P RIA RIE RNS ADTOC UNPAY |
| ID | FETCH-LOGICAL-c405t-f3cc7246e5634882a0e88767531c2a17f854632262c19604a5b38ecde7bcbce23 |
| IEDL.DBID | RIE |
| ISSN | 1553-877X 2373-745X |
| IngestDate | Wed Oct 01 16:49:11 EDT 2025 Wed Aug 27 06:00:23 EDT 2025 |
| IsDoiOpenAccess | true |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 2 |
| Language | English |
| License | cc-by |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c405t-f3cc7246e5634882a0e88767531c2a17f854632262c19604a5b38ecde7bcbce23 |
| ORCID | 0000-0001-6349-1044 0000-0002-6654-1702 0000-0003-2406-7229 0000-0002-0930-7194 0000-0002-2636-5214 |
| OpenAccessLink | https://proxy.k.utb.cz/login?url=https://ieeexplore.ieee.org/document/8540839 |
| PageCount | 34 |
| ParticipantIDs | ieee_primary_8540839 unpaywall_primary_10_1109_comst_2018_2882385 |
| PublicationCentury | 2000 |
| PublicationDate | 2019-01-01 |
| PublicationDateYYYYMMDD | 2019-01-01 |
| PublicationDate_xml | – month: 01 year: 2019 text: 2019-01-01 day: 01 |
| PublicationDecade | 2010 |
| PublicationTitle | IEEE Communications surveys and tutorials |
| PublicationTitleAbbrev | COMST |
| PublicationYear | 2019 |
| Publisher | IEEE |
| Publisher_xml | – name: IEEE |
| SSID | ssj0042490 |
| Score | 2.5803103 |
| Snippet | Faster, ultra-reliable, low-power, and secure communications has always been high on the wireless evolutionary agenda. However, the appetite for faster, more... |
| SourceID | unpaywall ieee |
| SourceType | Open Access Repository Publisher |
| StartPage | 1209 |
| SubjectTerms | Algorithm design and analysis Channel estimation Heuristic algorithms localization multiuser detection non-orthogonal multiple access optimization precoding quantum algorithms quantum computing Quantum entanglement routing visible light communication Wireless communication |
| SummonAdditionalLinks | – databaseName: Unpaywall dbid: UNPAY link: http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnZ3La9tAEIcHxzkkOSRN3dKkD3TIsZIt7ZueTKkJhYYWanChIHZXoyZEcUws0cdf31lJNklu7U1COmh39vHNauY3AGfKKyQ_GeOUex1zJ2RsBXMxSiQ6txkW7dHFpwt5PucfF2IxgHfbXBhEbIPPMAmX7b_8K6x-BSlYZsaatlsi9jGBAid4MMmqKHdgVwoC8SHszi8-T7-1CqmC0TxXi7a0nGKx4mKxSZmZmDEZcx0CKVOdZISYLFRSbourHMBes1zZ3z9tVd3bZ2ZH8H3zhV14yXXS1C7xfx6JN_5nE57AYc-f0bQbMMcwwOVTOLinSjgC8aWh7m5uoi4UOZpWP27vrurLm3VEhBuFeNmK1sfoQW7J-hnMZx--vj-P--oKsSdIq-OSea8yLlFIRrM4sxOkBYf8B5b6zKaq1EEpn-gs82lQcLHCMY2-QOW885ix5zBc3i7xBUSl5r6QxhmpFZfSOW3KgtjRW11ya_AERqEn8lUnoJH3LT-Bt9vO3j5rnZKJyVsT5cFEeW-i0397_SXs063pjktewbC-a_A1AUTt3vQD5S9i8b9U priority: 102 providerName: Unpaywall |
| Title | Quantum Search Algorithms for Wireless Communications |
| URI | https://ieeexplore.ieee.org/document/8540839 https://ieeexplore.ieee.org/ielx7/9739/8727625/08540839.pdf |
| UnpaywallVersion | publishedVersion |
| Volume | 21 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwjV1LT8JAEJ4IHpSDLzTig_TgkfLoY7s9EiIhJqBGSPDU7G6naiyPQBujv97ZFggaD9426abZ3enOfDOd-QbgxlMekp-MZstR3HSky0zh2tJEhoTOhYVhFrroD1hv5NyN3fEO1Da1MIiYJZ9hXQ-zf_nhTKU6VNbgBC_IoBeg4HGW12qtta5DbkRzXRTT9Bud-_7TUGdu8bpFINLWvZKz9ikl2Eunc_H5IeJ4y5J0D6G_XkOeQPJeTxNZV1-_6Bn_u8gjOFhBSqOdfwPHsIPTEyhtEQ2WwX1M6QTTiZFnFxvt-GW2eEteJ0uDQKuhU2BjUnnGj3KR5SmMurfDTs9cNUwwFeGuxIxspTzLYegymy6mJZpIOoRcArulLNHyIq7J7wlwWaqlSVmEK22OKkRPKqnQss-gOJ1N8RyMiDsqZL70GfccxqTkfhQSHFSCR47wsQJlvfVgnnNiBKtdV6C2Od3Ns8zPaPoBXaFlEmiZBCuZXPz9lkvYp1l-Hum4gmKySPGabH8iq5nQq7A7Gjy0n78Bg2CvoQ |
| linkProvider | IEEE |
| linkToHtml | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwjV1LT8JAEJ4gHtSDLzTiswePFKHdbrdHYySoFGPEhFuzu52qEcFIG6O_3tm2EDQevDVp2uxz9pvZb74BOPW1j-Qno91mWthMedyWnqts5EjoXDoY56GLsM-7D-x66A0r0JjnwiBiTj7DpnnM7_Ljic5MqOxMELygA30Jlj3GmFdka83sLiNHojVLi2kFZxe34f3AcLdE0yEY6ZpqyXkBlTVYycZv8vNDjkYLZ0lnA8JZKwoKyUszS1VTf_0SaPxvMzdhvQSV1nmxCragguNtWFuQGqyBd5fRGGavVsEvts5Hj5P35_TpdWoRbLUMCXZERs_6kTAy3YGHzuXgomuXJRNsTcgrtRNXa99hHD3u0tZ0ZAvJipBT4La1I9t-Ioz8PUEuR7eNLIv0lCtQx-grrTQ67i5Ux5Mx7oGVCKZjHqiAC59xrpQIkpgAoZYiYTLAOtRM16O3QhUjKntdh8Z8dOfvck-jFUS0iaZpZOYkKudk_--_nMBKdxD2ot5V_-YAVumLoIh7HEI1fc_wiJBAqo7zBfANWS6xPg |
| linkToUnpaywall | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnZ3La9tAEIcHxzkkOSRN3dKkD3TIsZIt7ZueTKkJhYYWanChIHZXoyZEcUws0cdf31lJNklu7U1COmh39vHNauY3AGfKKyQ_GeOUex1zJ2RsBXMxSiQ6txkW7dHFpwt5PucfF2IxgHfbXBhEbIPPMAmX7b_8K6x-BSlYZsaatlsi9jGBAid4MMmqKHdgVwoC8SHszi8-T7-1CqmC0TxXi7a0nGKx4mKxSZmZmDEZcx0CKVOdZISYLFRSbourHMBes1zZ3z9tVd3bZ2ZH8H3zhV14yXXS1C7xfx6JN_5nE57AYc-f0bQbMMcwwOVTOLinSjgC8aWh7m5uoi4UOZpWP27vrurLm3VEhBuFeNmK1sfoQW7J-hnMZx--vj-P--oKsSdIq-OSea8yLlFIRrM4sxOkBYf8B5b6zKaq1EEpn-gs82lQcLHCMY2-QOW885ix5zBc3i7xBUSl5r6QxhmpFZfSOW3KgtjRW11ya_AERqEn8lUnoJH3LT-Bt9vO3j5rnZKJyVsT5cFEeW-i0397_SXs063pjktewbC-a_A1AUTt3vQD5S9i8b9U |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Quantum+Search+Algorithms+for+Wireless+Communications&rft.jtitle=IEEE+Communications+surveys+and+tutorials&rft.au=Botsinis%2C+Panagiotis&rft.au=Alanis%2C+Dimitrios&rft.au=Babar%2C+Zunaira&rft.au=Nguyen%2C+Hung+Viet&rft.date=2019-01-01&rft.pub=IEEE&rft.eissn=2373-745X&rft.volume=21&rft.issue=2&rft.spage=1209&rft.epage=1242&rft_id=info:doi/10.1109%2FCOMST.2018.2882385&rft.externalDocID=8540839 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1553-877X&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1553-877X&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1553-877X&client=summon |