Specification, Semantics, and Verification of Quantum Programs
summary
Survey of methods claims that circuit semantics are handled as density matrices/mixed states to make execution deterministic, that SMT‑style and tableau techniques (the stabilizer formalism) scale to hundreds of gates, and that verified toolchains exist: a verified optimizer (Vox, 2021) and the Inquire/Choir/Squire stack for Coq/Rock-style proofs. Empirical limits: simulators top out near 30–60 qubits, devices range 10–thousands of qubits and need hundreds–millions of shots, and symbolic execution with bounded faults proves fault tolerance for concrete gadget families.
AI-written summary · about