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.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
citation-role summary
background 2
citation-polarity summary
years
2026 2verdicts
UNVERDICTED 2roles
background 2polarities
background 2representative citing papers
In multi-copy state discrimination, qubit strategies beat bit strategies, but some bit-like operational theories outperform qubits even classically, revealing nonlocality without entanglement and providing general bounds.
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.
-
Nonclassical traits in multi-copy state discrimination
In multi-copy state discrimination, qubit strategies beat bit strategies, but some bit-like operational theories outperform qubits even classically, revealing nonlocality without entanglement and providing general bounds.