Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

IEEE Network

Adaptive Quantum Search for Service Path Optimization in Edge-Cloud and 6G Networks

Engin Zeydan, Madhusanka Liyanage

Published Jan 1, 2026• 0 citations
Publisher

Abstract

Service path optimization in large-scale edge–cloud 6G networks is computationally intensive due to multiple constraints, including latency, bandwidth, and energy. This article presentsGrover Adaptive Search (GAS)-enhanced Dijkstra, a hybrid classical-quantum approach that embeds an adaptive Grover schedule in a Dijkstra-based service path computation. By progressively narrowing the candidate set at each search step, GAS-enhanced Dijkstra reduces the oracle query count beyond what fixed-iteration quantum search achieves, while preserving path optimality. We evaluate it against seven classical routing algorithms and a fixed-iteration Grover baseline over six topology families. Under an idealized marked-item sampling model of the Grover subroutine, on 50-node graphs at edge density 0.7, GAS-enhanced Dijkstra needs 55% fewer oracle queries than a fixed-iteration Grover baseline running the identical threshold-descent loop, and a 4.8-fold lower quantum oracle-query count than the number of edge relaxations performed by classical Dijkstra, while retaining those classical relaxations itself. Benefits are limited in small or sparse networks.

DOI
10.1109/mnet.2026.3740776

Related papers

Grover Adaptive Search With Fewer Queries

Hiroaki Ominato, Takahiro Ohyama, Koichiro Yamaguchi

In binary optimization problems, where the goal is to find the input$\boldsymbol {x}$that minimizes a given objective function, Grover adaptive search (GAS) is a well-known quantum algorithm that provides quadratic speedup when compared with the brute-force approaches of classical computers. GAS calls a renowned quantum search algorithm, Grover search (GS), as a subroutine to search for inputs with function values less than the threshold value. If such an input is found, the threshold value is updated with the function value and the search targets are narrowed. To search efficiently for a solution, an appropriate number of queries must be selected to amplify the desired state of the GS in each step. This paper discusses this issue and proposes a new method for selecting the number of queries and provides proof that our method achieves quadratic speedup as well as the original GAS. Furthermore, the simulation results for 40-bit problems confirm that our method allows an optimal solution with 22% fewer queries than the standard method, thus offering the possibility of significantly reduced computation times for combinatorial optimization problems.

IEEE Access•Jan 1, 2024•7 citations

HYBRID QUANTUM ALGORITHMS FOR AUTONOMOUS VEHICLE NAVIGATION: DIRECTED PATH PLANNING WITH GROVER-QAOA

IDRIS KAGAN DEMIR, Seda Nur Gungor, Mehmet Karaköse

Path planning in complex and obstacle-constrained environments remains a challenging combinatorial optimization problem due to the exponential growth of the solution space and the limitations of classical algorithms in dynamic decision-making scenarios. Traditional approaches such as Dijkstra or A* may experience high computational costs and susceptibility to local optima when dealing with large-scale directed graphs containing obstacles. This study proposes a hybrid quantum computing approach that integrates the Grover Search Algorithm and the Quantum Approximate Optimization Algorithm (QAOA) to address optimal path planning on obstacle-oriented directed graphs. The Grover algorithm is first employed as an oracle-based filtering mechanism to detect and eliminate obstacle-containing edges, thereby generating a valid subgraph of feasible paths. Following this preprocessing step, QAOA is applied to the filtered graph within a nonlinear optimization framework to determine the minimum-cost path between source and destination nodes. The optimization model represents the graph as G=(V,E), where binary decision variables indicate whether an edge is included in the selected route while satisfying flow conservation constraints. By narrowing the solution space through Grover-based obstacle detection and performing optimization only on valid edges, the proposed method significantly reduces computational complexity compared to conventional approaches. Experimental analysis demonstrates that the hybrid quantum model effectively identifies optimal routes and adapts to different obstacle configurations while maintaining efficient convergence behavior. The results highlight the potential of integrating quantum search and quantum optimization techniques for solving combinatorial graph problems. This work contributes to the growing body of research on quantum-assisted optimization and demonstrates the feasibility of applying hybrid quantum algorithms to directed path planning problems relevant to autonomous navigation systems.

Quantum Journal of Engineering Science and Technology•Mar 31, 2026•1 citation

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

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

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.

IEEE International Conference on Cyber Security and Resilience (CSR)•Aug 4, 2025•0 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, 2025•1 citation

Grover Adaptive Search-Based Hybrid Benders Decomposition for Mixed-Integer Linear Programs

Xiaodong Zheng, Lin Ding, Hao Chen

Mixed-integer linear programs are widely used to model optimization problems involving both discrete and continuous variables, but remain computationally challenging due to the combinatorial complexity. To exploit the potential advantages of quantum computing in tackling the combinatorial optimization part, recent efforts have explored hybrid quantum-classical Benders decomposition frameworks, which delegate the discrete master problem to quantum solvers like annealers while solving the continuous subproblem classically. However, these approaches typically rely on penalty-based formulations that are heuristic in nature, offer no guarantee of recovering the exact master optimum, require delicate penalty tuning, and introduce slack-register overhead that inflates circuit size and distorts the problem's native structure. In this work, we propose a Grover Adaptive Search based Benders Decomposition (GAS-BD) algorithm that circumvents penalty terms by directly encoding Benders cuts into a novel quantum oracle. The designed oracle-based quantum solver searches for constraint-satisfying master solutions by leveraging Grover's potential quadratic speedup, while the subproblem loop is handled by a classical solver. Simulation results shows that GAS-BD matches the convergence of classical Benders and exhibits greater stability than penalty-based hybrid baselines, while remaining executable on current NISQ hardware. These results demonstrate a practical and penalty-free path for embedding exact Benders logic into Grover-style quantum search.

IEEE Transactions on Quantum Engineering•Jan 1, 2026•2 citations

An Adaptive Quantum Search Framework under Unknown Solution-density: Minimizing Expected Queries to the First Solution

Wiwat Asawalertsak, Rajchawit Sarochawikasit

Grover's algorithm provides a mathematically optimal quadratic speedup for unstructured search, yet its standard formulation relies on a critical prerequisite: prior knowledge of the target solution count to determine the number of algorithm iterations. Although numerous strategies have been developed to identify or bypass this parameter, comparing them directly is nontrivial. This study investigates and computationally optimizes 3 prominent frameworks: Boyer-Brassard-Hoyer-Tapp, Fixed-Point search, and Density Estimation Methods. Density-specific benchmarks select the best tested method and configuration to minimize expected first-solution queries under 2 initialization-cost conventions. To translate these theoretical benchmarks into practical utility, a hybrid quantum-classical adaptive framework integrating Hill-climbing-assisted Grover Adaptive Search with state-space density estimation modeled via the Wang-Landau algorithm is proposed as a potential use-case. This implementation operates directly on the optimized query methods established earlier. Analytical models support the approach; ideal simulations show 18.8%-63.4% lower mean accumulated query costs than the tested randomized and fixed-point baselines.

arXiv:2611.09688•Nov 6, 2026•0 citations
Service path optimization in large-scale edge–cloud 6G networks is computationally intensive due to multiple constraints, including latency, bandwidth, and energy. This article presentsGrover Adaptive Search (GAS)-enhanced Dijkstra, a hybrid classical-quantum approach that embeds an adaptive Grover schedule in a Dijkstra-based service path computation. By progressively narrowing the candidate set at each search step, GAS-enhanced Dijkstra reduces the oracle query count beyond what fixed-iteration quantum search achieves, while preserving path optimality. We evaluate it against seven classical routing algorithms and a fixed-iteration Grover baseline over six topology families. Under an idealized marked-item sampling model of the Grover subroutine, on 50-node graphs at edge density 0.7, GAS-enhanced Dijkstra needs 55% fewer oracle queries than a fixed-iteration Grover baseline running the identical threshold-descent loop, and a 4.8-fold lower quantum oracle-query count than the number of edge relaxations performed by classical Dijkstra, while retaining those classical relaxations itself. Benefits are limited in small or sparse networks.
In binary optimization problems, where the goal is to find the inputx\boldsymbol {x}xthat minimizes a given objective function, Grover adaptive search (GAS) is a well-known quantum algorithm that provides quadratic speedup when compared with the brute-force approaches of classical computers. GAS calls a renowned quantum search algorithm, Grover search (GS), as a subroutine to search for inputs with function values less than the threshold value. If such an input is found, the threshold value is updated with the function value and the search targets are narrowed. To search efficiently for a solution, an appropriate number of queries must be selected to amplify the desired state of the GS in each step. This paper discusses this issue and proposes a new method for selecting the number of queries and provides proof that our method achieves quadratic speedup as well as the original GAS. Furthermore, the simulation results for 40-bit problems confirm that our method allows an optimal solution with 22% fewer queries than the standard method, thus offering the possibility of significantly reduced computation times for combinatorial optimization problems.
Path planning in complex and obstacle-constrained environments remains a challenging combinatorial optimization problem due to the exponential growth of the solution space and the limitations of classical algorithms in dynamic decision-making scenarios. Traditional approaches such as Dijkstra or A* may experience high computational costs and susceptibility to local optima when dealing with large-scale directed graphs containing obstacles. This study proposes a hybrid quantum computing approach that integrates the Grover Search Algorithm and the Quantum Approximate Optimization Algorithm (QAOA) to address optimal path planning on obstacle-oriented directed graphs. The Grover algorithm is first employed as an oracle-based filtering mechanism to detect and eliminate obstacle-containing edges, thereby generating a valid subgraph of feasible paths. Following this preprocessing step, QAOA is applied to the filtered graph within a nonlinear optimization framework to determine the minimum-cost path between source and destination nodes. The optimization model represents the graph as G=(V,E), where binary decision variables indicate whether an edge is included in the selected route while satisfying flow conservation constraints. By narrowing the solution space through Grover-based obstacle detection and performing optimization only on valid edges, the proposed method significantly reduces computational complexity compared to conventional approaches. Experimental analysis demonstrates that the hybrid quantum model effectively identifies optimal routes and adapts to different obstacle configurations while maintaining efficient convergence behavior. The results highlight the potential of integrating quantum search and quantum optimization techniques for solving combinatorial graph problems. This work contributes to the growing body of research on quantum-assisted optimization and demonstrates the feasibility of applying hybrid quantum algorithms to directed path planning problems relevant to autonomous navigation systems.
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.
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.
Mixed-integer linear programs are widely used to model optimization problems involving both discrete and continuous variables, but remain computationally challenging due to the combinatorial complexity. To exploit the potential advantages of quantum computing in tackling the combinatorial optimization part, recent efforts have explored hybrid quantum-classical Benders decomposition frameworks, which delegate the discrete master problem to quantum solvers like annealers while solving the continuous subproblem classically. However, these approaches typically rely on penalty-based formulations that are heuristic in nature, offer no guarantee of recovering the exact master optimum, require delicate penalty tuning, and introduce slack-register overhead that inflates circuit size and distorts the problem's native structure. In this work, we propose a Grover Adaptive Search based Benders Decomposition (GAS-BD) algorithm that circumvents penalty terms by directly encoding Benders cuts into a novel quantum oracle. The designed oracle-based quantum solver searches for constraint-satisfying master solutions by leveraging Grover's potential quadratic speedup, while the subproblem loop is handled by a classical solver. Simulation results shows that GAS-BD matches the convergence of classical Benders and exhibits greater stability than penalty-based hybrid baselines, while remaining executable on current NISQ hardware. These results demonstrate a practical and penalty-free path for embedding exact Benders logic into Grover-style quantum search.
Grover's algorithm provides a mathematically optimal quadratic speedup for unstructured search, yet its standard formulation relies on a critical prerequisite: prior knowledge of the target solution count to determine the number of algorithm iterations. Although numerous strategies have been developed to identify or bypass this parameter, comparing them directly is nontrivial. This study investigates and computationally optimizes 3 prominent frameworks: Boyer-Brassard-Hoyer-Tapp, Fixed-Point search, and Density Estimation Methods. Density-specific benchmarks select the best tested method and configuration to minimize expected first-solution queries under 2 initialization-cost conventions. To translate these theoretical benchmarks into practical utility, a hybrid quantum-classical adaptive framework integrating Hill-climbing-assisted Grover Adaptive Search with state-space density estimation modeled via the Wang-Landau algorithm is proposed as a potential use-case. This implementation operates directly on the optimized query methods established earlier. Analytical models support the approach; ideal simulations show 18.8%-63.4% lower mean accumulated query costs than the tested randomized and fixed-point baselines.