Publication details
Improving the Success Probability for Shor’s Factorization Algorithm
| Authors | |
|---|---|
| Year of publication | 2018 |
| Type | Article in Proceedings |
| Conference | Reversibility and Universality |
| MU Faculty or unit | |
| Citation | |
| Doi | http://dx.doi.org/10.1007/978-3-319-73216-9_21 |
| Keywords | Shor's factorization algorithm |
| Description | 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 |