Quantum Computing
010000101110011010100111101101101110100110111111000010101000100110101001101110101101100010100111100000111111010010100001101000101011111111100010101100111111100000101011011110011010101101111111
-
Grover's Search - 16-bit Example
- 216 = 65536 possibilities,
would take (216)/2 = 32768 iterations on average classically
-
Takes only (π/4)216/2 = 201 quantum iterations optimally,
success probability 0.999988
Quantum Computing Emulation, R. Perry, 2018