An extended set-based specification language translates to compact automata in linear time in the number of qubits, enabling fully automatic Hoare-style verification of quantum programs at larger scales.
An automated deductive verification framework for circuit-building quantum programs
5 Pith papers cite this work, alongside 55 external citations. Polarity classification is still indexing.
5
Pith papers citing it
55
external citations · OpenAlex
citation-role summary
background 2
citation-polarity summary
roles
background 2polarities
background 2representative citing papers
Hybrid Path-Sums offer a new symbolic framework with rewriting rules and assertions to represent, simplify, and verify properties of hybrid quantum-classical programs.
Coq framework with discrete lenses for typed, compositional definition and verification of quantum circuits.
Integer hybrid path-sums plus a sound Hoare logic enable semi-automated functional verification and expected-cost analysis of hybrid quantum programs with unbounded while loops.
The paper develops verified Rocq tactics for string-diagram-based equational reasoning in symmetric monoidal categories via conversion to hypergraphs with interfaces.
citing papers explorer
-
A Practical Specification Language for Automatic Quantum Program Verification (Technical Report)
An extended set-based specification language translates to compact automata in linear time in the number of qubits, enabling fully automatic Hoare-style verification of quantum programs at larger scales.
-
Hybrid Path-Sums for Hybrid Quantum Programs
Hybrid Path-Sums offer a new symbolic framework with rewriting rules and assertions to represent, simplify, and verify properties of hybrid quantum-classical programs.
-
Typed compositional quantum computation with lenses
Coq framework with discrete lenses for typed, compositional definition and verification of quantum circuits.
-
An Effective Quantum Hoare Logic for Hybrid Quantum Programs with Unbounded Loops
Integer hybrid path-sums plus a sound Hoare logic enable semi-automated functional verification and expected-cost analysis of hybrid quantum programs with unbounded while loops.
-
TensorRocq: Enabling diagrammatic reasoning in Rocq
The paper develops verified Rocq tactics for string-diagram-based equational reasoning in symmetric monoidal categories via conversion to hypergraphs with interfaces.