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.
(eds.) Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing, May 16-18, 1993, San Diego, CA, USA
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
cs.LO 1years
2026 1verdicts
UNVERDICTED 1roles
background 1polarities
background 1representative citing papers
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.