Timeline for Can quantum computer compute the sum of $n$ natural numbers in $\Theta(\log n)$ time?
Current License: CC BY-SA 3.0
10 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Aug 14, 2017 at 9:01 | history | tweeted | twitter.com/StackCompSci/status/897020446352297985 | ||
| Aug 13, 2017 at 22:18 | vote | accept | Farewell Stack Exchange | ||
| Aug 13, 2017 at 22:14 | answer | added | Craig Gidney | timeline score: 5 | |
| Aug 12, 2017 at 19:55 | comment | added | Farewell Stack Exchange | But there is no answer to the question: "Is $QLOGTIME \subsetneq L?$" , this question is still unknown and open. Am I right? | |
| Aug 12, 2017 at 19:48 | comment | added | rus9384 | If it is known if $\mathsf{QLOGTIME \subsetneq L}$, the answer is negative. | |
| Aug 12, 2017 at 19:09 | history | edited | Farewell Stack Exchange | CC BY-SA 3.0 |
added 63 characters in body
|
| Aug 12, 2017 at 18:19 | history | edited | Yuval Filmus | CC BY-SA 3.0 |
added 4 characters in body; edited title
|
| Aug 12, 2017 at 18:18 | comment | added | Yuval Filmus | I'm not an expert, but an exponential speed up is unlikely. Grover's algorithm only gives a square root speed up. | |
| Aug 12, 2017 at 18:07 | history | edited | Farewell Stack Exchange | CC BY-SA 3.0 |
added 545 characters in body
|
| Aug 12, 2017 at 17:46 | history | asked | Farewell Stack Exchange | CC BY-SA 3.0 |