QuantumComputing
Task 31 / 47
task_01_routing_qftentangled
Routing-oriented compilation for entangled QFT-style circuits: assign SWAP insertions and mapping under a coupling graph and gate set to minimize depth or a noise-aware cost. It mixes discrete layout choices with compilation objectives found in near-term superconducting processors.
Model leaderboard
Updated v1 results · 2026-09-15 · raw score, higher is better.
| # | Participant | Raw score | Medal |
|---|---|---|---|
| 1 | GLM-5 | 3.5195267 | Gold |
| 2 | Grok 4.20 | 3.5048626 | Silver |
| 3 | DeepSeek V3.2 | 3.4495201 | Bronze |
| 4 | GPT-5.4 | 3.3843737 | — |
| 5 | Claude Opus 4.6 | 0.1978393 | — |
| 5 | Gemini 3.1 Pro Preview | 0.1978393 | — |
| — | Qwen3 Coder Next | No valid score | — |
| — | Seed 2.0 Pro | No valid score | — |
Framework results · original paper
Historical results from the original evaluators · normalized score (0–100).
| # | Participant | Score |
|---|---|---|
| 1 | Claude Opus 4.6 + ShinkaiEvolve | 100.0 |
| 2 | Claude Opus 4.6 + OpenEvolve | 84.4 |
| 3 | Claude Opus 4.6 + ABMCTS | 62.8 |
| 4 | GPT-OSS + ABMCTS | 60.0 |
| 5 | GPT-OSS + ShinkaiEvolve | 0.0 |
| 6 | GPT-OSS + OpenEvolve | 0.0 |
Model results use the updated scores and medal thresholds. No valid score earns zero medal credit. Historical framework scores use the original evaluators and have not been updated alongside the model results.