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.
://arxiv.org/abs/2502.04291
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
quant-ph 2verdicts
UNVERDICTED 2representative citing papers
A divide-and-conquer heuristic enables solving MWIS instances from molecular docking with graphs of 225-585 vertices on neutral-atom quantum emulators, outperforming greedy baselines and recovering provably optimal solutions on some instances.
citing papers explorer
-
Quantum-enhanced Monte Carlo Tree Search framework for combinatorial optimization problems
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.
-
A Scalable Heuristic for Molecular Docking on Neutral-Atom Quantum Processors
A divide-and-conquer heuristic enables solving MWIS instances from molecular docking with graphs of 225-585 vertices on neutral-atom quantum emulators, outperforming greedy baselines and recovering provably optimal solutions on some instances.