# Lightweight Quantum Agent for Edge Systems: Joint PQC and NOMA Resource Allocation

arXiv: https://arxiv.org/abs/2604.25980 · HTML: https://mlsanity.com/paper/2604.25980/

## Key facts

- No citing papers in the map yet (data through 14 Oct 2026).
- Builds on 6 of its 40 references that are in the map.
- First posted on arXiv 28 Apr 2026.

## Builds on (most cited first, 6 of 6)

- [Applications of Deep Reinforcement Learning in Communications and Networking: A Survey](https://mlsanity.com/paper/1810.07862/) (2018)
- [Mobile Edge Computing: A Survey on Architecture and Computation Offloading](https://mlsanity.com/paper/1702.05309/) (2017)
- [DNN Partitioning, Task Offloading, and Resource Allocation in Dynamic Vehicular Networks: A Lyapunov-Guided Diffusion-Based Reinforcement Learning Approach](https://mlsanity.com/paper/2406.06986/) (2024)
- [Lyapunov-guided Deep Reinforcement Learning for Stable Online Computation Offloading in Mobile-Edge Computing Networks](https://mlsanity.com/paper/2010.01370/) (2020)
- [Computation Rate Maximization for Wireless Powered Mobile-Edge Computing with Binary Computation Offloading](https://mlsanity.com/paper/1708.08810/) (2017)
- [Computation Rate Maximization for Wireless Powered Edge Computing With Multi-User Cooperation](https://mlsanity.com/paper/2402.16866/) (2024)

## Abstract (arXiv)

In the context of quantum secure scenarios, existing research on mobile edge devices and intelligent computing and edge (ICE) systems based on the Non-Orthogonal Multiple Access (NOMA) communication model have overlooked the energy consumption overhead of Post-Quantum Cryptography (PQC) modules, and the high complexity of traditional resource allocation algorithms fails to meet the demands of real-time decision-making. To address these challenges, this paper proposes a lightweight agentic AI framework designed for online joint optimization within ICE-enabled mobile devices. The scheme constructs a multi-stage stochastic Mixed Integer Nonlinear Programming (MINLP) model that incorporates static power-consumption constraints for PQC modules. Based on Lyapunov optimization theory, the long-term optimization problem is decoupled, and a linear complexity algorithm is proposed to solve the nonconvex challenges of NOMA power allocation . Simulation results verify that the proposed scheme significantly improves computational throughput while ensuring system queue stability and energy consumption constraints. Compared with traditional Successive Convex Approximation (SCA) algorithms, the complexity is reduced to O(N), achieving a speedup of approximately 46 times when the number of devices N=35, thereby meeting the real-time decision-making requirements in dynamic wireless environments.
