A bridge between Classical Hashing and Quantum Amplitude Amplification (Grover's Algorithm). Includes interactive QFT canvas for Google Cirq.
Target Hash:
Current Step: Start
Initialization: 3 Hadamards (\(H^{\otimes 3}\)) create a uniform superposition. The probability amplitude \(\alpha\) is identical for all states:
In Baby-Bitcoin, you must hash inputs one by one. Finding the target out of 8 possibilities takes an average of \(N/2 = 4\) steps, and up to \(N = 8\) steps.
Grover's Algorithm flips the amplitude of the target state, then reflects all amplitudes around the mean. The target state's probability spikes instantly!
Run this Grover search circuit on a simulated (or real) QPU.
A quantum circuit doesn't use physical wiring to execute code; instead, it fires a precise chronological sequence of microwave pulses at stationary qubits to manipulate their quantum waves.
Here is the "sheet music" the hardware plays to run a 3-qubit Grover search for the target \(|\mathit{101}\rangle\):
1, 0, and 1 with near 100% certainty!