![]() ![]() There are well known complexity theorems that show that in this context a quantum computer can solve the “search problem” faster than a classical computer.īut because we closed our eyes and decided not to look at the source code does not mean it does not exist. Grover’s algorithm uses the concept of “oracle”, a black box function that one can call, but of which one is forbidden to see the source code. This dichotomy is particularly acute in the context of the emblematic Grover search algorithm, one of the cornerstone of quantum computing. Physicists on the other hand spend their life questioning the hypothesis, wondering if they do apply to the real world. The hypothesis are never questioned, by definition. The former define mathematical objects and consider any mathematical problem as legitimate. One of the problem we face in the field of quantum computing is a vast diversity of cultures between, say, complexity theorists on one hand and physicists on the other hand. The elephant in the (quantum computing) room: opening the Pandora box of the quantum oracle Here is Waintal’s response, exactly as sent to me: He remarked that the “classy” thing for me to do would be to post the response on my blog, but: “I would totally understand if you did not want to be contradicted in your own zone of influence.” This morning Xavier Waintal, coauthor of the new arXiv preprint “””refuting””” Grover’s algorithm, which I dismantled here yesterday, emailed me a two-paragraph response.
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |