Quantum-Aided Multi-Objective Routing Optimization Using Back-Tracing-Aided Dynamic Programming
Open accessThe DOI matches its Crossref record; 13 of the 13 references it cites were found in a registry or an index.
Abstract
Pareto optimality is capable of striking the optimal tradeoff amongst the diverse conflicting quality-of-service requirements of routing in wireless multihop networks. However, this comes at the cost of increased complexity owing to searching through the extended multiobjective search-space. We will demonstrate that the powerful quantum-assisted dynamic programming optimization framework is capable of circumventing this problem. In this context, the so-called evolutionary quantum Pareto optimization (EQPO) algorithm has been proposed, which is capable of identifying most of the optimal routes at a near-polynomial complexity versus the number of nodes. As a benefit, we improve both the EQPO algorithms by introducing a back-tracing process. We also demonstrate that the improved algorithm, namely the back-tracing-aided EQPO algorithm, imposes a negligible complexity overhead, while substantially improving our performance metrics, namely the relative frequency of finding all Pareto-optimal solutions and the probability that the Pareto-optimal solutions are, indeed, a part of the optimal Pareto front.
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.
Integrity signals
Registry
Cites
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.
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
The source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“Both ML and QC has been independently considered for this computationally-tedious and intelligence-needy task of searching in multiple spaces with multiple tight constraints (battery resources etc) to draw a global optimal packet-route in order to optimize the overall network performance, see e.g. in [202] and [33], respectively.”
From Quantum Machine Learning for 6G Communication Networks: State-of-the-Art and Vision for the Future (2019) · cites this paper as [33]
Experimental — accuracy not yet measured
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
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: 10th Anniversary Edition
Nielsen, M. A., & Chuang, I. L. (2012) · doi:10.1017/cbo9780511976667 · Cited by 8,436
Deb, K., & Deb, K. (2014) · Search Methodologies · doi:10.1007/978-1-4614-6940-7_15 · Cited by 1,248
Fei, Z., Li, B., Yang, S., Xing, C., Chen, H., & Hanzo, L. (2017) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2016.2610578 · Cited by 433
Self-citationDeb, K. (2006) · Springer eBooks · doi:10.1007/0-387-28356-0_10 · Cited by 118
Tashtarian, F., Yaghmaee, M. H., Sohraby, K., & Effati, S. (2014) · IEEE Transactions on Vehicular Technology · doi:10.1109/tvt.2014.2354338 · Cited by 97
Quantum-Assisted Routing Optimization for Self-Organizing Networks
ALANIS, D., BOTSINIS, P., NG, S. X., & HANZO, L. (2014) · IEEE Access · doi:10.1109/access.2014.2327596 · Cited by 46 · cited 13×
“We have adopted the WMHN model considered in [7], [8], [10], where the Source Node (SN) and the Destination Node (DN) are located at the opposite corners of a (100× 100) m2 square block.”
BackgroundMethodResultInfluentialSelf-citationNon-Dominated Quantum Iterative Routing Optimization for Wireless Multihop Networks
Alanis, D., Botsinis, P., Babar, Z., Ng, S. X., & Hanzo, L. (2015) · IEEE Access · doi:10.1109/access.2015.2478793 · Cited by 26
Self-citationZhou, A., Liu, M., Li, Z., & Dutkiewicz, E. (2015) · IEEE Transactions on Vehicular Technology · doi:10.1109/tvt.2015.2427091 · Cited by 21
Alanis, D., Botsinis, P., Babar, Z., Nguyen, H. V., Chandra, D., Ng, S. X., & Hanzo, L. (2018) · IEEE Transactions on Communications · doi:10.1109/tcomm.2018.2803068 · Cited by 20
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
“…considered for this computationally-tedious and intelligence-needy task of searching in multiple spaces with multiple tight constraints (battery resources etc) to draw a global optimal packet-route in order to optimize the overall network performance, see e.g. in [202] and [33], respectively.”
BackgroundMethodFive Facets of 6G: Research Challenges and Opportunities
Shen, L.-H., Feng, K.-T., & Hanzo, L. (2023) · ACM Computing Surveys · doi:10.1145/3571072 · Cited by 191
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
“This specific topology has been studied in [65], [66], [122], [123], where the following Utility Vector (UV) f(x) has been utilized:”
BackgroundSelf-citationOptimal Remote Entanglement Distribution
Dai, W., Peng, T., & Win, M. Z. (2020) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2020.2969005 · Cited by 116
Quantum for 6G communication: A perspective
Ali, M. Z., Abohmra, A., Usman, M., Zahid, A., Heidari, H., Imran, M. A., & Abbasi, Q. H. (2023) · IET Quantum Communication · doi:10.1049/qtc2.12060 · Cited by 81
Metadata
- Authors
- Alanis, D., Botsinis, P., Babar, Z., Nguyen, H. V., Chandra, D., Ng, S. X., & Hanzo, L.
- Affiliations
- University of Southampton (GB)
- ORCID
- Venue
- IEEE Transactions on Vehicular Technology
- Published
- 2018-08
- Volume
- 67
- Issue
- 8
- Pages
- 7856-7860
- ISSN
- 0018-9545 (ISSN-L)
- 1939-9359
- OpenAlex
- W2795477603
- Cited by
- 17
- References
- 13
- Citations by year
- 2025: 3 · 2024: 1 · 2023: 5 · 2022: 3 · 2021: 1 · 2020: 1 · 2019: 2 · 2018: 1
- FWCI
- 0.93
- Type
- journal article
- Language
- en
- Open access
- hybrid
- doi.org
- Locations
- IEEE Transactions on Vehicular Technology (publishedVersion, cc-by)
- ePrints Soton (University of Southampton) (acceptedVersion)
- arXiv (Cornell University) (submittedVersion)
- Surrey Research Insight Open Access (The University of Surrey) (submittedVersion)
- arXiv (Cornell University) (cc-by)
- Funders
- ERC's Advanced Fellow QuantCom
- Topics
- Physical Sciences › Computer Science › Computational Theory and Mathematics › Advanced Multi-Objective Optimization Algorithms
- Physical Sciences › Computer Science › Computer Networks and Communications › Mobile Ad Hoc Networks
- Physical Sciences › Computer Science › Artificial Intelligence › Metaheuristic Optimization Algorithms Research
- Keywords
- Pareto optimality, multi-hop wireless networks, Pareto front, algorithmic complexity
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-Aided Multi-Objective Routing Optimization Using Back-Tracing-Aided Dynamic Programming. https://app.cochat.ai/papers/10.1109/tvt.2018.2822626
- The paper
- Alanis, D., Botsinis, P., Babar, Z., Nguyen, H. V., Chandra, D., Ng, S. X., & Hanzo, L. (2018). Quantum-Aided Multi-Objective Routing Optimization Using Back-Tracing-Aided Dynamic Programming. IEEE Transactions on Vehicular Technology. https://doi.org/10.1109/tvt.2018.2822626
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.