IEEE International Conference on Cyber Security and Resilience (CSR)

Optimizing Network Services with Quantum Dynamic Programming and Grover’s Search

Engin Zeydan, Josep Mangues‐Bafalluy, Yekta Türk, Abdullah Aydeger, Madhusanka Liyanage

Published Aug 4, 2025• 0 citations

Abstract

As network service requirements and computational complexity continue to increase, efficient resource management and optimization techniques are essential to ensure performance and scalability. In the context of edge cloud networks, there are computational challenges associated with optimal path selection and resource allocation. This paper explores the integration of quantum computing with dynamic programming (DP) to solve path optimization problems in network service orchestration. More specifically, we investigate two approaches to DP: the classical DP method, which provides exact solutions by systematically evaluating all possible states, and a quantum-enhanced version, which uses the Grover search algorithm to accelerate for performance comparisons in terms of accuracy and execution times. Simulation results provide insights into the comparative performance of classical and quantum DP approaches, with an emphasis on search time improvements. Beyond computational performance, we discuss practical considerations including the constraints of current quantum hardware, algorithmic efficiency improvements, scalability challenges, and integration with classical systems. Additionally, we evaluate energy efficiency, costbenefit trade-offs, resilience, and regulatory concerns associated with quantum-enabled service orchestration.

DOI: 10.1109/csr64739.2025.11130166

Related papers

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

Next-Generation Orchestration: Quantum Computing for Network Services

Engin Zeydan, Luis Blanco, Josep Mangues‐Bafalluy +2 more

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

Application of Grover’s Algorithm in Route Optimization

Vladimir Anatolievich Bogatyrev, V. S. Moskvin

Route determination and optimization is a persistent challenge in transportation networks due to combinatorial explosion of options, dynamically changing conditions, competing optimization criteria, and complexity of real-world systems. Classical algorithms struggle to efficiently solve route optimization at scale due to exponential growth of possibilities, NP-hardness, limitations of dynamic programming approaches, and inability to leverage quantum parallelism. This paper explores the potential application of Grover’s algorithm in optimizing road transportation. Grover’s quantum algorithm offers a potential solution by using an oracle function to recognize optimal routes based on constraints and objectives encoded in a quantum state representing all possible paths. Constructive interference and amplitude amplification drive the system toward optimal solutions. By utilizing Grover’s algorithm, road transportation networks can benefit from improved route planning, traffic management, and resource allocation, ultimately enhancing efficiency and reducing congestion. The transportation network must be efficiently encoded into a quantum representation. An optimization oracle tailored to routing objectives then recognizes optimal solutions, which are amplified via a diffusion operator utilizing interference. Repeated application concentrates amplitude in optimal routes, which can be measured. Key challenges include encoding the network effectively within qubit resource constraints, designing an oracle to evaluate routes based on real-world conditions and optimization criteria, and translating the optimized quantum state into actionable routing guidance. If these challenges can be met, Grover’s algorithm may enable route optimization at a scale intractable for classical techniques.

Intelligent Technologies and Electronic Devices in Vehicle and Road Transport Complex (TIRVED)Nov 15, 20237 citations

Hybrid Quantum–Classical Optimization for Cloud Resource Allocation: A Scalable Framework for Energy–Efficient Computing

K. Kalpana, S. Kavitha, S. Chinnapparaj +3 more

Cloud computing has transformed modern digital infrastructure by enabling on-demand access to scalable computational resources. However, the increasing complexity of dynamic workloads and the need for efficient resource allocation present persistent challenges in maintaining performance, cost efficiency, and energy sustainability. This paper introduces a Quantum-Driven Optimization (QDO) framework, a hybrid quantum-classical approach designed to enhance cloud resource allocation by integrating quantum computing techniques with classical optimization methods. The proposed framework leverages Quantum Annealing (QA) and the Variational Quantum Eigensolver (VQE) to optimize resource distribution, minimizing energy consumption and operational costs while maximizing throughput and utilization efficiency. Experimental evaluations demonstrate that the QDO framework achieves a 27% improvement in resource utilization, a 34% reduction in operational costs, and a 21% enhancement in task completion time compared to traditional heuristic-based approaches. Additionally, the hybrid model reduces Service Level Agreement (SLA) violations by 18%, ensuring robust Quality of Service (QoS) for cloud users. The framework employs classical algorithms for preprocessing and decision-making while delegating complex optimization tasks to quantum solvers, ensuring scalability across diverse cloud environments. This study highlights the transformative potential of hybrid quantum-classical computing in addressing cloud resource allocation challenges. The results indicate significant improvements in energy efficiency, cost-effectiveness, and system responsiveness, making the QDO framework a viable solution for next-generation cloud infrastructures. Future research directions include extending the framework to multi-cloud architectures and investigating advanced quantum algorithms for further optimization gains.

CompSci & AI AdvancesMar 1, 20253 citations

Dynamic Programming with Quantum-Inspired Search Algorithms

Jincheng Zhang

This paper investigates the potential of accelerating dynamic programming (DP) algorithms by incorporating search strategies derived from quantum mechanics, specifically quantum tunneling and superposition. The core premise is that the inherent exploration capabilities of quantum phenomena can be simulated through quantum-inspired search algorithms, such as quantum annealing or evolutionary algorithms mimicking tunneling behavior, to efficiently navigate the solution space of DP problems. We propose a framework where a classical DP algorithm is augmented with a quantum-inspired search component. The aim is to leverage the strengths of both approaches – the precision and systematic nature of DP combined with the potentially faster exploration offered by quantum-inspired techniques. The effectiveness of this approach is evaluated through theoretical analysis and conceptual design, focusing on scenarios where traditional DP methods struggle with large state spaces or complex decision boundaries. This research contributes to a new paradigm in algorithm design, bridging the gap between classical and quantum computing by utilizing quantum-inspired methods to optimize classical algorithms. The core idea is to treat the DP problem as a tunneling event within a high-dimensional space, significantly reducing the time required to find optimal solutions.

Sep 1, 20260 citations

Quantum Algorithmic Frameworks for Graph-Based Optimization and Network Analysis in Large-Scale Computational Systems

Beyza Altan

The increasing scale and interconnectedness of modern computational systems have intensified the demand for efficient algorithms capable of analyzing complex networks and solving graph-based optimization problems. Classical optimization techniques, while effective for moderate-sized datasets, often encounter exponential computational growth when applied to large-scale graph structures characterized by high dimensionality and dynamic topology. This paper explores quantum algorithmic frameworks for graph-based optimization and network analysis in large-scale computational systems, emphasizing the potential of quantum computing paradigms to address combinatorial complexity and enhance computational scalability. By synthesizing developments in quantum search algorithms, variational quantum circuits, and hybrid quantum–classical optimization methods, the study evaluates their applicability to tasks such as shortest-path discovery, clustering, community detection, and network resilience assessment. The findings suggest that quantum-enabled frameworks may provide complementary advantages in exploring vast solution spaces and improving optimization efficiency, particularly when integrated with classical preprocessing and orchestration strategies.

Next generation.Feb 20, 20260 citations