Towards quantum programs verification: from Quipper circuits to QPMC
From MaRDI portal
Recommendations
Cites work
Cited in
(16)- An automated deductive verification framework for circuit-building quantum programs
- Verification of quantum computation: an overview of existing approaches
- Certified quantum computation in Isabelle/HOL
- \(\mathcal{Q}\)\textsc{wire} practice: formal verification of quantum circuits in Coq
- Shaded tangles for the design and verification of quantum programs (extended abstract)
- Towards large-scale functional verification of universal quantum circuits
- \textit{Re}\(\mathcal{Q}\)\textsc{wire}: reasoning about reversible quantum circuits
- Verifying the Steane code with Quantomatic
- Invariants of quantum programs: characterisations and generation
- Quantum symbolic execution
- Quantum encoding of dynamic directed graphs
- Formal verification of quantum algorithms using quantum Hoare logic
- Mirrors and memory in quantum automata
- \textsf{symQV}: automated symbolic verification of quantum programs
- Model Checking for Verification of Quantum Circuits
- Toward automatic verification of quantum programs
This page was built for publication: Towards quantum programs verification: from Quipper circuits to QPMC
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3186602)