Coursera Flash Sale
40% Off Coursera Plus for 3 Months!
Grab it
Learn about a unified assertion-based framework for verifying classical-quantum programs in this 23-minute conference presentation from PLanQC 2026. Explore the interleaved challenges that arise when formally verifying practical quantum programs and discover a new verification framework designed to be intuitive, user-friendly, and compatible with interactive theorem provers. Understand the key insights behind this approach, including classicality by subtype and the application of assertion-based predicates and Hoare logic to quantum program verification. Gain insights into how this framework addresses the unique complexities of verifying programs that combine classical and quantum computational elements, making formal verification more accessible for quantum software development.
