Toward Quantum-Optimized Flow Scheduling in Multi-Beam Digital Satellites

• URL: http://arxiv.org/abs/2603.00701v1
• Date: Sat, 28 Feb 2026 15:21:38 GMT
• Title: Toward Quantum-Optimized Flow Scheduling in Multi-Beam Digital Satellites
• Authors: Qiben Yan, John P. T. Stenger, Daniel Gunlycke,
• Abstract summary: We present a hybrid quantum-classical framework that improves scheduling efficiency.<n>We incorporate the throughput-maximization objective and operational constraints into a compact QUBO.<n>We evaluate solution quality, runtime, and robustness on quantum hardware.
• Score: 3.5537995993803286
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Data flow scheduling for high-throughput multibeam satellites is a challenging NP-hard combinatorial optimization problem. As the problem scales, traditional methods, such as Mixed-Integer Linear Programming and heuristic schedulers, often face a trade-off between solution quality and real-time feasibility. In this paper, we present a hybrid quantum-classical framework that improves scheduling efficiency by casting Multi-Beam Time-Frequency Slot Assignment (MB-TFSA) as a Quadratic Unconstrained Binary Optimization (QUBO) problem. We incorporate the throughput-maximization objective and operational constraints into a compact QUBO via parameter rescaling to keep the formulation tractable. To address optimization challenges in variational quantum algorithms, such as barren plateaus and rugged loss landscapes, we introduce a layer-wise training strategy that gradually increases circuit depth while iteratively refining the solution. We evaluate solution quality, runtime, and robustness on quantum hardware, and benchmark against classical and hybrid baselines using realistic, simulated satellite traffic workloads.

Related papers

• Performance enhancing of hybrid quantum-classical Benders approach for MILP optimization [0.0]
  We present a hardware-agnostic Benders' decomposition algorithm and a series of enhancements with the goal of taking the most advantage of quantum computing.<n>The proposed algorithm is benchmarked against classical approaches using a D-Wave quantum annealer for a scalable family of transmission network expansion planning problems.
  arXiv  Detail & Related papers  (2026-01-20T14:47:50Z)
• Constraint-Aware Quantum Optimization via Hamming Weight Operators [1.1463843149836523]
  Constrained optimization with strict linear constraints underpins applications in drug discovery, power grids, logistics, and finance.<n>We introduce Hamming Weight Operators, a new class of constraint-aware operators that confine quantum evolution strictly within the feasible subspace.<n>We validate our approach on benchmark tasks from both finance and high-energy physics, specifically portfolio optimization and two-jet clustering with energy balance.
  arXiv  Detail & Related papers  (2026-01-04T12:58:04Z)
• Quantum Approaches to Urban Logistics: From Core QAOA to Clustered Scalability [0.0]
  The Traveling Salesman Problem (TSP) is a fundamental challenge in optimization, widely applied in logistics and transportation.<n>Traditional algorithms often struggle to produce high-quality solutions within reasonable timeframes.<n>This study investigates the potential of the Quantum Approximate Optimization Algorithm (QAOA), a hybrid quantum-classical method.
  arXiv  Detail & Related papers  (2025-12-11T17:00:24Z)
• Quantum-Efficient Reinforcement Learning Solutions for Last-Mile On-Demand Delivery [1.8262547855491453]
  We investigate quantum computing to solve the large-scale Capacitated Pickup and Delivery Problem with Time Windows.<n>A novel problem-specific encoding quantum circuit with an entangling and variational layer is proposed.
  arXiv  Detail & Related papers  (2025-08-07T13:50:43Z)
• RhoDARTS: Differentiable Quantum Architecture Search with Density Matrix Simulations [44.13836547616739]
  Variational Quantum Algorithms (VQAs) are a promising approach to leverage Noisy Intermediate-Scale Quantum (NISQ) computers.<n> choosing optimal quantum circuits that efficiently solve a given VQA problem is a non-trivial task.<n>Quantum Architecture Search (QAS) algorithms enable automatic generation of quantum circuits tailored to the provided problem.
  arXiv  Detail & Related papers  (2025-06-04T08:30:35Z)
• Branch-and-bound digitized counterdiabatic quantum optimization [39.58317527488534]
  Branch-and-bound algorithms effectively solve convex optimization problems, relying on the relaxation the objective function to obtain tight lower bounds.<n>We propose a branch-and-bound digitized counterdiabatic quantum optimization (BB-DCQO) algorithm that addresses the relaxation difficulties.
  arXiv  Detail & Related papers  (2025-04-21T18:19:19Z)
• Bayesian Parameterized Quantum Circuit Optimization (BPQCO): A task and hardware-dependent approach [49.89480853499917]
  Variational quantum algorithms (VQA) have emerged as a promising quantum alternative for solving optimization and machine learning problems. In this paper, we experimentally demonstrate the influence of the circuit design on the performance obtained for two classification problems. We also study the degradation of the obtained circuits in the presence of noise when simulating real quantum computers.
  arXiv  Detail & Related papers  (2024-04-17T11:00:12Z)
• Quantum Optimization Methods for Satellite Mission Planning [0.3252295747842729]
  The ever-growing amount of satellites in orbit underscores the need to operate them efficiently. Current classical algorithms often fail to find the global optimum or take too long to execute. Here, we approach the problem from a quantum computing point of view, which offers a promising alternative.
  arXiv  Detail & Related papers  (2024-04-08T13:36:29Z)
• Multiobjective variational quantum optimization for constrained problems: an application to Cash Management [45.82374977939355]
  We introduce a new method for solving optimization problems with challenging constraints using variational quantum algorithms. We test our proposal on a real-world problem with great relevance in finance: the Cash Management problem. Our empirical results show a significant improvement in terms of the cost of the achieved solutions, but especially in the avoidance of local minima.
  arXiv  Detail & Related papers  (2023-02-08T17:09:20Z)
• A Hybrid Quantum-Classical Algorithm for Robust Fitting [47.42391857319388]
  We propose a hybrid quantum-classical algorithm for robust fitting. Our core contribution is a novel robust fitting formulation that solves a sequence of integer programs. We present results obtained using an actual quantum computer.
  arXiv  Detail & Related papers  (2022-01-25T05:59:24Z)
• Space-efficient binary optimization for variational computing [68.8204255655161]
  We show that it is possible to greatly reduce the number of qubits needed for the Traveling Salesman Problem. We also propose encoding schemes which smoothly interpolate between the qubit-efficient and the circuit depth-efficient models.
  arXiv  Detail & Related papers  (2020-09-15T18:17:27Z)

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.