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.
Title resolution pending
3 Pith papers cite this work, alongside 9 external citations. Polarity classification is still indexing.
representative citing papers
A linear-time randomized static analysis that propagates constant-width bitstrings enables phase folding and T-count optimization matching SOTA tools on large circuits.
SAQR-QC is a new logic for scalable approximate quantitative reasoning about quantum circuits via local qubit operations and controlled precision loss, demonstrated on GHZ circuits and quantum phase estimation.
citing papers explorer
-
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.
-
Linear-Time T-Gate Optimization via Random Abstraction
A linear-time randomized static analysis that propagates constant-width bitstrings enables phase folding and T-count optimization matching SOTA tools on large circuits.
-
SAQR-QC: A Logic for Scalable but Approximate Quantitative Reasoning about Quantum Circuits
SAQR-QC is a new logic for scalable approximate quantitative reasoning about quantum circuits via local qubit operations and controlled precision loss, demonstrated on GHZ circuits and quantum phase estimation.