REVIEW 2 cited by
An Interpretation of Bunched Logic for Reasoning about Heap-Manipulating Quantum Programs
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Signed reviews
abstract
We introduce heap manipulation into quantum programming languages to enable flexible quantum memory management, which in turn poses new challenges for reasoning about program correctness. To address these challenges, we develop a novel quantum interpretation of bunched logic by extending Birkhoff--von Neumann quantum logic to Hilbert spaces whose dimensions vary to accommodate the dynamic allocation and deallocation of variables on the quantum heap. Beyond the separating conjunction ($*$), we present, for the first time, a quantum interpretation of the separating implication ($-\mkern-3mu*$) to support backward reasoning. This interpretation preserves the adjunction between ($*$) and ($-\mkern-3mu*$), ensuring that both operators capture spatial properties and are precisely aligned with the semantics of quantum heap manipulations. Building on this foundation, we establish a quantum separation logic that supports local reasoning and is relatively complete.
Forward citations
Cited by 2 Pith papers
-
Quantum Uncomputation of Clean and Dirty Ancilla Qubits
Quantum compilers can now automatically uncompute dirty ancillas with a rewrite-based normalizer, and the existence problem is coNP-hard.
-
Bona: Automatic Management of Dirty Ancilla Borrowing in Quantum Circuits
A depth-aware heuristic scheduler, Bona, automatically reuses dirty ancilla qubits in quantum circuits, reducing dirty-ancilla usage by up to 99% on tested benchmarks, with a claimed proof that the general borrowing p...
Discussion (0). Continue with ORCID to comment.