Pith. sign in

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

arxiv 2409.10153 v2 pith:LCE7WJWU submitted 2024-09-16 quant-ph

classification quant-ph
keywords quantuminterpretationlogicreasoningheapbunchedchallengesmkern-3mu
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
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.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Quantum Uncomputation of Clean and Dirty Ancilla Qubits

    cs.PL 2026-08 conditional novelty 8.0 of 10

    Quantum compilers can now automatically uncompute dirty ancillas with a rewrite-based normalizer, and the existence problem is coNP-hard.

  2. Bona: Automatic Management of Dirty Ancilla Borrowing in Quantum Circuits

    cs.PL 2026-08 conditional novelty 7.0 of 10

    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...

Pith tools