Quantum Similarity-Driven QUBO Framework for Multi-Period Supply Chain Allocation using Time-Multiplexed Coherent Ising Machines and Simulated Quantum Annealing

• URL: http://arxiv.org/abs/2510.21544v1
• Date: Fri, 24 Oct 2025 15:04:27 GMT
• Title: Quantum Similarity-Driven QUBO Framework for Multi-Period Supply Chain Allocation using Time-Multiplexed Coherent Ising Machines and Simulated Quantum Annealing
• Abstract summary: Multi-period stock-keeping unit allocation in supply chains is a feasible optimization problem that is both NP-hard and operationally critical.<n>This work proposes a hybrid QUBO framework integrating three advances: (i) a quantum-derived similarity kernel, obtained from a variational RX embedding, to discourage redundant SKU selections; (ii) exact per-period capacity enforcement via slack-bit encoding to maintain feasibility; and (iii) execution on a time-multiplexed Coherent Ising Machine.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Multi-period stock-keeping unit (SKU) allocation in supply chains is a combinatorial optimization problem that is both NP-hard and operationally critical, requiring simultaneous attention to profitability, feasibility, and diversity. Quadratic unconstrained binary optimization (QUBO) provides a principled framework for such tasks, yet prior studies often rely on simplified assumptions or omit real operational constraints. This work proposes a hybrid QUBO framework integrating three advances: (i) a quantum-derived similarity kernel, obtained from a variational RX embedding, to discourage redundant SKU selections; (ii) exact per-period capacity enforcement via slack-bit encoding to maintain feasibility; and (iii) execution on a time-multiplexed Coherent Ising Machine (CIM) benchmarked against simulated quantum annealing (SQA) and classical optimization algorithms. The resulting model, with over one million quadratic terms and about 4,100 variables, captures profit, risk, and capacity interactions within a unified formulation. On a dataset of 500 SKUs across eight planning periods, Quanfluence's CIM achieved an energy of minus 2.95 times 10 to the power of 16, producing robust solutions with 288 distinct SKUs (approximately 60 percent of the catalog), 226,813 allocated units, and 12.75 million dollars profit, all with zero capacity violations. These results demonstrate that hybrid quantum-classical QUBO methods can deliver feasible and profitable supply-chain allocations at an industrial scale.

Related papers

• Resource-Efficient Hybrid Quantum Neighborhood Selection for Large-Scale Molecular Diversity Optimization [0.0]
  Hybrid Quantum Neighborhood Selection (HQNS) is a framework that decomposes large dense QUBO instances into bounded-width quantum subproblems.<n>HQNS preserves 99.9908% of the mean diversity score of an 11-restart parallel Simulated Annealing baseline, while reducing wall-clock time by 94.91%, peak CPU utilization by 64.68%, and peak memory usage by 88.61%.
  arXiv  Detail & Related papers  (2026-07-08T12:25:47Z)
• Hybrid Quantum Neighborhood Selection: NISQ-Compatible Combinatorial Optimization via Stochastic Frontier Decomposition [0.0]
  This work introduces Hybrid Quantum Neighborhood Selection (HQNS)<n>HQNS selects a compact frontier of F N active variables per stage, freezing the rest into reduced QUBO coefficients.<n>We evaluate HQNS on the Maximum Diversity Subset Selection Problem (MDSSP) across six scales, N up to 1000.
  arXiv  Detail & Related papers  (2026-06-28T23:35:46Z)
• 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)
• Solve Crude Oil Scheduling Problems by Using Quantum-Classical Hybrid Algorithms [21.36249008423304]
  Front-end crude oil scheduling is a critical determinant of refinery profitability and operational stability.<n>This study proposes a novel hybrid quantum-classical framework to address these computational bottlenecks.
  arXiv  Detail & Related papers  (2026-04-29T09:15:06Z)
• Multi-Objective Evolutionary Optimization of Chance-Constrained Multiple-Choice Knapsack Problems with Implicit Probability Distributions [40.96538452098451]
  This paper investigates a significant yet underexplored extension of the multiple-choice knapsack problem (MCKP)<n>The goal of the problem is to simultaneously minimize the total cost and maximize the confidence level of satisfying the capacity constraint.<n> Experiments on synthetic benchmarks and real-world 5G network configuration benchmarks demonstrate that NHILS consistently outperforms several state-of-the-art multi-objectives.
  arXiv  Detail & Related papers  (2026-03-09T10:39:58Z)
• A Scalable Distributed Quantum Optimization Framework via Factor Graph Paradigm [46.08923284345648]
  We introduce a structure-aware framework for distributed quantum optimization.<n>We find that for a search space of size $N$, our framework achieves $O(sqrtN)$ query complexity up to processors and separator dependent factors.<n>We show that structure-aware decomposition delivers a practical path to scalable distributed quantum optimization on quantum networks.
  arXiv  Detail & Related papers  (2026-03-08T15:15:52Z)
• Quantum-Amplified M/G/1/K Simulation: A Comparator-Controlled Framework for Arbitrary Service Distributions [2.8547732086436306]
  This work presents the first coherent quantum circuit for simulating an M/G/1/K queue under arbitrary service-time laws.<n> Grover iterations center on estimating the expected number of customers in the system, yielding provable $O(sqrtN)$ variance reduction.<n> Empirical evaluations on IBM quantum simulators demonstrate fidelity above 0.99 with four qubits and above 0.76 with ten qubits, with Jensen-Shannon divergence below 0.11.
  arXiv  Detail & Related papers  (2025-12-11T11:42:17Z)
• Hybrid Sequential Quantum Computing [33.72751145910978]
  We introduce hybrid sequential quantum computing (HSQC)<n>HSQC systematically integrates classical and quantum methods within a structured, stage-wise workflow.<n>Compared to standalone classical solvers, HSQC achieves a speedup of up to 700 times over SA and up to 9 times over runtime.
  arXiv  Detail & Related papers  (2025-10-07T12:15:43Z)
• Hybrid Quantum-Classical Optimisation of Traveling Salesperson Problem [0.0]
  We propose a hybrid quantum-classical framework integrating variational quantum eigensolver (VQE) optimisation with classical machine learning.<n>We evaluate the framework on 80 European cities via Qiskit's AerSimulator and ibm_kyiv 127-qubit backend.
  arXiv  Detail & Related papers  (2025-09-30T13:26:12Z)
• Hybrid Quantum-Classical Branch-and-Price Method for the Vertex Coloring Problem [0.11242503819703255]
  Quantum Classical Branch-and-Price (QCBP) is a hybrid quantum-classical algorithm for the Vertex Coloring problem on neutral-atom Quantum Processing Units (QPUs)
  arXiv  Detail & Related papers  (2025-08-26T10:03:56Z)
• Quantum Annealing for Machine Learning: Applications in Feature Selection, Instance Selection, and Clustering [41.94295877935867]
  We implement both quantum and classical solvers to compare their effectiveness.<n>For feature selection, we propose several QUBO configurations that balance feature importance and redundancy.<n>In instance selection, we propose a few novels for instance-level importance measures that extend existing methods.<n>For clustering, we embed a classical-to-quantum pipeline, using classical clustering followed by QUBO-based medoid refinement.
  arXiv  Detail & Related papers  (2025-07-20T17:59:14Z)
• Projective Quantum Eigensolver with Generalized Operators [0.0]
  We develop a methodology for determining the generalized operators in terms of a closed form residual equations in the PQE framework. With the application on several molecular systems, we have demonstrated our ansatz achieves similar accuracy to the (disentangled) UCC with singles, doubles and triples.
  arXiv  Detail & Related papers  (2024-10-21T15:40:22Z)
• Bias-field digitized counterdiabatic quantum optimization [39.58317527488534]
  We call this protocol bias-field digitizeddiabatic quantum optimization (BF-DCQO) Our purely quantum approach eliminates the dependency on classical variational quantum algorithms. It achieves scaling improvements in ground state success probabilities, increasing by up to two orders of magnitude.
  arXiv  Detail & Related papers  (2024-05-22T18:11:42Z)
• KVQuant: Towards 10 Million Context Length LLM Inference with KV Cache Quantization [67.74400574357472]
  LLMs are seeing growing use for applications which require large context windows, and with these large context windows KV cache activations surface as the dominant contributor to memory consumption during inference.<n> Quantization is a promising approach for compressing KV cache activations; however, existing solutions fail to represent activations accurately in sub-4-bit precision.<n>Our work, KVQuant, facilitates low precision KV cache quantization by incorporating several novel methods.
  arXiv  Detail & Related papers  (2024-01-31T18:58:14Z)
• Distribution-Flexible Subset Quantization for Post-Quantizing Super-Resolution Networks [68.83451203841624]
  This paper introduces Distribution-Flexible Subset Quantization (DFSQ), a post-training quantization method for super-resolution networks. DFSQ conducts channel-wise normalization of the activations and applies distribution-flexible subset quantization (SQ) It achieves comparable performance to full-precision counterparts on 6- and 8-bit quantization, and incurs only a 0.1 dB PSNR drop on 4-bit quantization.
  arXiv  Detail & Related papers  (2023-05-10T04:19:11Z)
• A self-consistent field approach for the variational quantum eigensolver: orbital optimization goes adaptive [52.77024349608834]
  We present a self consistent field approach (SCF) within the Adaptive Derivative-Assembled Problem-Assembled Ansatz Variational Eigensolver (ADAPTVQE) This framework is used for efficient quantum simulations of chemical systems on nearterm quantum computers.
  arXiv  Detail & Related papers  (2022-12-21T23:15:17Z)
• Decomposition of Matrix Product States into Shallow Quantum Circuits [62.5210028594015]
  tensor network (TN) algorithms can be mapped to parametrized quantum circuits (PQCs) We propose a new protocol for approximating TN states using realistic quantum circuits. Our results reveal one particular protocol, involving sequential growth and optimization of the quantum circuit, to outperform all other methods.
  arXiv  Detail & Related papers  (2022-09-01T17:08:41Z)
• Realization of arbitrary doubly-controlled quantum phase gates [62.997667081978825]
  We introduce a high-fidelity gate set inspired by a proposal for near-term quantum advantage in optimization problems. By orchestrating coherent, multi-level control over three transmon qutrits, we synthesize a family of deterministic, continuous-angle quantum phase gates acting in the natural three-qubit computational basis.
  arXiv  Detail & Related papers  (2021-08-03T17:49:09Z)
• Multi-block ADMM Heuristics for Mixed-Binary Optimization on Classical and Quantum Computers [3.04585143845864]
  We present a decomposition-based approach to extend the applicability of current approaches to "quadratic plus convex" mixed binary optimization problems. We show that the alternating direction method of multipliers (ADMM) can split the MBO into a binary unconstrained problem (that can be solved with quantum algorithms) The validity of the approach is then showcased by numerical results obtained on several optimization problems via simulations with VQE and QAOA on the quantum circuits implemented in Qiskit.
  arXiv  Detail & Related papers  (2020-01-07T14:43:13Z)

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.