The authors convert classical software bug detection into quantum optimization instances and test QAOA, Grover, and QSVT on small examples for potential polynomial speedup.
Z3: An Efficient Smt Solver
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
quant-ph 1years
2024 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Towards Classical Software Verification using Quantum Computers
The authors convert classical software bug detection into quantum optimization instances and test QAOA, Grover, and QSVT on small examples for potential polynomial speedup.