December 2024
Intermediate to advanced
494 pages
8h 28m
English
The first generation of quantum algorithms appeared in the 1990s when quantum computers existed only as a concept. On the one hand, the absence of actual quantum hardware was a huge disadvantage since it made direct experiments impossible; on the other hand, it stimulated theoretical research not inhibited by the limitations and constraints of the imperfect early quantum computers. Researchers focused on devising algorithms that would achieve quadratic or even exponential speedup, assuming that powerful, error-free quantum computers would be available one day. It was the time when Shor’s prime factorisation algorithm [289] and Grover’s search algorithm [124] were discovered. Incidentally, as the book was about ...
Read now
Unlock full access