{
  "abstract": "Fault-tolerant quantum computing is progressing from demonstrations of individual logical components toward the execution of useful quantum algorithms on large-scale error-corrected processors. Realizing this transition requires co-design across algorithms, fault-tolerant implementations, and hardware resources. Here we develop an algorithm-to-execution framework for low-cost surface-code quantum computing that carries the structure of a computation from hierarchical logical descriptions to circuit-specific spatial organization, non-Clifford resource planning, and physical resource evaluation. We apply the framework to twenty benchmark circuits spanning seven algorithm families and to a hierarchically reconstructed application-scale elliptic-curve discrete-logarithm workload. Under the stated error and resource-supply models, combining circuit-specific layouts with hybrid non-Clifford implementation reduces space--time volume by up to 12.70x relative to an all-synthesis Litinski fast-block baseline. Circuit-specific layouts reduce both modeled runtime and space--time volume in eighteen benchmarks, while the remaining two retain the fast layout. These results show that the physical cost of fault-tolerant computation emerges from the interaction between algorithm structure, error-corrected implementation, and hardware organization rather than from aggregate logical resource counts alone.",
  "abstract_shown": true,
  "affiliations": [],
  "article_type": null,
  "arxiv": "2609.10965",
  "author_total": 17,
  "authors": [
    {
      "name": "Yunxin Tang"
    },
    {
      "name": "Zixuan Huo"
    },
    {
      "name": "Junxiang Huang"
    },
    {
      "name": "Zhou You"
    },
    {
      "name": "Zhirao Wang"
    },
    {
      "name": "Zhenai Ding"
    },
    {
      "name": "Yumeng Zeng"
    },
    {
      "name": "Yangyu Lu"
    },
    {
      "name": "Yiming Huang"
    },
    {
      "name": "Zongkang Zhang"
    },
    {
      "name": "Haipeng Xie"
    },
    {
      "name": "Ruipeng Xing"
    },
    {
      "name": "Qiming Ding"
    },
    {
      "name": "Ying Li"
    },
    {
      "name": "Jinzhao Sun"
    },
    {
      "name": "Xiao Yuan"
    },
    {
      "name": "Yuan Yao"
    }
  ],
  "bibtex": "https://research.draconitic.com/paper/e2y017qd1xvy1.bib",
  "cited_by": 0,
  "doi": "10.48550/arxiv.2609.10965",
  "fulltext_url": null,
  "id": "e2y017qd1xvy1",
  "issns": [],
  "landing_url": "https://arxiv.org/abs/2609.10965",
  "language": null,
  "licence": "LicenseRef-arXiv-nonexclusive-1.0",
  "licence_label": "arXiv licence",
  "licence_source": "article",
  "licence_url": "http://arxiv.org/licenses/nonexclusive-distrib/1.0/",
  "metadata_licence": "CC0-1.0",
  "native_subjects": [
    [
      "arxiv",
      "quant-ph"
    ],
    [
      "openalex",
      "1702|Quantum Computing Algorithms and Architecture"
    ]
  ],
  "openalex": "W7212261148",
  "pdf_url": "https://arxiv.org/pdf/2609.10965",
  "pmcid": null,
  "pmid": null,
  "published": "2026-10-13",
  "publisher": null,
  "ris": "https://research.draconitic.com/paper/e2y017qd1xvy1.ris",
  "sources": [
    {
      "first_seen": "2026-10-30T12:29:11Z",
      "native_id": "2609.10965",
      "source": "arxiv",
      "url": "https://arxiv.org/abs/2609.10965"
    }
  ],
  "subjects": [
    {
      "field": "physics",
      "origin": "arxiv:quant-ph",
      "subfield": "quantum"
    }
  ],
  "title": "Low-cost algorithm-to-execution framework for surface-code quantum computing",
  "title_text": "Low-cost algorithm-to-execution framework for surface-code quantum computing",
  "type": "preprint",
  "updated_at": "2026-10-30T12:29:11Z",
  "url": "https://research.draconitic.com/paper/e2y017qd1xvy1",
  "venue": "arXiv",
  "versions": []
}