aiqbench analysis
This study evaluates a hybrid quantum-classical framework for solving mixed-integer linear programming problems using Benders decomposition on vehicle routing benchmarks. The results indicate that current hardware limitations, specifically the computational overhead of classical cut selection steps relative to small-scale QPU performance, currently negate potential quantum advantages in this architecture. Future progress hinges on scaling up qubit counts and improving solver efficiency before hybrid pipelines can offer practical benefits for complex optimization tasks.
Hybrid quantum-classical end-to-end pipeline for solving MILPs: a vehicle routing case study
arXiv:2607.26771v1 Announce Type: new Abstract: We demonstrate an end-to-end hybrid quantum-classical optimisation framework based on Benders decomposition, capable of solving mixed-integer linear programming (MILP) problems. The framework builds on a previously presented hybrid quantum-classical end-to-end pipeline based on Multiple Cuts via Multiple Solutions (MCMS) Benders decomposition where the cut selection step was performed on quantum annealing hardware. We extend this with gate-based QAOA implementations for both tensor network emulators and superconducting quantum hardware. The Vehicle Routing Problem (VRP) is used as a representative case study and we run the pipeline end-to-end on 10 permutations of a standardised benchmarking instance (20 customers and 4 vehicles from QOptLib) with a classical solver performing the cut selection step. We find that for our instances, only a small fraction of the compute in classical MCMS Benders decomposition is spent on the cut selection step. For a full hybrid end-to-end assessment, we run the pipeline for a toy problem with MPS-JuliQAOA, a powerful tensor network emulator, to execute QAOA. Here, the majority of the time is spent on the cut selection step, deeming quantum advantage of this framework unlikely at problems of this size. This highlights the need for more large-scale benchmarking research when more powerful (QPU) QUBO solvers are available.
Abstract:We demonstrate an end-to-end hybrid quantum-classical optimisation framework based on Benders decomposition, capable of solving mixed-integer linear programming (MILP) problems. The framework builds on a previously presented hybrid quantum-classical end-to-end pipeline based on Multiple Cuts via Multiple Solutions (MCMS) Benders decomposition where the cut selection step was performed on quantum annealing hardware. We extend this with gate-based QAOA implementations for both tensor network emulators and superconducting quantum hardware. The Vehicle Routing Problem (VRP) is used as a representative case study and we run the pipeline end-to-end on 10 permutations of a standardised benchmarking instance (20 customers and 4 vehicles from QOptLib) with a classical solver performing the cut selection step. We find that for our instances, only a small fraction of the compute in classical MCMS Benders decomposition is spent on the cut selection step. For a full hybrid end-to-end assessment, we run the pipeline for a toy problem with MPS-JuliQAOA, a powerful tensor network emulator, to execute QAOA. Here, the majority of the time is spent on the cut selection step, deeming quantum advantage of this framework unlikely at problems of this size. This highlights the need for more large-scale benchmarking research when more powerful (QPU) QUBO solvers are available.
arXiv:2607.26771 [quant-ph]
(or arXiv:2607.26771v1 [quant-ph] for this version)
https://doi.org/10.48550/arXiv.2607.26771 Focus to learn more arXiv-issued DOI via DataCite (pending registration)
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Full text under the publisher's open licence · 292 words
Related coverage
News Archive 2026
Quantum Computing Report · Jul 25, 2026

News
Quantum Computing Report · Jun 7, 2026

Corey O’Meara (E.ON): Finding Real Quantum Advantage in Grid Optimization
The Quantum Insider · Oct 10, 2026
Cooperative Platoon Routing and Dispatching via Edge-Assisted Hybrid Quantum Optimization
arXiv · Aug 4, 2026