Quantum Optimization for Access Point Selection Under Budget Constraint

arXiv:2602.15049v1 Announce Type: new
Abstract: Optimal Access Point (AP) selection is crucial for accurate indoor localization, yet it is constrained by budget, creating a trade-off between localization accuracy and deployment cost. Classical approaches to AP selection are often computationally expensive, hindering their application in large-scale 3D indoor environments.
In this paper, we introduce a quantum APs selection algorithm under a budget constraint. The proposed algorithm leverages quantum annealing to identify the most effective subset of APs allowed within a given budget. We formulate the APs selection problem as a quadratic unconstrained binary optimization (QUBO) problem, making it suitable for quantum annealing solvers. The proposed technique can drastically reduce infrastructure requirements with a negligible impact on performance.
We implement the proposed quantum algorithm and deploy it in a realistic 3D testbed. Our results show that the proposed approach can reduce the number of required APs by 96.1% while maintaining a comparable 3D localization accuracy. Furthermore, the proposed quantum approach outperforms classical AP selection algorithms in both accuracy and computational speed. Specifically, our technique achieves a time of 0.20 seconds, representing a speedup of 61 times over its classical counterpart, while reducing the mean localization error by 10% compared to the classical counterpart. For floor localization, the quantum approach achieves 73% floor accuracy, outperforming both the classical AP selection (58.6%) and even using the complete set of APs (70.4%). This highlights the promise of the proposed quantum APs selection algorithm for large-scale 3D localization.