Quantum Advantage with Deutsch-Jozsa, Bernstein-Vazirani, and Simon’s Algorithms
摘要
In this chapter, we study three algorithms of little practical use but important because they were the first to show that quantum computers can solve problems significantly faster than classical ones. Consider the time complexities O(n) for the algorithms: classical vs. quantum in Table 9-1 (where n is the size of the input).