From Cables to Qubits: A Decomposed Variational Quantum Optimization Pipeline
AI Breakdown
Get a structured breakdown of this paper — what it's about, the core idea, and key takeaways for the field.
Abstract
The Cable Routing Optimization Problem (CROP) is a multi-flow routing task central to industrial layouts and smart manufacturing installations. We formulate CROP as a cable-wise separable, block-diagonal Quadratic Unconstrained Binary Optimization Problem (QUBO) and derive conservative penalty bounds that preserve feasibility. Exploiting this structure, we introduce a decomposition pipeline that builds one QUBO per cable, transforms each QUBO into a Hamiltonian and solves the subproblems with the Variational Quantum Eigensolver (VQE). Finally, the solutions per cable are merged into a global routing assignment. This procedure reduces the per-run qubits from the full problem size to those of a single-cable subproblem. We test our performance on different cable routing optimization problems varying in size using Qiskit's SamplingVQE. Our findings indicate that a decomposed VQE approach attains feasible and optimal layouts across a range of cable-routing problems.