aiqbench analysis
This research addresses the critical bottleneck in scaling quantum software stacks by advocating for structured program representations over traditional straight-line circuits. The authors argue that preserving classical control flow and dynamism is essential for efficiently compiling complex, fault-tolerant algorithms involving mid-circuit measurements and billions of operations. Ignoring this structure risks unrolling programs into inefficient forms that hinder the development of future high-fidelity quantum hardware.
Why Are We Unrolling? The Importance of Structured Quantum Programs for Compilation
arXiv:2609.16171v1 Announce Type: new Abstract: As quantum software stacks scale up to support future fault-tolerant quantum hardware and algorithms, quantum compilation is becoming an increasingly important component of the stack. How do we ensure that our software stacks support dynamic algorithms, including patterns such as mid-circuit measurement feedforward and repeat-until-success, with hundreds of logical qubits and billions of quantum operations? To do so, we must re-think how we represent quantum programs beyond straight-line circuits, to representations that include classical structure and dynamism, and make this the default representation to consider when performing quantum compilation. In this work, we present important patterns and algorithms from fault-tolerant quantum applications which admit a structured representation that we argue is crucial to preserve, and set a challenge to the community to compile such representations without unrolling them into straight-line quantum circuits. We also explore the status quo of structured program support in quantum software, and ask ourselves the rhetorical question: how much more efficient can we make quantum compilation tooling when we take into account the additional information from classical structure?
Title:Why Are We Unrolling? The Importance of Structured Quantum Programs for Compilation
Abstract:As quantum software stacks scale up to support future fault-tolerant quantum hardware and algorithms, quantum compilation is becoming an increasingly important component of the stack. How do we ensure that our software stacks support dynamic algorithms, including patterns such as mid-circuit measurement feedforward and repeat-until-success, with hundreds of logical qubits and billions of quantum operations? To do so, we must re-think how we represent quantum programs beyond straight-line circuits, to representations that include classical structure and dynamism, and make this the default representation to consider when performing quantum compilation. In this work, we present important patterns and algorithms from fault-tolerant quantum applications which admit a structured representation that we argue is crucial to preserve, and set a challenge to the community to compile such representations without unrolling them into straight-line quantum circuits. We also explore the status quo of structured program support in quantum software, and ask ourselves the rhetorical question: how much more efficient can we make quantum compilation tooling when we take into account the additional information from classical structure?
arXiv:2609.16171 [quant-ph]
(or arXiv:2609.16171v1 [quant-ph] for this version)
https://doi.org/10.48550/arXiv.2609.16171 Focus to learn more arXiv-issued DOI via DataCite
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Full text under the publisher's open licence · 273 words
Related coverage
Quera Computing Preserves Structure for Scalable Quantum Programs
Quantum Zeitgeist · Sep 22, 2026
Synthesis Superintelligence: from Semiconductors to Superconductors — Periodic Labs’ Liam Fedus and Ekin Dogus Cubuk
Latent Space · Oct 8, 2026
Donald Knuth, The Man Who Made Algorithms Count
Quantum Zeitgeist · Aug 7, 2026
Konrad Zuse, Who Built The First Programmable Computer And Then Argued The Universe Is One
Quantum Zeitgeist · Sep 13, 2026