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

Quantum-Classical Hybrid Cloud Workflows for Combinatorial Supply-Chain and Fleet Optimization

Sonu Kumar Singh

Published Oct 20, 2026• 0 citations
Publisher

Abstract

Abstract: Global logistics networks, intercontinental air-freight consolidators, and maritime energy fleets continuously solve large-scale Mixed-Integer Linear Programs (MILPs) such as the Capacitated Vehicle Routing Problem with Time Windows (CVRPTW) and multi-vessel Maritime Inventory Routing Problems (MIRP). When weather disruptions, port congestion, or geopolitical airspace closures invalidate baseline schedules, classical branch-and-cut solvers (Gurobi, CPLEX) experience exponential worst-case tree growth on subproblems exceeding 2,000 binary decision variables, often failing to converge within strict 5-to-15-minute operational re-dispatch windows. Conversely, current Noisy Intermediate-Scale Quantum (NISQ) processors remain limited to 100-to-1,000 physical qubits with finite two-qubit gate fidelity ($99.2\%-99.8\%$), preventing direct encoding of full enterprise logistics instances. This paper presents a production-grade Quantum-Classical Hybrid Cloud Architecture that bridges enterprise Kubernetes clusters with co-located quantum processing units (QPUs) via AWS Braket Hybrid Jobs and IBM Quantum Qiskit Runtime primitives. Our framework applies Benders and Dantzig-Wolfe column generation on classical cloud HPC nodes to decompose a 25,000-variable global fleet MILP into a continuous master problem and hard combinatorial pricing/routing subproblems of 60 to 140 binary variables. These subproblems are transformed into Quadratic Unconstrained Binary Optimization (QUBO) and Ising Hamiltonians, warm-started from classical linear programming (LP) relaxations (WS-QAOA), compiled with dynamical decoupling and Zero-Noise Extrapolation (ZNE), and executed inside co-located QPU-CPU sessions while a GPU-accelerated Simulated Bifurcation (SB) digital annealer runs in parallel as a deterministic SLA fallback. Evaluated on disruption recovery workloads modeled on ExxonMobil maritime LNG routing and DHL Global Forwarding air-cargo container loading, our hybrid WS-QAOA + Column Generation workflow improves optimality gap closure at a 10-minute SLA cutoff from 6.84% (classical branch-and-bound alone) to 1.42%, reduces emergency re-routing compute wall-clock time by 61.5%, and cuts fleet fuel and charter penalty costs by 4.7%. Research Domain & Specialization Track Master of Science in Information Technology (MSIT) — Quantum Cloud Computing, Hybrid Orchestration, and Operations Research. Core Technical Highlights Empirical Production Case Studies: Rigorous architectural blueprints and telemetry evaluation across enterprise cloud deployments. Four-Tier Reference Architecture: Formal specification from edge ingress to distributed hardware execution pools. Mathematical Formulation: Formally derived algorithmic and optimization models with closed-loop verification. Multi-Modal Benchmarking: Comparative empirical baselines under fault-injection and synthetic workload scaling. Author Information Author: Sonu Kumar SinghRole: Senior Consultant Affiliation: Independent Researcher Publication Status: Preprint / Working Paper (MSIT AI & Cloud Systems Research Series) Reproducibility & Open Science All included architecture diagrams, telemetry schemas, and benchmark curves are open-access under the Creative Commons Attribution 4.0 International (CC BY 4.0) license.

DOI
10.5281/zenodo.23513316

Related papers

Hybrid Classical-Quantum Optimization for CVRPTW: A Systems Framework with Provable Feasibility and Empirical Hardware Limits

Syamasundar Gopasana, Swatantra Singh, Rohan Joydhar +1 more

Solving large-scale Capacitated Vehicle Routing Problems with Time Windows (CVRPTW) remains challenging because strict operational constraints and scale limit both exact and heuristic methods. We present a hybrid classical-quantum architecture combining Mixed Integer Linear Programming (MILP) with vehicle-level Quadratic Unconstrained Binary Optimization (QUBO), solved using Toshiba SQBM+ and QAOA on Rigetti Ankaa-3 and IQM Emerald quantum processors. The decomposition avoids the variable growth and constraint-enforcement difficulties of monolithic CVRPTW QUBO formulations. We evaluate the framework on five realistic benchmarks derived from London traffic and location data, spanning 10--70 customers, using a validation pipeline enforcing feasibility and monotone improvement over classical baselines. SQBM+ achieves verified fleet-distance reductions of 2.80% (7,927 m) for the 25-customer instance and 0.22% (1,186 m) for the 55-customer instance. QAOA experiments establish a current hardware boundary for reliable constraint satisfaction at subproblems of up to 4 customers (16 qubits). Diagnostic results identify assignment-level time-window tightness, rather than local route optimization, as the dominant scalability bottleneck. The results demonstrate a practical near-term role for hybrid classical-quantum optimization while establishing empirical limits for current quantum hardware.

arXiv:2611.15343•Nov 11, 2026•0 citations

Solve Crude Oil Scheduling Problems by Using Quantum-Classical Hybrid Algorithms

Jian Yang, Bohang Wang, Lina Wang +5 more

The optimization of front-end crude oil scheduling is a critical determinant of refinery profitability and operational stability. However, the coupling of discrete logistics events (e.g., vessel berthing) with continuous material flows (e.g., pipeline transfers) renders this problem an NP-hard Mixed-Integer Linear Programming (MILP) challenge, often intractable for classical solvers at industrial scales. This study proposes a novel hybrid quantum-classical framework to address these computational bottlenecks. We employ Benders Decomposition to decouple the monolithic model into a discrete Master Problem (MP) and a continuous Subproblem (SP). To exploit the search capabilities of quantum computing, the MP is reformulated as a Quadratic Unconstrained Binary Optimization (QUBO) model and solved via a hybrid quantum solver, while the SP enforces mass balance and quality constraints through iterative optimality and feasibility cuts. Extensive experiments on 15 multi-scale instances demonstrate that the proposed framework significantly outperforms traditional metaheuristics (e.g., Genetic Algorithms, Tabu Search), reducing total operating costs by approximately 73--80% and achieving computational speeds comparable to state-of-the-art commercial solvers (Gurobi). By effectively leveraging global optimality cuts, the method overcomes the tendency of heuristic approaches to trap in local optima, providing a robust and scalable solution for complex refinery logistics.

quant-pharXiv:2604.26459•Apr 30, 2026•0 citations

Quantum Computing for Logistics Optimization: Annealing in ULD Configuration and Disruption

Dr. V. A. Sharma

Quantum computing offers transformative potential for addressing complex combinatorial optimization challenges in logistics and supply chain management. This paper presents a comprehensive investigation of quantum annealing and hybrid quantum-classical algorithms applied to unit load device (ULD) configuration and disruption management in air cargo and multimodal logistics networks. We formulate the ULD loading and placement problem as a Quadratic Unconstrained Binary Optimization (QUBO) model that incorporates weight, volume, center-of-gravity, structural stress, and compatibility constraints. A stratified hybrid architecture spanning physical quantum hardware, algorithmic middleware, and decision-support layers is proposed. Through extensive numerical experiments and comparison with classical solvers, we demonstrate superior payload utilization (up to 96.5%), favorable computational scaling, and rapid disruption recovery. Real-world industry pilots, including quantum-assisted route optimization achieving substantial carbon emission reductions and hybrid solutions at major ports, are analyzed. Results indicate that while noisy intermediate-scale quantum (NISQ) hardware limitations persist, hybrid approaches already deliver measurable gains in operational efficiency, cost reduction, and supply-chain resilience. The work provides a practical roadmap for near-term adoption of quantum technologies in high-stakes logistics environments. Keywords— Quantum annealing, Unit load device (ULD), QUBO, Logistics optimization, Disruption management, Hybrid quantum-classical algorithms, Air cargo, Supply chain resilience

International Journal of Creative and Open Research in Engineering and Management•Aug 24, 2026•0 citations

Exploring Quantum-Enhanced AI Models in Distributed Cloud Systems

Madina Toigonbaeva, Farida Begimbai kyzy, Dinara Kubanychbek kyzy +1 more

This research presents a comprehensive hybrid quantum-classical framework integrating Variational Quantum Circuits (VQCs), Quantum Approximate Optimization Algorithm (QAOA), and quantum kernel methods into production-grade distributed cloud infrastructures. Systematic evaluation across computer vision (MNIST: 42.1% training speedup), genomic analysis (28.4% accuracy improvement), financial portfolio optimization (35.7% risk-adjusted returns), and logistics routing (29.3% latency reduction) demonstrates consistent quantum advantages within current NISQ hardware constraints. Key innovations include dynamic multi-cloud quantum orchestration across Amazon Braket, IBM Quantum, and Azure Quantum platforms, zero-noise extrapolation reducing gate errors from 3.2% to 1.1%, and classical-quantum communication latency optimization achieving 67% reduction. The framework delivers production-ready reliability with 7.2% accuracy gains at 2.3× classical inference cost, yielding clear enterprise ROI for mission-critical applications. Implemented with Qiskit 1.2 and PennyLane 0.38 APIs, the study provides the definitive blueprint for quantum-enhanced AI deployment, bridging NISQ hardware realities with enterprise-scale requirements across healthcare, finance, logistics, and autonomous systems domains.

•Apr 20, 2026•0 citations

A Hybrid Quantum-Classical Approach for Dynamic Fleet Logistics of Urban Hydrogen Buses

Marcelo Aguayo, Ismael Soto, Sebastián Seguel +1 more

The logistical management of urban hydrogen fuel cell electric bus (FCEB) fleets presents a computationally complex scheduling problem, especially under dynamic conditions. This paper compares a classical global Mixed-Integer Linear Programming (MILP) baseline with a sequential hybrid quantum–classical model for real-time decision-making (and includes a monolithic quantum comparator for completeness). The hybrid approach employs a classical director to maintain fleet state and, hour by hour, formulates a Quadratic Unconstrained Binary Optimization (QUBO) over candidate actions that is mapped to Ising and solved via the Quantum Approximate Optimization Algorithm (QAOA); the MILP decision is replaced only if the QAOA proposal is feasible and value-improving. Simulation results on a 24-hour, 5-vehicle scenario show that while MILP finds a globally consistent plan, the hybrid method captures short-term opportunities through windowed variational refinement, yielding higher total value; the monolithic quantum solution remains competitive but does not surpass the classical baseline at this scale. The advantage of the hybrid model thus arises from locality and adaptive refinement rather than a Grover-type $\sqrt{N}$ bound, offering a pragmatic path to dynamic fleet management under realistic SOC and capacity constraints.

South American Colloquium on Visible Light Communications (SACVLC)•Oct 22, 2025•0 citations

A Quantum-Classical Benders Decomposition for Cargo Routing with Time Windows

Oliver Szal, Joshua Dibbern, Henri Hiep +2 more

Quantum Annealing (QA) presents a promising approach for large-scale combinatorial optimization, though its adoption in the shipping industry remains limited. This study considers a Traveling Salesperson Problem with Time Windows and Earliness Penalties (TSPTW-EP) motivated by a break-bulk cargo-routing use case. A vessel must determine a port-visitation sequence while minimizing sailing and early-delivery storage costs and satisfying arrival-time windows. Direct Quadratic Unconstrained Binary Optimization (QUBO) formulations are limited in size by the hardware constraints of existing annealers and may suffer from rugged energy landscapes arising when encoding the continuous time variables in binary variables. Therefore, a hybrid Benders decomposition approach is proposed. The master problem, selecting port visitation sequences, is formulated as a QUBO and explored on a quantum annealer, while the classical subproblem determines arrival times and produces Benders cuts. Benchmark experiments compare different quantum and classical master solvers within the hybrid scheme on realistic maritime instances, assessing solution quality, runtime, and scalability. Results show that on the considered model, the hybrid pipeline struggles with the feasibility of QUBO solutions, especially due to the need for embeddings onto the QPU hardware. However, they also suggest that hybrid Benders terminates in fewer iterations than the classical Benders decomposition, at the cost of an uncertified stopping criterion and lower solution quality. The study aims to quantify the practical benefits and limits of QA-enabled logistics optimization.

Mathematics•Nov 4, 2026•0 citations
Abstract: Global logistics networks, intercontinental air-freight consolidators, and maritime energy fleets continuously solve large-scale Mixed-Integer Linear Programs (MILPs) such as the Capacitated Vehicle Routing Problem with Time Windows (CVRPTW) and multi-vessel Maritime Inventory Routing Problems (MIRP). When weather disruptions, port congestion, or geopolitical airspace closures invalidate baseline schedules, classical branch-and-cut solvers (Gurobi, CPLEX) experience exponential worst-case tree growth on subproblems exceeding 2,000 binary decision variables, often failing to converge within strict 5-to-15-minute operational re-dispatch windows. Conversely, current Noisy Intermediate-Scale Quantum (NISQ) processors remain limited to 100-to-1,000 physical qubits with finite two-qubit gate fidelity (99.2%−99.8%99.2\%-99.8\%99.2%−99.8%), preventing direct encoding of full enterprise logistics instances. This paper presents a production-grade Quantum-Classical Hybrid Cloud Architecture that bridges enterprise Kubernetes clusters with co-located quantum processing units (QPUs) via AWS Braket Hybrid Jobs and IBM Quantum Qiskit Runtime primitives. Our framework applies Benders and Dantzig-Wolfe column generation on classical cloud HPC nodes to decompose a 25,000-variable global fleet MILP into a continuous master problem and hard combinatorial pricing/routing subproblems of 60 to 140 binary variables. These subproblems are transformed into Quadratic Unconstrained Binary Optimization (QUBO) and Ising Hamiltonians, warm-started from classical linear programming (LP) relaxations (WS-QAOA), compiled with dynamical decoupling and Zero-Noise Extrapolation (ZNE), and executed inside co-located QPU-CPU sessions while a GPU-accelerated Simulated Bifurcation (SB) digital annealer runs in parallel as a deterministic SLA fallback. Evaluated on disruption recovery workloads modeled on ExxonMobil maritime LNG routing and DHL Global Forwarding air-cargo container loading, our hybrid WS-QAOA + Column Generation workflow improves optimality gap closure at a 10-minute SLA cutoff from 6.84% (classical branch-and-bound alone) to 1.42%, reduces emergency re-routing compute wall-clock time by 61.5%, and cuts fleet fuel and charter penalty costs by 4.7%. Research Domain & Specialization Track Master of Science in Information Technology (MSIT) — Quantum Cloud Computing, Hybrid Orchestration, and Operations Research. Core Technical Highlights Empirical Production Case Studies: Rigorous architectural blueprints and telemetry evaluation across enterprise cloud deployments. Four-Tier Reference Architecture: Formal specification from edge ingress to distributed hardware execution pools. Mathematical Formulation: Formally derived algorithmic and optimization models with closed-loop verification. Multi-Modal Benchmarking: Comparative empirical baselines under fault-injection and synthetic workload scaling. Author Information Author: Sonu Kumar SinghRole: Senior Consultant Affiliation: Independent Researcher Publication Status: Preprint / Working Paper (MSIT AI & Cloud Systems Research Series) Reproducibility & Open Science All included architecture diagrams, telemetry schemas, and benchmark curves are open-access under the Creative Commons Attribution 4.0 International (CC BY 4.0) license.
Solving large-scale Capacitated Vehicle Routing Problems with Time Windows (CVRPTW) remains challenging because strict operational constraints and scale limit both exact and heuristic methods. We present a hybrid classical-quantum architecture combining Mixed Integer Linear Programming (MILP) with vehicle-level Quadratic Unconstrained Binary Optimization (QUBO), solved using Toshiba SQBM+ and QAOA on Rigetti Ankaa-3 and IQM Emerald quantum processors. The decomposition avoids the variable growth and constraint-enforcement difficulties of monolithic CVRPTW QUBO formulations. We evaluate the framework on five realistic benchmarks derived from London traffic and location data, spanning 10--70 customers, using a validation pipeline enforcing feasibility and monotone improvement over classical baselines. SQBM+ achieves verified fleet-distance reductions of 2.80% (7,927 m) for the 25-customer instance and 0.22% (1,186 m) for the 55-customer instance. QAOA experiments establish a current hardware boundary for reliable constraint satisfaction at subproblems of up to 4 customers (16 qubits). Diagnostic results identify assignment-level time-window tightness, rather than local route optimization, as the dominant scalability bottleneck. The results demonstrate a practical near-term role for hybrid classical-quantum optimization while establishing empirical limits for current quantum hardware.
The optimization of front-end crude oil scheduling is a critical determinant of refinery profitability and operational stability. However, the coupling of discrete logistics events (e.g., vessel berthing) with continuous material flows (e.g., pipeline transfers) renders this problem an NP-hard Mixed-Integer Linear Programming (MILP) challenge, often intractable for classical solvers at industrial scales. This study proposes a novel hybrid quantum-classical framework to address these computational bottlenecks. We employ Benders Decomposition to decouple the monolithic model into a discrete Master Problem (MP) and a continuous Subproblem (SP). To exploit the search capabilities of quantum computing, the MP is reformulated as a Quadratic Unconstrained Binary Optimization (QUBO) model and solved via a hybrid quantum solver, while the SP enforces mass balance and quality constraints through iterative optimality and feasibility cuts. Extensive experiments on 15 multi-scale instances demonstrate that the proposed framework significantly outperforms traditional metaheuristics (e.g., Genetic Algorithms, Tabu Search), reducing total operating costs by approximately 73--80% and achieving computational speeds comparable to state-of-the-art commercial solvers (Gurobi). By effectively leveraging global optimality cuts, the method overcomes the tendency of heuristic approaches to trap in local optima, providing a robust and scalable solution for complex refinery logistics.
Quantum computing offers transformative potential for addressing complex combinatorial optimization challenges in logistics and supply chain management. This paper presents a comprehensive investigation of quantum annealing and hybrid quantum-classical algorithms applied to unit load device (ULD) configuration and disruption management in air cargo and multimodal logistics networks. We formulate the ULD loading and placement problem as a Quadratic Unconstrained Binary Optimization (QUBO) model that incorporates weight, volume, center-of-gravity, structural stress, and compatibility constraints. A stratified hybrid architecture spanning physical quantum hardware, algorithmic middleware, and decision-support layers is proposed. Through extensive numerical experiments and comparison with classical solvers, we demonstrate superior payload utilization (up to 96.5%), favorable computational scaling, and rapid disruption recovery. Real-world industry pilots, including quantum-assisted route optimization achieving substantial carbon emission reductions and hybrid solutions at major ports, are analyzed. Results indicate that while noisy intermediate-scale quantum (NISQ) hardware limitations persist, hybrid approaches already deliver measurable gains in operational efficiency, cost reduction, and supply-chain resilience. The work provides a practical roadmap for near-term adoption of quantum technologies in high-stakes logistics environments. Keywords— Quantum annealing, Unit load device (ULD), QUBO, Logistics optimization, Disruption management, Hybrid quantum-classical algorithms, Air cargo, Supply chain resilience
This research presents a comprehensive hybrid quantum-classical framework integrating Variational Quantum Circuits (VQCs), Quantum Approximate Optimization Algorithm (QAOA), and quantum kernel methods into production-grade distributed cloud infrastructures. Systematic evaluation across computer vision (MNIST: 42.1% training speedup), genomic analysis (28.4% accuracy improvement), financial portfolio optimization (35.7% risk-adjusted returns), and logistics routing (29.3% latency reduction) demonstrates consistent quantum advantages within current NISQ hardware constraints. Key innovations include dynamic multi-cloud quantum orchestration across Amazon Braket, IBM Quantum, and Azure Quantum platforms, zero-noise extrapolation reducing gate errors from 3.2% to 1.1%, and classical-quantum communication latency optimization achieving 67% reduction. The framework delivers production-ready reliability with 7.2% accuracy gains at 2.3× classical inference cost, yielding clear enterprise ROI for mission-critical applications. Implemented with Qiskit 1.2 and PennyLane 0.38 APIs, the study provides the definitive blueprint for quantum-enhanced AI deployment, bridging NISQ hardware realities with enterprise-scale requirements across healthcare, finance, logistics, and autonomous systems domains.
The logistical management of urban hydrogen fuel cell electric bus (FCEB) fleets presents a computationally complex scheduling problem, especially under dynamic conditions. This paper compares a classical global Mixed-Integer Linear Programming (MILP) baseline with a sequential hybrid quantum–classical model for real-time decision-making (and includes a monolithic quantum comparator for completeness). The hybrid approach employs a classical director to maintain fleet state and, hour by hour, formulates a Quadratic Unconstrained Binary Optimization (QUBO) over candidate actions that is mapped to Ising and solved via the Quantum Approximate Optimization Algorithm (QAOA); the MILP decision is replaced only if the QAOA proposal is feasible and value-improving. Simulation results on a 24-hour, 5-vehicle scenario show that while MILP finds a globally consistent plan, the hybrid method captures short-term opportunities through windowed variational refinement, yielding higher total value; the monolithic quantum solution remains competitive but does not surpass the classical baseline at this scale. The advantage of the hybrid model thus arises from locality and adaptive refinement rather than a Grover-type N\sqrt{N}N​ bound, offering a pragmatic path to dynamic fleet management under realistic SOC and capacity constraints.
Quantum Annealing (QA) presents a promising approach for large-scale combinatorial optimization, though its adoption in the shipping industry remains limited. This study considers a Traveling Salesperson Problem with Time Windows and Earliness Penalties (TSPTW-EP) motivated by a break-bulk cargo-routing use case. A vessel must determine a port-visitation sequence while minimizing sailing and early-delivery storage costs and satisfying arrival-time windows. Direct Quadratic Unconstrained Binary Optimization (QUBO) formulations are limited in size by the hardware constraints of existing annealers and may suffer from rugged energy landscapes arising when encoding the continuous time variables in binary variables. Therefore, a hybrid Benders decomposition approach is proposed. The master problem, selecting port visitation sequences, is formulated as a QUBO and explored on a quantum annealer, while the classical subproblem determines arrival times and produces Benders cuts. Benchmark experiments compare different quantum and classical master solvers within the hybrid scheme on realistic maritime instances, assessing solution quality, runtime, and scalability. Results show that on the considered model, the hybrid pipeline struggles with the feasibility of QUBO solutions, especially due to the need for embeddings onto the QPU hardware. However, they also suggest that hybrid Benders terminates in fewer iterations than the classical Benders decomposition, at the cost of an uncertified stopping criterion and lower solution quality. The study aims to quantify the practical benefits and limits of QA-enabled logistics optimization.