Grover's Algorithm: Difference between revisions
From wikiluntti
(Created page with "== Introduction == == Theory == === Oracle Function === === Amplitude Amplification === The uniform superposition: <math>|u\rangle = H^{\otimes n}|0\rangle^n</math>, wher...") |
|||
Line 20: | Line 20: | ||
https://quantumcomputinguk.org/tutorials/grovers-algorithm-with-code | https://quantumcomputinguk.org/tutorials/grovers-algorithm-with-code | ||
https://jonathan-hui.medium.com/qc-grovers-algorithm-cd81e61cf248 |
Revision as of 17:43, 26 November 2020
Introduction
Theory
Oracle Function
Amplitude Amplification
The uniform superposition: , where is the Hadamard gate.
Apply the oracle reflection .
Apply an other reflection about the state , also . Thus we are at state . This amplifies by two the amplitude of state .
Repeat .
References
https://medium.com/swlh/grovers-algorithm-quantum-computing-1171e826bcfb
https://quantumcomputinguk.org/tutorials/grovers-algorithm-with-code
https://jonathan-hui.medium.com/qc-grovers-algorithm-cd81e61cf248