← back to paper

Review history

arxiv: 2606.07322 · 2 revisions

Quantum Divide-and-Conquer for the Traveling Salesman Problem: Surpassing the $2^n$ Barrier

1. 2026-07-12 CONDITIONAL HIGH v1.1.0-grok45 novelty 7.0
   30894 ms 29828 in 3345 out 2026-07-12T14:52:22.105021+00:00
2. 2026-06-27 UNVERDICTED LOW v0.9.1-grok novelty 7.0
   28131 ms 5863 in 1609 out 2026-06-27T21:51:09.181087+00:00