REVIEW 7 cited by
Solving Large-Scale Vehicle Routing Problems with Hybrid Quantum-Classical Decomposition
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Solving Large-Scale Vehicle Routing Problems with Hybrid Quantum-Classical Decomposition
read the original abstract
We present a two-level decomposition strategy for solving the Vehicle Routing Problem (VRP) using the Quantum Approximate Optimization Algorithm. A Problem-Level Decomposition partitions a 13-node (156-qubit) VRP into smaller Traveling Salesman Problem (TSP) instances. Each TSP is then further cut via Circuit-Level Decomposition, enabling execution on near-term quantum devices. Our approach achieves up to 95\% reductions in the circuit depth, 96\% reduction in the number of qubits and a 99.5\% reduction in the number of 2-qubit gates. We demonstrate this hybrid algorithm on the standard edge encoding of the VRP as well as a novel amplitude encoding. These results demonstrate the feasibility of solving VRPs previously too complex for quantum simulators and provide early evidence of potential quantum utility.
Forward citations
Cited by 7 Pith papers
-
HybridQC: Hardware-Grounded Simulation of Tightly Integrated Hybrid Quantum-Classical Systems
HybridQC is a hardware-calibrated, topology-aware simulator that predicts hybrid quantum-classical system bottlenecks, finding that balanced 10x scaling yields only 2.19x-3.42x makespan improvement and that workload g...
-
Scalable quantum circuit knitting using a weak-coupling approximation
A weak-coupling approximation reduces classical overhead in quantum circuit knitting to polynomial cost when one qubit couples weakly to others, shown on QAOA-style layered circuits.
-
Versioned Late Materialization for Ultra-Long Sequence Training in Recommendation Systems at Scale
Versioned late materialization stores user histories once and reconstructs sequences just-in-time during training to cut redundancy and enable longer sequences in large-scale recommendation systems.
-
Hierarchical QAOA for the Vehicle Routing Problem via Clustered Decomposition and Local Feasibility Repair
Hierarchical clustered decomposition plus local repair lets standard QAOA solve 13-node two-vehicle VRP instances using 12 qubits per subproblem with approximation ratios 1.2-1.5 versus Gurobi.
-
From Prototype to Classroom: An Intelligent Tutoring System for Quantum Education
ITAS, a multi-agent tutoring system with quantum-specialized LLM agents, cloud infrastructure, and analytics, was deployed in a real quantum computing course and provided evidence that agent specialization improves re...
-
Versioned Late Materialization for Ultra-Long Sequence Training in Recommendation Systems at Scale
Introduces versioned late materialization to eliminate data redundancy in ultra-long sequence training for DLRMs by storing histories once and reconstructing via pointers at training time.
-
Distributed Quantum-Enhanced Optimization: A Topographical Preconditioning Approach for High-Dimensional Search
D-QEO framework uses quantum topographical preconditioning on separable functions via small parallel subcircuits to generate seeds that accelerate classical global optimization and avoid exponential failure rates.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.