Coursera Flash Sale
40% Off Coursera Plus for 3 Months!
Grab it
Explore quantum formal verification through the innovative path-sum approach in this 40-minute conference presentation from PLanQC 2026. Discover how quantum programming's unique challenges—particularly the impossibility of using standard debugging techniques due to destructive and non-deterministic measurement—necessitate formal analysis solutions for complex quantum data structures with unintuitive behaviors. Learn about the evolution of quantum formal verification tools including Coqq, Qafny, and QHL, which enable developers to build mathematical proofs that quantum programs satisfy their specifications. Examine the current limitations of formal verification, including the extensive expertise required and the fact that formal proofs often exceed program length significantly. Understand how the path-sum representation offers promising potential to reduce both the complexity of program specification proofs and the level of expertise required from developers, making quantum formal verification more accessible to a broader programming community.
