arXiv (All)
open access
Towards Classical Software Verification using Quantum Computers
We explore the possibility of accelerating the formal verification of classical programs with a quantum computer. A common source of security flaws stems from the existence of common programming errors like use after free, null-pointer dereference, or division by zero. To aid in the discovery of s
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Failure-Guided Fuzzing for Hybrid Quantum-Classical Programs#187382
- Efficiently verifiable quantum advantage using error correction#1215352
- QuSema: Detecting Silent Bugs in Quantum Libraries via Quantum-knowledge-enhanced Agents#1234625
- QuSema: Detecting Silent Bugs in Quantum Libraries via Quantum-knowledge-enhanced Agents#1227384
- QUTest: A Native Testing Framework for Quantum Programs#204843
Record · ID 1186295
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive