.png){kind=icon}
.png){kind=icon}
Return
Formal reasoning about Bernstein-Vazirani algorithm
.png){kind=icon}
PRE
AI
DOI：10.1016/j.jlamp.2025.101108.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
As a basic quantum algorithm, the Bernstein-Vazirani algorithm is based on the principles of superposition in quantum mechanics, demonstrating superior efficiency over classical computation in finding hidden strings. Due to the high complexity of quantum mechanics, the correctness of quantum algorithms is difficult to guarantee through traditional simulation methods. By contrast, the Bernstein-Vazirani algorithm's fundamental concepts and mathematical structures can be formalized into logical expressions and verified by higher-order logical reasoning. In this paper, we formally model and verify the Bernstein-Vazirani algorithm in the HOL Light theorem prover. Meanwhile, to indicate the practical significance of our work, we analyze two realistic scenarios, the error correction in quantum key distribution and image encryption and decryption.
Keywords:
Bernstein-Vazirani algorithm
Theorem prover
Quantum algorithm
Formal verification
Journal
J
IF:
1.2
Papers:
15
Citations:
0
