jaddood
Joined 9 years ago
Joined 9 years ago
If it's so important to have a "rng" instead of a "ring" then using its name in some example of its usage should probably be better.
That council would then have the task of reviewing new technologies and their potential impacts. The council may then have different subgroups each discussing a certain technology, or possibly each with a certain specific task such as: reviewing research papers, watching the developments inside companies, writing legal propositions, etc...
This council could then be under a government agency, or better yet, an NGO that can get funding by the government, from donations, universities, etc...
What would you think about that?
> The only difference between Theorem 1 and its quantum equivalent in [13] is that the quantum algorithm has no ε approximation factors (so ε=0 and 1/ε does not appear in the runtime). Thus, we can say that our algorithm performs just as well, up to polynomial slowdown and ε approximation factors.
With ε being the accepted margin of error, theorem 1 being the algorithm produced by Tang, and [13] being a reference to Kerenidis and Prakash's quantum algorithm kept here in the quote for fidelity of quoting.
This means that this algorithm is not really a substitue for the quantum algorithm because it will require a level of error to be accepted (something which might work in recommendation engines, but not necessarily outside that context) and it still has polynomial slowdown over the quantum algorithm. One thing to note is that not all quantum algorithms will perform exponenttially better than their classical counterparts. Particularily, some quantum search algorithms perform only quadratically better than the classical search algorithms. This means that even if an exponential speedup was not achieved by quantum computers, (which it still is because of the ε factor meaning they don't give the same results) it is expected that they still achieve polynomial speedup as they do in this case.
In conclusion, stating that this algorithm threatens the prospects of quantum computation is probably an exageration.
Could you give an overview of the proceedings of your job as a researcher in quantum computing?
For instance, how do you start your day job, what do you do during the day (how exactly do you do research,) how do you end your day, etc...