Q-GARS: Quantum-inspired Robust Microservice Chaining Scheduling

• URL: http://arxiv.org/abs/2603.23127v1
• Date: Tue, 24 Mar 2026 12:24:51 GMT
• Title: Q-GARS: Quantum-inspired Robust Microservice Chaining Scheduling
• Abstract summary: We propose Q-GARS, a hybrid framework that integrates the QUBO model with Simulated Quantum Annealing (SQA) based search and online rescheduling mechanisms.<n> Simulation results show that Q-GARS achieves an average weighted completion time improvement of 2.1% relative to a greedy baseline of the remaining shortest processing-time.<n>In addition, Q-GARS achieves a mean node resource utilization rate of 0.817, which is 1.1 percentage points above the robust baseline.
• Score: 0.42970700836450487
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Microservice-based applications are characterized by stochastic latencies arising from long-tail execution patterns and heterogeneous resource constraints across computational nodes. To address this challenge, we first formulate the problem using Quadratic Unconstrained Binary Optimization (QUBO), which aligns the problem with emerging quantum-optimization paradigms. Building upon this, we propose Q-GARS (Quantum-Guided Adaptive Robust Scheduling), a hybrid framework that integrates the QUBO model with Simulated Quantum Annealing (SQA) based combinatorial search and online rescheduling mechanisms, enabling global microservice rank generation and real-time robust adjustment. We treat the SQA-produced rank as a soft prior, and update a closed-loop trust weight to adaptively switch and mix between this prior and a robust proportional-fairness allocator, maintaining robustness under prediction failures and runtime disturbances. Simulation results demonstrate that Q-GARS achieves an average weighted completion time improvement of 2.1\% relative to a greedy baseline of the remaining shortest processing-time (SRPT), with performance gains reaching up to 16.8\% in heavy-tailed latency. The adaptive mechanism reduces tail latency under high-variance conditions. In addition, Q-GARS achieves a mean node resource utilization rate of 0.817, which is 1.1 percentage points above the robust baseline (0.806).

Related papers

• One More Time: Revisiting Neural Quantum States from a Reinforcement Learning Perspective [2.390638133661186]
  Neural quantum states (NQS) provide a flexible and scalable framework for approximating quantum many-body wavefunctions.<n>We show that variational energy minimization can be viewed as an advantage policy-gradient problem over the Born distribution.<n>We introduce Proximal Wavefunction Optimization (PWO), a principled trust-region algorithm that clips probability-ratio changes in the amplitude channel.
  arXiv  Detail & Related papers  (2026-07-02T15:09:50Z)
• Feasibility-driven QAOA with penalty scheduling [1.4519462317941787]
  Most available quantum algorithms address constrained optimization problems by treating constraints as soft penalty terms within a QUBO formulation.<n>We introduce two extensions of standard linear-ramp QAOA tailored to problems with multiple heterogeneous constraints.<n>We show that piecewise-ramp QAOA consistently outperforms lr-QAOA and $$-lr-QAOA across circuit depths and system sizes.
  arXiv  Detail & Related papers  (2026-06-23T19:44:00Z)
• Where the Quantum Lives in D-Wave Hybrid Portfolio Optimization [0.0]
  We audit how much of D-Wave's hybrid quantum-classical portfolio-optimization service is actually quantum.<n>The constraint-native LeapHybridCQM service matches Gurobi's proven optimum on all 54 instances where Gurobi proves optimality.
  arXiv  Detail & Related papers  (2026-05-17T19:41:17Z)
• Stability and Generalization of Push-Sum Based Decentralized Optimization over Directed Graphs [55.77845440440496]
  Push-based decentralized communication enables optimization over communication networks, where information exchange may be asymmetric.<n>We develop a unified uniform-stability framework for the Gradient Push (SGP) algorithm.<n>A key technical ingredient is an imbalance-aware generalization bound through two quantities.
  arXiv  Detail & Related papers  (2026-02-24T05:32:03Z)
• Constrained Portfolio Optimization via Quantum Approximate Optimization Algorithm (QAOA) with XY-Mixers and Trotterized Initialization: A Hybrid Approach for Direct Indexing [0.0]
  This paper presents a constraint-preserving Quantum Approximate Algorithm (QAOA) formulation against Simulated Annealing (SA) and Hierarchical Risk Parity (HRP)<n>We show that our QAOA approach achieves a Sharpe Ratio of 1.81, significantly outperforming Simulated Annealing (1.31) and HRP (0.98)<n>Backtesting on a basket of 10 US equities over 2025 reveals that our QAOA approach achieves a Sharpe Ratio of 1.81, significantly outperforming Simulated Annealing (1.31) and HRP (0.98)
  arXiv  Detail & Related papers  (2026-02-16T15:19:15Z)
• HQP: Sensitivity-Aware Hybrid Quantization and Pruning for Ultra-Low-Latency Edge AI Inference [0.0]
  Hybrid Quantization and Pruning (HQP) framework designed to achieve synergistic model acceleration.<n>HQP framework achieves a peak performance gain of 3.12 times inference speedup and a 55 percent model size reduction.
  arXiv  Detail & Related papers  (2026-02-02T18:17:45Z)
• Continual Quantum Architecture Search with Tensor-Train Encoding: Theory and Applications to Signal Processing [68.35481158940401]
  CL-QAS is a continual quantum architecture search framework.<n>It mitigates challenges of costly encoding amplitude and forgetting in variational quantum circuits.<n>It achieves controllable robustness expressivity, sample-efficient generalization, and smooth convergence without barren plateaus.
  arXiv  Detail & Related papers  (2026-01-10T02:36:03Z)
• QTIS: A QAOA-Based Quantum Time Interval Scheduler [0.22940141855172033]
  The proposed method integrates an ancilla-assisted quantum circuit to dynamically detect and penalize overlapping tasks.<n>Results confirm the efficiency of QTIS in scheduling tasks with fixed temporal windows while minimizing conflicts.
  arXiv  Detail & Related papers  (2025-11-19T16:29:14Z)
• Trust Region Bayesian Optimization of Annealing Schedules on a Quantum Annealer [3.7361743420308553]
  We propose a trust region Bayesian optimization framework that tunes adiabatic quantum computation schedules.<n>We show that TuRBO consistently identifies schedules that outperform random and greedy search in terms of energy, feasible solution probability, and chain break fraction.
  arXiv  Detail & Related papers  (2025-10-17T02:19:21Z)
• End-to-End On-Device Quantization-Aware Training for LLMs at Inference Cost [53.25965863436039]
  Quantization-aware training (QAT) provides a more principled solution, but its reliance on backpropagation incurs prohibitive memory costs.<n>We propose ZeroQAT, a zeroth-order optimization-based QAT framework that supports both weight and activation quantization.<n>Experiments show that ZeroQAT consistently outperforms representative PTQ and QAT baselines while requiring significantly less memory.
  arXiv  Detail & Related papers  (2025-08-21T01:18:27Z)
• MPQ-DMv2: Flexible Residual Mixed Precision Quantization for Low-Bit Diffusion Models with Temporal Distillation [74.34220141721231]
  We present MPQ-DMv2, an improved textbfMixed textbfPrecision textbfQuantization framework for extremely low-bit textbfDiffusion textbfModels.
  arXiv  Detail & Related papers  (2025-07-06T08:16:50Z)
• Hybrid Quantum Neural Networks with Amplitude Encoding: Advancing Recovery Rate Predictions [6.699192644249841]
  Recovery rate prediction plays a pivotal role in bond investment strategies by enhancing risk assessment, optimizing portfolio allocation, and improving pricing accuracy.<n>We propose a hybrid Quantum Machine Learning (QML) model with Amplitude.<n>We evaluate the model on a global recovery rate dataset comprising 1,725 observations from 1996 to 2023.
  arXiv  Detail & Related papers  (2025-01-27T07:27:23Z)
• Entanglement Distribution Delay Optimization in Quantum Networks with Distillation [51.53291671169632]
  Quantum networks (QNs) distribute entangled states to enable distributed quantum computing and sensing applications. QS resource allocation framework is proposed to enhance the end-to-end (e2e) fidelity and satisfy minimum rate and fidelity requirements.
  arXiv  Detail & Related papers  (2024-05-15T02:04:22Z)
• Reconfigurable Intelligent Surface (RIS)-Assisted Entanglement Distribution in FSO Quantum Networks [62.87033427172205]
  Quantum networks (QNs) relying on free-space optical (FSO) quantum channels can support quantum applications in environments where establishing an optical fiber infrastructure is challenging and costly. A reconfigurable intelligent surface (RIS)-assisted FSO-based QN is proposed as a cost-efficient framework providing a virtual line-of-sight between users for entanglement distribution.
  arXiv  Detail & Related papers  (2024-01-19T17:16:40Z)
• Collaborative Intelligent Reflecting Surface Networks with Multi-Agent Reinforcement Learning [63.83425382922157]
  Intelligent reflecting surface (IRS) is envisioned to be widely applied in future wireless networks. In this paper, we investigate a multi-user communication system assisted by cooperative IRS devices with the capability of energy harvesting.
  arXiv  Detail & Related papers  (2022-03-26T20:37:14Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.