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.

Run Cite

Framework: Qiskit
Qubits: 4
Depth: 6
Gate set: H, X, CX
Licence: Apache-2.0
Version: v1
Updated: 15 hours ago
Runs: 2 completed

Circuit

circuit.py · Qiskit · depth 6

2 completed runs

2 completed runs.

Runs are private to the person who ran them.

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.