qubithubbernstein-vazirani
Finds a hidden bit string s encoded in an oracle f(x) = s·x (mod 2) using a single quantum query. Generalizes Deutsch-Jozsa to extract the full structure of a linear Boolean function — reducing n classical queries to one.
- Framework
- Qiskit
- Qubits
- 4
- Depth
- 4
- Gate set
- H, X, CX
- Licence
- Not specified
- Version
- v1
- Updated
- 3 days ago
- Last run
- 3 months ago
Circuit
circuit.py · Qiskit · depth 4Loading circuit diagram…
metadata.json · 476 B
Code
Loading metadata.json…
Lineage
Not a fork.
No forks yet.
Suggested citation
@software{qubithub_bernsteinvazirani_2026,
author = {QubitHub Circuits},
title = {Bernstein-Vazirani Algorithm},
year = {2026},
version = {v1},
url = {https://qubithub.co/qubithub/bernstein-vazirani},
}Generated from this circuit's metadata. QubitHub does not mint DOIs, so this is not a registered identifier — check it against your venue's requirements before publishing.