Towards Efficient Reasoning of Quantum Programs
No abstract available.
Related papers
- Simulating Quantum Circuits by Model Counting CAV 2024
- Automating Equational Proofs in Dirac Notation POPL 2025
- D-Hammer: Efficient Equational Reasoning for Labelled Dirac Notation CAV 2025
- Modular Synthesis of Efficient Quantum Uncomputation OOPSLA 2024
- Hybrid Path-Sums for Hybrid Quantum Programs PLDI 2026
- A Practical Specification Language for Automatic Quantum Program Verification CAV 2026
- Synthesizing Quantum-Circuit Optimizers PLDI 2023
- Local Reasoning About Probabilistic Behaviour for Classical-Quantum Programs VMCAI 2024