Borrowing Dirty Qubits in Quantum Programs
Bonan Su, Li Zhou, Yuan Feng, Mingsheng Ying
Abstract
Dirty qubits are ancillary qubits that can be borrowed from idle parts of a computation, enabling qubit reuse and reducing the demand for fresh, clean qubits-a resource that is typically scarce in practice. For such reuse to be valid, the initial states of the dirty qubits must not affect the functionality of the quantum circuits in which they are employed. Moreover, their original states, including any entanglement they possess, must be fully restored after use-a requirement commonly known as safe uncomputation. In this paper, we formally define the semantics of dirty-qubit borrowing as a feature in quantum programming languages, and introduce a notion of safe uncomputation for dirty qubits in quantum programs. We also present an efficient algorithm, along with experimental results, for verifying safe uncomputation of dirty qubits in certain quantum circuits.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 1ddc8e22-f621-4165-be84-accef2e27e32Cited by top-tier papers2
- Quantum Uncomputation of Clean and Dirty Ancilla QubitsChenke Liu, Li Zhou, Boning MengOOPSLA 2026
- Formal Verification of Quantum Ancilla SafetyJiqi Li, Jingyi Mei, Wang Fang, Ji GuanCAV 2026
Builds on9
- Silq: a high-level quantum language with safe uncomputation and intuitive semanticsBenjamin Bichsel, Maximilian Baader, Timon Gehr, Martin T. VechevPLDI 2020 · 145 citations
- QuCloud: A New Qubit Mapping Mechanism for Multi-programming Quantum Computing in Cloud EnvironmentLei Liu, Xinglei DouHPCA 2021 · 60 citations
- Qunity: A Unified Language for Quantum and Classical ComputingFinn Voichick, Liyi Li, Robert Rand, Michael HicksPOPL 2023 · 35 citations
- Unqomp: synthesizing uncomputation in Quantum circuitsAnouk Paradis, Benjamin Bichsel, Samuel Steffen, Martin T. VechevPLDI 2021 · 34 citations
- Combining probabilistic and non-deterministic choice via weak distributive lawsAlexandre Goy, Daniela PetrisanLICS 2020 · 30 citations
Related papers
- Modular Synthesis of Efficient Quantum UncomputationHristo Venev, Timon Gehr, Dimitar Dimitrov, Martin T. VechevOOPSLA 2024 · 5 citations
- Qurts: Automatic Quantum Uncomputation by Affine Types with LifetimeKengo Hirata, Chris HeunenPOPL 2025 · 4 citations
- SQUARE: Strategic Quantum Ancilla Reuse for Modular Quantum Programs via Cost-Effective UncomputationYongshan Ding, Xin-Chuan Wu, Adam Holmes, Ash Wiseth et al.ISCA 2020 · 33 citations
- Optimizing Ancilla-Based Quantum Circuits with SPARERitvik Sharma, Sara AchourPLDI 2025
- Twist: sound reasoning for purity and entanglement in Quantum programsCharles Yuan, Christopher McNally, Michael CarbinPOPL 2022 · 30 citations
