Towards Classical Software Verification using Quantum Computers
Gespeichert in:
| Veröffentlicht in: | The Institute of Electrical and Electronics Engineers, Inc. (IEEE) Conference Proceedings (2025), p. 598-605 |
|---|---|
| 1. Verfasser: | |
| Weitere Verfasser: | , |
| Veröffentlicht: |
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
|
| Schlagworte: | |
| Online-Zugang: | Citation/Abstract |
| Tags: |
Keine Tags, Fügen Sie das erste Tag hinzu!
|
MARC
| LEADER | 00000nab a2200000uu 4500 | ||
|---|---|---|---|
| 001 | 3204788308 | ||
| 003 | UK-CbPIL | ||
| 024 | 7 | |a 10.1109/QCNC64685.2025.00099 |2 doi | |
| 035 | |a 3204788308 | ||
| 045 | 2 | |b d20250101 |b d20251231 | |
| 084 | |a 228229 |2 nlm | ||
| 100 | 1 | |a Issel, Sebastian |u Fraunhofer AISEC,Garching,Germany,85748 | |
| 245 | 1 | |a Towards Classical Software Verification using Quantum Computers | |
| 260 | |b The Institute of Electrical and Electronics Engineers, Inc. (IEEE) |c 2025 | ||
| 513 | |a Conference Proceedings | ||
| 520 | 3 | |a Conference Title: 2025 International Conference on Quantum Communications, Networking, and Computing (QCNC)Conference Start Date: 2025 March 31Conference End Date: 2025 April 2Conference Location: Nara, JapanWe 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 such errors, we try to verify that no such flaws exist.In our approach, for some code snippet and undesired behavior, a SAT instance is generated, which is satisfiable precisely if the behavior is present in the code. It is in turn converted to an optimization problem, that is solved on a quantum computer. This approach holds the potential of an asymptotically polynomial speedup.Minimal examples of common errors, like out-of-bounds and overflows, but also synthetic instances with special properties, specific number of solutions, or structure, are tested with different solvers and tried on a quantum device.We use the near-standard Quantum Approximation Optimization Algorithm, an application of the Grover algorithm, and the Quantum Singular Value Transformation to find the optimal solution, and with it a satisfying assignment. | |
| 653 | |a Algorithms | ||
| 653 | |a Quantum computing | ||
| 653 | |a Program verification (computers) | ||
| 653 | |a Errors | ||
| 653 | |a Quantum computers | ||
| 653 | |a Software | ||
| 653 | |a Polynomials | ||
| 653 | |a Optimization | ||
| 653 | |a Economic | ||
| 700 | 1 | |a Kilian Tscharke |u Fraunhofer AISEC,Garching,Germany,85748 | |
| 700 | 1 | |a Debus, Pascal |u Fraunhofer AISEC,Garching,Germany,85748 | |
| 773 | 0 | |t The Institute of Electrical and Electronics Engineers, Inc. (IEEE) Conference Proceedings |g (2025), p. 598-605 | |
| 786 | 0 | |d ProQuest |t Science Database | |
| 856 | 4 | 1 | |3 Citation/Abstract |u https://www.proquest.com/docview/3204788308/abstract/embedded/L8HZQI7Z43R0LA5T?source=fedsrch |