The paper presents a CUDA-Q debugging workflow with classical, uniform, and product state assertions, using Fisher's exact test and Monte Carlo sampling to improve on chi-square-based product state checks.
The glivenko–cantelli theorem,
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
quant-ph 1years
2025 1verdicts
REJECT 1roles
background 1polarities
support 1representative citing papers
citing papers explorer
-
Statistical Assertions for Debugging Quantum Circuits and States in CUDA-Q
The paper presents a CUDA-Q debugging workflow with classical, uniform, and product state assertions, using Fisher's exact test and Monte Carlo sampling to improve on chi-square-based product state checks.