Formal reasoning about Bernstein-Vazirani algorithm
From MaRDI portal
Cites work
- A generalization of Bernstein-Vazirani algorithm with multiple secret keys and a probabilistic oracle
- An automated deductive verification framework for circuit-building quantum programs
- Certified quantum computation in Isabelle/HOL
- Formal verification of quantum algorithms using quantum Hoare logic
- scientific article; zbMATH DE number 1256737 (Why is no real title available?)
- scientific article; zbMATH DE number 7699438 (Why is no real title available?)
- Quantum complexity theory
- Quantum cryptography, quantum communication, and quantum computer in a noisy environment
- Quantum theory, the Church–Turing principle and the universal quantum computer
- Rapid solution of problems by quantum computation
- Verifying quantum communication protocols with ground bisimulation
This page was built for publication: Formal reasoning about Bernstein-Vazirani algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6847671)