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
| # | Participant | Score |
|---|---|---|
| 1 | GPT-5.4 | 100.0 |
| 2 | Claude Opus 4.6 | 76.8 |
| 3 | GLM-5 | 56.5 |
| 4 | Grok 4.20 | 56.5 |
| 5 | SEED 2.0 Pro | 55.1 |
| 6 | DeepSeek V3.2 | 54.1 |
| 7 | Qwen3 Coder Next | 48.2 |
| 8 | Gemini 3.1 Pro Preview | 0.0 |
Framework leaderboard
| # | 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 |
Score is the normalized score for this task (0–100, higher is better).