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
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2026 2verdicts
UNVERDICTED 2representative citing papers
Montparnasse Monte Carlo framework solves all Eterna100 V1 puzzles faster than DesiRNA and finds mRNA sequences with more paired bases than LinearDesign's MFE solution.
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.
-
The Montparnasse Algorithm for RNA Design
Montparnasse Monte Carlo framework solves all Eterna100 V1 puzzles faster than DesiRNA and finds mRNA sequences with more paired bases than LinearDesign's MFE solution.