Skip to main content

Currently Skimming:

Quantum Algorithms: Promise and Perspective - Shelby Kimmel
Pages 9-12

The Chapter Skim interface presents what we've algorithmically identified as the most significant single chunk of text within every page in the chapter.
Select key terms on the right to highlight them within pages of the chapter.


From page 9...
... . There is a quantum factoring algorithm whose run time scales roughly like the number of digits in the integer, whereas the best classical algorithm requires nearly exponential time.
From page 10...
... While quantum algorithms have impressive performance for problems like factoring and quantum simulation, there are many problems where quantum computers provably do not have a large advantage over regular computers. The best-known example is the parity problem, which involves determining whether a string of 0s and 1s has an even or odd number of 1s.
From page 11...
... Quantum programming languages have just begun to be developed, and for many existing algorithms there is not an easy way to go from the theoretical description to a programming language description. Furthermore, even when an algorithm is described by a quantum programming language, there remain many challenges in converting instructions to quantum machine code, as different physical quantum computers tend to have different sets of basic operations.
From page 12...
... While these applications are exciting, current understanding of quantum algorithms is truly quite limited. As physical quantum computers are developed and quantum algorithms are tested on them, an unprecedented new tool will be available for the development and exploration of quantum algorithms.


This material may be derived from roughly machine-read images, and so is provided only to facilitate research.
More information on Chapter Skim is available.