Timeline for Is the $\mathcal O(n^2)$ cost of the quantum Fourier transform (QFT) known to be optimal?
Current License: CC BY-SA 4.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 10 at 4:03 | vote | accept | Manish Kumar | ||
| Feb 7 at 20:44 | history | edited | Mark Spinelli | CC BY-SA 4.0 |
added 186 characters in body
|
| Feb 7 at 19:53 | answer | added | Craig Gidney | timeline score: 6 | |
| Feb 7 at 15:52 | answer | added | Mark Spinelli | timeline score: 4 | |
| Feb 7 at 13:19 | history | edited | glS♦ | CC BY-SA 4.0 |
edited title
|
| Feb 7 at 6:27 | comment | added | Manish Kumar | Take (log(n))^2 algorithm in second paragraph on page 6 of coppersmith, 1994. Link: arxiv.org/pdf/quant-ph/0201067.pdf | |
| S Feb 7 at 0:54 | review | First questions | |||
| Feb 7 at 5:54 | |||||
| S Feb 7 at 0:54 | history | asked | Manish Kumar | CC BY-SA 4.0 |