
Improving the Success Probability for Shor’s Factorization Algorithm
Autoři | |
---|---|
Rok publikování | 2018 |
Druh | Článek ve sborníku |
Konference | Reversibility and Universality |
Fakulta / Pracoviště MU | |
Citace | XU, Guoliang, Daowen QIU, Xiangfu ZOU a Jozef GRUSKA. Improving the Success Probability for Shor’s Factorization Algorithm. In Reversibility and Universality. Cham, Switzerland: Springer, 2018, s. 447-462. ISBN 978-3-319-73215-2. Dostupné z: https://dx.doi.org/10.1007/978-3-319-73216-9_21. |
Doi | http://dx.doi.org/10.1007/978-3-319-73216-9_21 |
Klíčová slova | Shor's factorization algorithm |
Popis | In Shor’s factorization algorithm (SFA), the task is to find a non-trivial factor of a given composite integer N. Briefly said, SFA works as follows. It chooses randomly an integer y |