analiza aiqbench

This research establishes formal semantics and verification methods specifically for continuous-variable quantum computing (CVQC), addressing the unique challenge of reasoning over infinite, unbounded measurement values using closed positive quadratic forms. By providing a unified mathematical framework that consolidates disparate concepts like expectations and penalties into single objects, this work enables sound correctness proofs essential for building reliable CVQC software stacks. The validation via GKP error-correcting code case studies demonstrates practical applicability in verifying complex quantum algorithms within an optics-based hardware paradigm.