Saved in:
| Main Authors: | , , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2510.21901 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Table of Contents:
- The Cable Routing Optimization Problem (CROP) is a Multi-Commodity Flow Problem (MCFP) central to industrial layouts and smart manufacturing. Historically, quantum optimization has modeled MCFPs as Quadratic Unconstrained Binary Optimization problems (QUBOs). Recent studies suggest that mapping routing problems to Polynomial Unconstrained Binary Optimization problems (PUBOs) can improve efficiency. However, solving full-scale MCFPs with quantum optimization remains computationally challenging. To bridge this gap, we introduce a Decomposed Variational Quantum Pipeline that exploits the block-diagonal structure of CROP, breaking the multi-cable routing task into modular, single-commodity subproblems. We explicitly derive both the QUBO and PUBO representations for CROP and demonstrate that our pipeline can evaluate both formulations within the same pipeline. Our empirical study highlights a trade-off: PUBO eliminates auxiliary qubits at the cost of circuit depth. In our experiments, the decomposed pipeline accelerates time-to-solution, reliably generating feasible cable layouts while trading strict optimality for computational scalability. PUBO formulations achieved full routing feasibility across all tested seeds, while global QUBO formulations showed substantially lower robustness.