Chris Pollett > Students > Yunxuan
[Bio] [Blog] [Final Step of Shor's and Grover's Algorithms] [Threshold of Error Correction] [Random-kSAT-Generator: Version 1] [Random-kQSAT-Generator: Version 2] [Random-kQSAT-Generator: Version 3] [Antiferromagnetic Heisenberg Model] [Random-kQSAT-Generator: Version 4] [Random-kQSAT-Generator: Version 5] [Random-kQSAT-Generator: Version 6] [Thesis] |
This page is about the success probability of Shor's algorithm and the success probability of Grover's algorithm. For the Shor's algorithm the final measurement has to be less than N and a multiple of Q/r. For the Grover's algorithm, the final measurement after t iterations is for certain the state that is being searched for. |