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. Polarity classification is still indexing.
3
Pith papers citing it
representative citing papers
Mapping approximation strategy allocation in quantum circuits to a 1D Ising model enables a linear-time optimal algorithm that reduces gate count by 26% on average.
AutoQ 2.0 verifies quantum programs with classical control flow and successfully checks RUS algorithms instantly plus weak-measurement Grover search on 100 qubits in about 20 minutes.
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.
-
Optimal Approximation of Single Qubit Rotations within a Quantum Circuit
Mapping approximation strategy allocation in quantum circuits to a 1D Ising model enables a linear-time optimal algorithm that reduces gate count by 26% on average.
-
AutoQ 2.0: From Verification of Quantum Circuits to Verification of Quantum Programs (Technical Report)
AutoQ 2.0 verifies quantum programs with classical control flow and successfully checks RUS algorithms instantly plus weak-measurement Grover search on 100 qubits in about 20 minutes.