TheMachine Press

A daily newspaper for the age of artificial intelligence.

Morning editionPermanent story

chips infrastructure

One Compiler Cut a Quantum Workload 241-Fold

A traceable path from algorithms to surface-code schedules showed why logical gate totals miss physical cost.

Published Updated Story ID: mp-2026-09-12-013
Read the complete editionStory JSON

Summary

A traceable path from algorithms to surface-code schedules showed why logical gate totals miss physical cost.

The framework converts hierarchical quantum algorithms into dependency-preserving schedules and time-resolved workloads, then co-designs surface-code layout, resource-state supply and execution. Across 20 circuits in seven families, similar logical counts produced very different physical costs. Under the authors’ direct-rotation calibration, choosing the non-Clifford implementation reduced space-time volume by as much as 241.5× for one QAOA amplitude-amplification workload. Tailored layouts lowered routed latency for every benchmark and lowered space-time volume for 13 of them.

Why it matters

A traceable path from algorithms to surface-code schedules showed why logical gate totals miss physical cost.

Limits and context

No additional limitation was separately recorded.

Key claims

  1. A traceable path from algorithms to surface-code schedules showed why logical gate totals miss physical cost.

    Evidence: source-2026-09-12-013

Sources

  1. arXiv preprint 2609.10965arXiv · primary research

Corrections

No corrections have been recorded for this story.