As the demand for high-performance and dynam-ically adaptable network services continues to grow, the convergence of quantum computing and network orchestration represents a promising development. This paper explores the transformative potential of quantum computing in the orches-tration of network services and introduces new paradigms that transcend classical limitations. Using a case study, we propose a workflow for an exemplary link failure process for generative AI (GenAI) and quantum computing-based service orchestration in an edge cloud (EC) network. Later, we address the challenges of integrating services based on quantum computing (using a quan-tum search algorithm to select the best connections) with GenAI-based topology control and management in an orchestration framework. Our work also introduces multi-solution quantum search for orchestrating services across different edge clouds, emphasizing efficiency and accuracy. Algorithmic considerations, including the impact of the oracle and hybrid approaches, are also thoroughly explored. We conclude the paper with potentials and comparisons of possible GenAl techniques and quantum search algorithms in terms of their advantages and disadvantages.

International Conference on Computer, Information and Telecommunication SystemsJul 17, 20244 citations

Quantum Orchestrator Design for Service Management in Edge-Cloud Continuum

Engin Zeydan, Josep Mangues‐Bafalluy, Yekta Türk +2 more

As edge cloud environments become increasingly complex, efficient service management requires advanced orchestration strategies that can handle diverse and dynamic network conditions. In this paper, we present a novel quantum-based orchestration framework that leverages quantum search algorithm (Grover in particular) to optimize the management of services within the edge cloud continuum. We present a multi-objective optimization model that considers critical factors such as latency, bandwidth, reliability, and error minimization, and formulate the problem mathematically to capture the complexity of modern network environments. Through both analytical comparisons and simulation results, we show that the Grover algorithm can offer computational advantages over classical search methods, especially in scenarios on cases when the parameter space is very large. Our results include a detailed analysis of theoretical computational complexity, an estimate of execution times, and the identification of crossover points where quantum methods outperform traditional approaches. Finally, we provide insight into the challenges and future directions of integrating quantum computing into network management frameworks, setting the stage for further progress in this area.

IEEE International Mediterranean Conference on Communications and Networking (MeditCom)Jul 7, 20251 citation