1 citations · 1 across the 6 of their papers we have counts for
6 papers
Bona: Automatic Management of Dirty Ancilla Borrowing in Quantum Circuits
Xiaoquan Xu, Chenke Liu, Boning Meng +2
The management of ancilla qubits has become a critical technique for reducing quantum circuit width. Dirty ancillas, which may be borrowed from any temporarily idle qubit regardles…
Resource Estimation for Fault-Tolerant Quantum Programs
Bonan Su, Yuan Feng, Li Zhou +1
Fault-tolerant quantum computation enables the deployment of practical quantum algorithms but incurs substantial overhead from error correction, making resource estimation a centra…
Borrowing Dirty Qubits in Quantum Programs
Bonan Su, Li Zhou, Yuan Feng +1
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 typ…
Refinement orders for quantum programs
Yuan Feng, Li Zhou
Refinement is a fundamental technique in the verification and systematic development of computer programs. It supports a disciplined approach to software construction through stepw…
An Interpretation of Bunched Logic for Reasoning about Heap-Manipulating Quantum Programs
Bonan Su, Li Zhou, Yuan Feng +1
We introduce heap manipulation into quantum programming languages to enable flexible quantum memory management, which in turn poses new challenges for reasoning about program corre…
Refinement calculus of quantum programs with projective assertions
Yuan Feng, Li Zhou, Yingte Xu
Refinement calculus provides a structured framework for the progressive and modular development of programs, ensuring their correctness throughout the refinement process. This pape…