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.
In: Yoshida, N
4 Pith papers cite this work. Polarity classification is still indexing.
4
Pith papers citing it
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.
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.
- TensorRocq: Enabling diagrammatic reasoning in Rocq