2 papers
quant-ph2026
From Cables to Qubits: A Decomposed Variational Quantum Optimization Pipeline
Paul-Niklas Ken Kandora, Adrian Asmund Fessler, Robert Fabian Lindermann +3
The Cable Routing Optimization Problem (CROP) is a Multi-Commodity Flow Problem (MCFP) central to industrial layouts and smart manufacturing. Historically, quantum optimization has…
cs.DC2026
SPHERE: Spherical partitioning for large-scale routing optimization
Robert Fabian Lindermann, Paul-Niklas Ken Kandora, Simon Caspar Zeller +2
We study shortest-path routing in large weighted, undirected graphs, where expanding search frontiers raise time and memory costs for exact solvers. We propose \emph{SPHERE}, a que…