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.
- Framework
- Qiskit
- Qubits
- 2
- Depth
- 8
- Gate set
- H, X, Z +1
- Licence
- Apache-2.0
- Version
- v1
- Updated
- 13 hours ago
- Runs
- None completed
Circuit
circuit.py · Qiskit · depth 8Loading circuit diagram…
Runs
No completed runs yet.
Runs are private to the person who ran them.
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.