Complexity characterization of joint quantum-UAV optimization

Establish the computational complexity characterization of the joint optimization problem for quantum-enabled aerial vehicular communication systems, including qubit allocation, UAV positioning, transmit-power selection, and power-harvesting constraints.

Background

The paper states that, beyond finding feasible resource allocations and deployment positions, the computational complexity of the resulting joint optimization problem has not been established for aerial vehicular quantum communication systems.

This unresolved issue is particularly relevant to symmetric UAV configurations, in which geometric coupling between UAV position and quantum-channel quality produces a non-trivial optimization landscape. The paper formulates the problem as a non-convex mixed-integer nonlinear program and proposes a genetic algorithm, but the cited complexity characterization remains an explicitly identified research gap.