A Cost and Power Feasibility Analysis of Quantum Annealing for NextG Cellular Wireless Networks
Open accessThe DOI matches its Crossref record; 76 of the 79 references it cites were found in a registry or an index.
Abstract
In order to meet mobile cellular users' ever-increasing data demands, today's 4 G and 5 G wireless networks are designed mainly with the goal of maximizing spectral efficiency. While they have made progress in this regard, controlling the carbon footprint and operational costs of such networks remains a long-standing problem among network designers. This paper takes a long view on this problem, envisioning a NextG scenario where the network leverages quantum annealing for cellular baseband processing. We gather and synthesize insights on power consumption, computational throughput and latency, spectral efficiency, operational cost, and feasibility timelines surrounding quantum annealing technology. Armed with these data, we project the quantitative performance targets future quantum annealing hardware must meet in order to provide a computational and power advantage over CMOS hardware, while matching its whole-network spectral efficiency. Our quantitative analysis predicts that with 82.32$\mu$s problem latency and 2.68 M qubits, quantum annealing will achieve a spectral efficiency equal to CMOS while reducing power consumption by 41 kW (45% lower) in a Large MIMO base station with 400 MHz bandwidth and 64 antennas, and a 160 kW power reduction (55% lower) using 8.04 M qubits in a CRAN setting with three Large MIMO base stations.
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
“This enhancement allows the quantum annealer to increase the potential for fi nding high-quality solutions 24,25 .”
From Quantum annealing for combinatorial optimization: a benchmarking study (2025) · cites this paper as [25]
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 supremacy using a programmable superconducting processor
Arute, F., Arya, K., Babbush, R., Bacon, D., Bardin, J. C., Barends, R., Biswas, R., Boixo, S., Brandao, F. G. S. L., Buell, D. A., et al. (2019) · Nature · doi:10.1038/s41586-019-1666-5 · Cited by 7,720
Massive MIMO for next generation wireless systems
Larsson, E. G., Edfors, O., Tufvesson, F., & Marzetta, T. L. (2014) · IEEE Communications Magazine · doi:10.1109/mcom.2014.6736761 · Cited by 6,779
Design of ion-implanted MOSFET's with very small physical dimensions
Dennard, R. H., Gaensslen, F. H., Yu, H.-N., Rideout, V. L., Bassous, E., & LeBlanc, A. R. (1974) · IEEE Journal of Solid-State Circuits · doi:10.1109/jssc.1974.1050511 · Cited by 3,548
Next generation 5G wireless networks: a comprehensive survey
Agiwal, M., Roy, A., & Saxena, N. (2016) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2016.2532458 · Cited by 3,444 · cited 1×
“To meet the resulting demand, the BBU processing (i.e., digital processing) from many BSs is being aggregated into centralized locations, a concept referred to as a CRAN [39], [40].”
BackgroundQuantum annealing with manufactured spins
Johnson, M. W., Amin, M. H. S., Gildert, S., Lanting, T., Hamze, F., Dickson, N., Harris, R., Berkley, A. J., Johansson, J., Bunyk, P., et al. (2011) · Nature · doi:10.1038/nature10012 · Cited by 1,891
Cloud RAN for Mobile Networks—A Technology Overview
Checko, A., Christiansen, H. L., Yan, Y., Scolari, L., Kardaras, G., Berger, M. S., & Dittmann, L. (2015) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2014.2355255 · Cited by 1,559
Dark silicon and the end of multicore scaling
Esmaeilzadeh, H., Blem, E., St. Amant, R., Sankaralingam, K., & Burger, D. (2011) · Proceedings of the 38th annual international symposium on Computer architecture · doi:10.1145/2000064.2000108 · Cited by 1,532
HEURISTICS FOR INTEGER PROGRAMMING USING SURROGATE CONSTRAINTS
Glover, F. (1977) · Decision Sciences · doi:10.1111/j.1540-5915.1977.tb01074.x · Cited by 1,363
Leakage current: Moore's law meets static power
Kim, N. S., Austin, T., Blaauw, D., Mudge, T., Flautner, K., Hu, J. S., Irwin, M. J., Kandemir, M., & Narayanan, V. (2003) · Computer · doi:10.1109/mc.2003.1250885 · Cited by 1,226
Quantum computing with realistically noisy devices
Knill, E. (2005) · Nature · doi:10.1038/nature03350 · Cited by 1,184 · cited 1×
“The current and near-term quantum technology can be broadly classified into digital gate-model and analog annealing-model architectures [15], [16], [17], [18].”
Background
Research works printed but not linked: 9
- Annual Internet Report (20182023)
- 2021, Technical Description of the D-Wave Quantum Processing Unit
- D-Wave QPU Architecture: Topologies
- 2021, Solver Computation Time
- Harris, Outrunning the bear: Quantum annealing in the presence of an environment, 2021
- 10.1103/prxquantum.1.020314 · doi:10.1103/prxquantum.1.020314
- 2021, Postprocessing Methods on D-Wave Systems
- 2003, International Technology Roadmap for Semiconductors, Executive Report
- Lidar, 2021, Achievements of the IARPA-QEO and DARPA-QAFS programs & The prospects for quantum enhancement with QA
Cited by
Ising Machines’ Dynamics and Regularization for Near-Optimal MIMO Detection
Singh, A. K., Jamieson, K., McMahon, P. L., & Venturelli, D. (2022) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2022.3189604 · Cited by 66
Self-citationQuantum annealing for combinatorial optimization: a benchmarking study
Kim, S., Ahn, S.-W., Suh, I.-S., Dowling, A. W., Lee, E., & Luo, T. (2025) · npj Quantum Information · doi:10.1038/s41534-025-01020-1 · Cited by 46
“Published in partnership with The University of New South Wales https://doi.org/10.1038/s41534-025-01020-1 Quantum annealing for combinatorial optimization: a benchmarking study”
InfluentialQuantum Computing in Telecommunication—A Survey
Phillipson, F. (2023) · Mathematics · doi:10.3390/math11153423 · Cited by 40
Andreou, A., Mavromoustakis, C. X., Markakis, E., Bourdena, A., & Mastorakis, G. N. (2025) · IEEE Access · doi:10.1109/access.2025.3554024 · Cited by 29
A Quantum Annealer-Enabled Decoder and Hardware Topology for NextG Wireless Polar Codes
Kasi, S., Kaewell, J., & Jamieson, K. (2023) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2023.3311204 · Cited by 26
Self-citation
Metadata
- Authors
- Kasi, S., Warburton, P., Kaewell, J., & Jamieson, K.
- Affiliations
- Princeton University (US)
- University College London (GB)
- InterDigital (United States) (US)
- Venue
- IEEE Transactions on Quantum Engineering
- Published
- 2023
- Volume
- 4
- Pages
- 1-17
- ISSN
- 2689-1808 (ISSN-L)
- OpenAlex
- W4387885957
- Cited by
- 20
- References
- 79
- Citations by year
- 2026: 3 · 2025: 6 · 2024: 6 · 2023: 3
- FWCI
- 1.59
- Type
- journal article
- Language
- en
- Open access
- gold
- doi.org
- Licence
- Locations
- IEEE Transactions on Quantum Engineering (publishedVersion, cc-by)
- arXiv (Cornell University) (submittedVersion)
- UCL Discovery (University College London) (submittedVersion, cc-by)
- DOAJ (DOAJ: Directory of Open Access Journals) (submittedVersion, cc-by-sa)
- arXiv (Cornell University)
- Funders
- National Science Foundation (CNS-1824357)
- Engineering and Physical Sciences Research Council Hub in Quantum Computing and Simulation (EP/T001062/1)
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
- Physical Sciences › Engineering › Electrical and Electronic Engineering › Advanced MIMO Systems Optimization
- Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum Information and Cryptography
- Keywords
- quantum annealing, power consumption, operating costs, spectral efficiency, MIMO base station, centralized radio access network, qubit requirements, carbon footprint, CMOS comparison, 5G
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: A Cost and Power Feasibility Analysis of Quantum Annealing for NextG Cellular Wireless Networks. https://app.cochat.ai/papers/10.1109/tqe.2023.3326469
- The paper
- Kasi, S., Warburton, P., Kaewell, J., & Jamieson, K. (2023). A Cost and Power Feasibility Analysis of Quantum Annealing for NextG Cellular Wireless Networks. IEEE Transactions on Quantum Engineering. https://doi.org/10.1109/tqe.2023.3326469
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.