Timeline for Question Regarding Quantum Period-Finding Fourier Transform Approximation
Current License: CC BY-SA 4.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jan 1, 2021 at 23:24 | vote | accept | Rehaan Ahmad | ||
| Dec 28, 2020 at 18:02 | history | bumped | CommunityBot | This question has answers that may be good or bad; the system has marked it active so that they can be reviewed. | |
| Nov 28, 2020 at 17:39 | answer | added | Anatolii | timeline score: 4 | |
| Jun 18, 2020 at 8:31 | history | edited | CommunityBot |
Commonmark migration
|
|
| May 15, 2020 at 14:24 | comment | added | Sam Palmer | also remember you are techincally working in a binary system when applying the inverse transform, so when moving real numbers encoded back into binary registers the accuracy is limited by the closest binary representation, so if $r|2^t$ you can get an exact binary representation of the number. | |
| May 8, 2020 at 16:13 | comment | added | Sam Jaques | I think this is just an unclear explanation/error in the textbook. The inverse fourier transform in step 4 will not produce exactly $|\ell/r\rangle$, only an approximation, unless $r$ divides $2^t$. I think step 3 is exactly correct and the approximation is between step 3 and step 4. | |
| May 8, 2020 at 13:01 | history | edited | glS♦ | CC BY-SA 4.0 |
added 40 characters in body
|
| May 5, 2020 at 1:52 | history | asked | Rehaan Ahmad | CC BY-SA 4.0 |