AtomTreeSearch embeds a neutral-atom quantum MWIS subroutine inside Monte Carlo Tree Search and matches or exceeds OR-Tools and simulated annealing on TSP instances up to 100 cities.
Title resolution pending
4 Pith papers cite this work. Polarity classification is still indexing.
4
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
years
2026 4roles
background 1polarities
background 1representative citing papers
LoRe adaptively budgets per-step interaction evaluations in iterative graph solvers via dynamic routing, delivering 8-15x speedups and 12-44x memory reductions on MIS and TSP while preserving solution quality.
Graph contraction reduces TSP instances to smaller sub-problems solvable by quantum annealers, shown via Path Integral Monte Carlo simulation and D-Wave hardware.