QubitHub

qubithubgrover-search

Searches an unstructured database of N=4 items using Grover's algorithm, finding the marked item with 100% probability in a single oracle query. Demonstrates amplitude amplification — the oracle marks the target with a phase flip, and the diffusion operator (inversion about the mean) boosts its probability from 25% to 100%. Provides a provably optimal quadratic speedup: O(sqrt(N)) vs O(N) classical.

RunCite

No licence specified, so all rights are reserved by default — forking copies this circuit but grants you no rights to reuse it.

Framework
Qiskit
Qubits
2
Depth
6
Gate set
H, X, Z +1
Licence
Not specified
Version
v1
Updated
3 days ago
Last run
3 months ago

Circuit

circuit.py · Qiskit · depth 6
Loading circuit diagram…

metadata.json · 477 B

Code

Loading metadata.json…

Lineage

Not a fork.

No forks yet.

Suggested citation

@software{qubithub_groversearch_2026,
  author = {QubitHub Circuits},
  title = {Grover's Search Algorithm},
  year = {2026},
  version = {v1},
  url = {https://qubithub.co/qubithub/grover-search},
}

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.