Resource management in next-generation wireless communication networks poses substantial computational challenges due to its combinatorial structure and mixed discrete–continuous nature. Many such problems are NP-hard (non-deterministic polynomial-time hard), rendering conventional optimization techniques computationally demanding and often impractical for large-scale deployments. Recent advances in neutral atom quantum computing have demonstrated innovative potential for solving combinatorial optimization problems through graph-based formulations. However, their application to wireless resource management remains largely unexplored. This paper investigates the use of neutral atom quantum processors to address the maximum access problem (MAP) in uplink non-orthogonal multiple access (NOMA)-enabled non-terrestrial networks (NTNs). The MAP is first formulated as a large-scale mixed-integer optimization problem that jointly captures admission control, user clustering, channel assignment, and power allocation under signal-to-interference-plus-noise ratio (SINR) constraints, while accounting for imperfect successive interference cancellation (SIC) at the receiver. To enable hardware-aligned quantum implementation, the problem is transformed into a maximum independent set (MIS) problem over a conflict graph. The resulting graph structure is compatible with the operational principles of neutral atom quantum hardware, allowing direct mapping onto Rydberg atom arrays via blockade-induced interactions. Numerical evaluations assess admission performance, graph complexity, and computational behavior, highlighting the effectiveness of the proposed neutral atom-based framework for solving such graph-theoretic problems. By integrating quantum combinatorial optimization into wireless resource management, this work demonstrates a hardware-aligned mapping for NOMA-enabled NTN resource allocation and provides proof-of-concept validation on a current neutral atom processor, showcasing the potential of neutral atom quantum processors for addressing optimization problems in future 6G and beyond networks.
Resource management in next-generation wireless communication networks poses substantial computational challenges due to its combinatorial structure and mixed discrete–continuous nature. Many such problems are NP-hard (non-deterministic polynomial-time hard), rendering conventional optimization techniques computationally demanding and often impractical for large-scale deployments. Recent advances in neutral atom quantum computing have demonstrated innovative potential for solving combinatorial optimization problems through graph-based formulations. However, their application to wireless resource management remains largely unexplored. This paper investigates the use of neutral atom quantum processors to address the maximum access problem (MAP) in uplink non-orthogonal multiple access (NOMA)-enabled non-terrestrial networks (NTNs). The MAP is first formulated as a large-scale mixed-integer optimization problem that jointly captures admission control, user clustering, channel assignment, and power allocation under signal-to-interference-plus-noise ratio (SINR) constraints, while accounting for imperfect successive interference cancellation (SIC) at the receiver. To enable hardware-aligned quantum implementation, the problem is transformed into a maximum independent set (MIS) problem over a conflict graph. The resulting graph structure is compatible with the operational principles of neutral atom quantum hardware, allowing direct mapping onto Rydberg atom arrays via blockade-induced interactions. Numerical evaluations assess admission performance, graph complexity, and computational behavior, highlighting the effectiveness of the proposed neutral atom-based framework for solving such graph-theoretic problems. By integrating quantum combinatorial optimization into wireless resource management, this work demonstrates a hardware-aligned mapping for NOMA-enabled NTN resource allocation and provides proof-of-concept validation on a current neutral atom processor, showcasing the potential of neutral atom quantum processors for addressing optimization problems in future 6G and beyond networks.
In wireless communication networks, many resource optimization problems are nondeterministic polynomial-time hard (NP-hard) due to their combinatorial nature and high computational complexity. Recently, neutral-atom-based quantum computing has emerged as a promising platform for efficiently solving such problems by leveraging quantum superposition and entanglement. However, its application to wireless communication optimization problems remains largely unexplored. In this paper, we investigate the use of neutral-atom quantum platforms to solve the maximum access problem (MAP), formulated as a mixed-integer programming task that jointly considers admission control, user clustering, channel assignment, and power allocation in a non-orthogonal multiple access (NOMA)-enabled uplink network. To reduce the computational burden, the MAP is equivalently reformulated as a maximum independent set (MIS) problem in graph theory. This reformulation enables the use of the neutral atom platform based on Rydberg atom arrays, where the MIS problem is naturally encoded into the physical geometry and blockade constraints of the quantum system. Numerical results demonstrate the feasibility and potential of this approach for addressing large-scale wireless resource optimization problems.
In this paper, we propose a novel uplink Hybrid Non-Orthogonal Multiple Access (NOMA) architecture assisted by Rydberg Atomic Quantum Receivers (RAQRs) to improve energy efficiency by addressing the physical constraints of atomic sensing. We formulate a joint optimization problem encompassing phase measurements and multi-user power allocation to minimize the total transmit power. This problem is particularly challenging due to the non-linear amplitude-only observations of atomic vapor cells. To decomposes the resulting non-convexity, we develop a hierarchical three-layer decomposition optimization framework that systematically decouples the global problem. The inner layer employs a customized Expectation Maximization-Gerchberg-Saxton (EM-GS) algorithm to resolve phase ambiguity and estimate equivalent channel gains. The middle layer derives closed-form optimal power allocation solutions via Karush-Kuhn-Tucker (KKT) conditions. The outer layer utilizes linear Minimum Mean Square Error (MMSE) detection for high-reliability signal recovery. Simulation results demonstrate the superiority of the proposed framework over conventional RF-based Hybrid NOMA. Notably, the atomic architecture achieves approximately a 93% reduction in total power consumption compared to Orthogonal Multiple Access (OMA) baselines while maintaining strict backward compatibility, thereby laying a solid foundation for practical deployment in next-generation green communication networks.
Quantum annealing (QA) offers a physics-inspired approach for such subproblems by mapping them onto an Ising Hamiltonian, which is algebraically equivalent to a Quadratic Unconstrained Binary Optimization (QUBO) model executable on quantum annealers or hybrid solvers. However, their practical employment in wireless systems critically depends on the specific problem formulation, on the particular variable encoding, constraint handling, solver selection, hardware embedding, and fair benchmarking. This paper develops wireless-oriented QUBO modeling guidelines for QA-assisted resource allocation. We first present a beginner-friendly toy example in which a terrestrial-aerial resource-allocation problem with a fractional signal-to-interference-plus-noise ratio (SINR) maximization objective is reformulated into a two-bit QUBO via Boolean interpolation, converted into an Ising representation, and decoded back into a wireless scheduling decision. The same scheduling is applicable to UAV, aircraft, satellite, and terrestrial links in SAGIN systems. We then review the QA foundations and solver ecosystems, including binary quadratic, discrete quadratic, constrained quadratic, and hybrid models from the perspective of NG wireless optimization. Furthermore, we discuss both binary and discrete encoding, penalty-based constraint conversion, embedding overhead, solution decoding, and feasibility verification. A QUBO Compatibility Index is introduced as a lightweight diagnostic metric for assessing the associated QUBO formulation readiness, rather than a predictor of runtime or solution quality. Finally, a case study on max-min uplink power control in cell-free massive MIMO illustrates how a fairness-oriented wireless problem can be discretized, constrained, converted into the concept of a QUBO, and evaluated against classical baselines. A host of key challenges and future directions are also discussed.
To support the rapid proliferation of IoT devices, non-uniform multiple access (NOMA) admission control appears as a promising technology. Indeed, through spectrum reuse, it allows more devices to communicate than the traditional orthogonal frequency-division multiple access scheme of 4G. Previous research has shown that the NOMA allocation problem can be formulated into a maximum independent set problem, which is NP-hard. Recent advances in quadratic unconstrained binary optimization (QUBO) solvers show promise in their capability to solve this kind of allocation problems efficiently. We explore various QUBO formulations to determine which is best-suited for the high-frequency requirements of the NOMA allocation problem.
As wireless networks advance toward the Sixth Generation (6G), which will support highly heterogeneous scenarios and massive data traffic, conventional computing methods may struggle to meet the immense processing demands in a resource-efficient manner. This paper explores the potential of quantum computing (QC) to address these challenges, specifically by enhancing the efficiency of Maximum-Likelihood detection in Multiple-Input Multiple-Output (MIMO) Non-Orthogonal Multiple Access (NOMA) communication systems, an essential technology anticipated for 6G. The study proposes the use of the Quantum Approximate Optimization Algorithm (QAOA), a variational quantum algorithm known for providing quantum advantages in certain combinatorial optimization problems. While current quantum systems are not yet capable of managing millions of physical qubits or performing high-fidelity, long gate sequences, the results indicate that QAOA is a promising QC approach for radio signal processing tasks. This research provides valuable insights into the potential transformative impact of QC on future wireless networks. This sets the stage for discussions on practical implementation challenges, such as constrained problem sizes and sensitivity to noise, and opens pathways for future research aimed at fully harnessing the potential of QC for 6G and beyond.
Nash equilibria are crucial for understanding game behavior and systems in economics, physics, biology, and computer science. A significant application arises from the connection between Nash equilibria and optimization problems . However, finding Nash equilibria is challenging due to its NP-Hard complexity, specifically within the PPAD class. By exploiting the correspondence between Maximum Independent Sets (MIS) and Nash equilibria on unit-disk graphs, we map these problems onto the ground state configurations of Rydberg atom arrays. Simulations show the effectiveness of this quantum method, highlighting its potential for solving complex problems in game theory.