QAOA achieves approximation ratios of 0.90-0.95 on N=5-20 Euclidean graphs, outperforming classical baselines by 2.7-4.4% with 2-3x faster runtimes and picojoule-scale energy use, projecting 8.2% real-world routing efficiency gains and 2.62 EJ annual US fuel savings.
Gambardella, Luca˙Ant algorithms for discrete optimization.Artificial Life, 5(2):137–172, 1999
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.ET 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Potential Energy Savings from Quantum Computing-Based Route Optimization
QAOA achieves approximation ratios of 0.90-0.95 on N=5-20 Euclidean graphs, outperforming classical baselines by 2.7-4.4% with 2-3x faster runtimes and picojoule-scale energy use, projecting 8.2% real-world routing efficiency gains and 2.62 EJ annual US fuel savings.