Efficiently Verifying Quantum Programs with Few T Gates
No abstract available.
Related papers
- With a Few Square Roots, Quantum Computing Is as Easy as Pi POPL 2024
- Quartz: superoptimization of Quantum circuits PLDI 2022
- Verified compilation of Quantum oracles OOPSLA 2022
- Parameterized Verification of Quantum Circuits POPL 2026
- Verifying Fault-Tolerance of Quantum Error Correction Codes CAV 2025
- Synthetiq: Fast and Versatile Quantum Circuit Synthesis OOPSLA 2024
- Verifying Quantum Circuits with Level-Synchronized Tree Automata POPL 2025
- An Automata-Based Framework for Verification and Bug Hunting in Quantum Circuits PLDI 2023